./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_2b.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/NestedRecursion_2b.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 422ea435de955cc6e58e578076c5ef733a2456157ad413df035d109cb231427a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:02:36,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:02:36,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:02:36,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:02:36,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:02:36,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:02:36,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:02:36,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:02:36,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:02:36,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:02:36,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:02:36,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:02:36,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:02:36,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:02:36,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:02:36,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:02:36,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:02:36,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:02:36,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:02:36,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:02:36,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:02:36,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:02:36,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:02:36,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:02:36,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:02:36,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:02:36,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:02:36,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:02:36,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:02:36,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:02:36,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:02:36,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:02:36,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:02:36,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:02:36,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:02:36,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:02:36,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:02:36,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:02:36,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:02:36,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:02:36,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:02:36,940 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:02:36,967 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:02:36,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:02:36,968 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:02:36,968 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:02:36,969 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:02:36,969 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:02:36,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:02:36,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:02:36,969 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:02:36,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:02:36,970 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:02:36,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:02:36,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:02:36,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:02:36,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:02:36,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:02:36,971 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:02:36,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:02:36,971 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:02:36,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:02:36,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:02:36,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:02:36,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:02:36,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:02:36,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:02:36,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:02:36,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:02:36,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:02:36,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:02:36,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:02:36,973 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 -> 422ea435de955cc6e58e578076c5ef733a2456157ad413df035d109cb231427a [2022-02-21 03:02:37,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:02:37,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:02:37,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:02:37,166 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:02:37,166 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:02:37,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_2b.c [2022-02-21 03:02:37,215 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cd8f8de0/0d74cac36c3d457da9263c270534fb02/FLAG87fefbdb3 [2022-02-21 03:02:37,564 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:02:37,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_2b.c [2022-02-21 03:02:37,568 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cd8f8de0/0d74cac36c3d457da9263c270534fb02/FLAG87fefbdb3 [2022-02-21 03:02:37,577 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cd8f8de0/0d74cac36c3d457da9263c270534fb02 [2022-02-21 03:02:37,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:02:37,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:02:37,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:02:37,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:02:37,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:02:37,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:02:37" (1/1) ... [2022-02-21 03:02:37,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d30347b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:37, skipping insertion in model container [2022-02-21 03:02:37,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:02:37" (1/1) ... [2022-02-21 03:02:37,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:02:37,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:02:37,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:02:37,716 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:02:37,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:02:37,732 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:02:37,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:37 WrapperNode [2022-02-21 03:02:37,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:02:37,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:02:37,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:02:37,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:02:37,738 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:02:37" (1/1) ... [2022-02-21 03:02:37,741 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:02:37" (1/1) ... [2022-02-21 03:02:37,753 INFO L137 Inliner]: procedures = 5, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 11 [2022-02-21 03:02:37,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:02:37,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:02:37,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:02:37,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:02:37,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:37" (1/1) ... [2022-02-21 03:02:37,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:37" (1/1) ... [2022-02-21 03:02:37,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:37" (1/1) ... [2022-02-21 03:02:37,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:37" (1/1) ... [2022-02-21 03:02:37,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:37" (1/1) ... [2022-02-21 03:02:37,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:37" (1/1) ... [2022-02-21 03:02:37,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:37" (1/1) ... [2022-02-21 03:02:37,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:02:37,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:02:37,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:02:37,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:02:37,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:37" (1/1) ... [2022-02-21 03:02:37,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:02:37,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:37,790 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:02:37,793 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:02:37,827 INFO L130 BoogieDeclarations]: Found specification of procedure g [2022-02-21 03:02:37,828 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2022-02-21 03:02:37,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:02:37,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:02:37,863 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:02:37,864 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:02:38,069 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:02:38,075 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:02:38,075 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:02:38,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:02:38 BoogieIcfgContainer [2022-02-21 03:02:38,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:02:38,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:02:38,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:02:38,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:02:38,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:02:37" (1/3) ... [2022-02-21 03:02:38,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb4f6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:02:38, skipping insertion in model container [2022-02-21 03:02:38,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:02:37" (2/3) ... [2022-02-21 03:02:38,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb4f6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:02:38, skipping insertion in model container [2022-02-21 03:02:38,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:02:38" (3/3) ... [2022-02-21 03:02:38,099 INFO L111 eAbstractionObserver]: Analyzing ICFG NestedRecursion_2b.c [2022-02-21 03:02:38,116 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:02:38,117 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-21 03:02:38,187 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:02:38,205 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:02:38,206 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-21 03:02:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:02:38,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:02:38,260 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:38,261 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:38,261 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:38,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:38,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1134721268, now seen corresponding path program 1 times [2022-02-21 03:02:38,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:38,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076784341] [2022-02-21 03:02:38,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:38,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} assume { :begin_inline_ULTIMATE.init } true; {27#true} is VALID [2022-02-21 03:02:38,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {29#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:02:38,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume !(main_~x~0#1 < 0); {29#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:02:38,465 INFO L272 TraceCheckUtils]: 3: Hoare triple {29#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} call main_#t~ret3#1 := g(main_~x~0#1); {30#(<= |g_#in~x| 2147483647)} is VALID [2022-02-21 03:02:38,466 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#(<= |g_#in~x| 2147483647)} ~x := #in~x; {31#(<= g_~x 2147483647)} is VALID [2022-02-21 03:02:38,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#(<= g_~x 2147483647)} assume !(0 == ~x); {31#(<= g_~x 2147483647)} is VALID [2022-02-21 03:02:38,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#(<= g_~x 2147483647)} assume !(~x - 1 <= 2147483647); {28#false} is VALID [2022-02-21 03:02:38,468 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:02:38,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:38,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076784341] [2022-02-21 03:02:38,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076784341] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:38,470 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:38,470 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:02:38,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340629819] [2022-02-21 03:02:38,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:38,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:02:38,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:38,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:38,489 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:02:38,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:02:38,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:38,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:02:38,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:02:38,510 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,709 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-21 03:02:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:02:38,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:02:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-02-21 03:02:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-02-21 03:02:38,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-02-21 03:02:38,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:38,773 INFO L225 Difference]: With dead ends: 42 [2022-02-21 03:02:38,774 INFO L226 Difference]: Without dead ends: 37 [2022-02-21 03:02:38,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:38,791 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:38,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 67 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:38,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-21 03:02:38,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-02-21 03:02:38,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:38,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:02:38,817 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:02:38,818 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:02:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,822 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-21 03:02:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-21 03:02:38,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-02-21 03:02:38,824 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-02-21 03:02:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,827 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-21 03:02:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-21 03:02:38,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:38,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:38,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:38,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 25 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:02:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-02-21 03:02:38,832 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 7 [2022-02-21 03:02:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:38,833 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-02-21 03:02:38,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-02-21 03:02:38,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:02:38,834 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:38,834 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:38,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:02:38,834 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:38,835 INFO L85 PathProgramCache]: Analyzing trace with hash 816620978, now seen corresponding path program 1 times [2022-02-21 03:02:38,835 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:38,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920552995] [2022-02-21 03:02:38,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:38,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:38,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {199#true} assume { :begin_inline_ULTIMATE.init } true; {199#true} is VALID [2022-02-21 03:02:38,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {199#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {199#true} is VALID [2022-02-21 03:02:38,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {199#true} assume !(main_~x~0#1 < 0); {201#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:38,867 INFO L272 TraceCheckUtils]: 3: Hoare triple {201#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {202#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:38,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {202#(<= 0 |g_#in~x|)} ~x := #in~x; {203#(<= 0 g_~x)} is VALID [2022-02-21 03:02:38,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {203#(<= 0 g_~x)} assume !(0 == ~x); {203#(<= 0 g_~x)} is VALID [2022-02-21 03:02:38,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {203#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {203#(<= 0 g_~x)} is VALID [2022-02-21 03:02:38,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {203#(<= 0 g_~x)} assume !(~x - 1 >= -2147483648); {200#false} is VALID [2022-02-21 03:02:38,870 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:02:38,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:38,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920552995] [2022-02-21 03:02:38,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920552995] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:38,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:38,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:02:38,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795994811] [2022-02-21 03:02:38,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:38,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:02:38,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:38,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:38,880 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:02:38,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:02:38,880 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:38,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:02:38,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:02:38,881 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:38,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:38,995 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-02-21 03:02:38,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:02:38,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:02:38,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-02-21 03:02:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-02-21 03:02:39,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-02-21 03:02:39,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:39,038 INFO L225 Difference]: With dead ends: 51 [2022-02-21 03:02:39,038 INFO L226 Difference]: Without dead ends: 47 [2022-02-21 03:02:39,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:39,039 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:39,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 65 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:39,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-21 03:02:39,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-02-21 03:02:39,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:39,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 41 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:39,057 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 41 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:39,058 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 41 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:39,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:39,061 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-02-21 03:02:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-02-21 03:02:39,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:39,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:39,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 47 states. [2022-02-21 03:02:39,063 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 47 states. [2022-02-21 03:02:39,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:39,066 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-02-21 03:02:39,066 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-02-21 03:02:39,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:39,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:39,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:39,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:02:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-02-21 03:02:39,070 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 8 [2022-02-21 03:02:39,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:39,070 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-02-21 03:02:39,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-02-21 03:02:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 03:02:39,071 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:39,071 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:39,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:02:39,071 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:39,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash 496687761, now seen corresponding path program 1 times [2022-02-21 03:02:39,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:39,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748515549] [2022-02-21 03:02:39,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:39,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:39,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#true} assume { :begin_inline_ULTIMATE.init } true; {414#true} is VALID [2022-02-21 03:02:39,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {414#true} is VALID [2022-02-21 03:02:39,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume !(main_~x~0#1 < 0); {416#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:39,135 INFO L272 TraceCheckUtils]: 3: Hoare triple {416#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {417#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:39,136 INFO L290 TraceCheckUtils]: 4: Hoare triple {417#(<= 0 |g_#in~x|)} ~x := #in~x; {418#(<= 0 g_~x)} is VALID [2022-02-21 03:02:39,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {418#(<= 0 g_~x)} assume !(0 == ~x); {418#(<= 0 g_~x)} is VALID [2022-02-21 03:02:39,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {418#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {418#(<= 0 g_~x)} is VALID [2022-02-21 03:02:39,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {418#(<= 0 g_~x)} is VALID [2022-02-21 03:02:39,141 INFO L272 TraceCheckUtils]: 8: Hoare triple {418#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {419#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:39,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {420#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:39,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {420#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:39,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {420#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:39,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {420#(<= 0 (+ g_~x 1))} assume !(~x - 1 >= -2147483648); {415#false} is VALID [2022-02-21 03:02:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:39,145 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:39,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748515549] [2022-02-21 03:02:39,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748515549] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:39,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480379461] [2022-02-21 03:02:39,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:39,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:39,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:39,148 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:02:39,153 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:02:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:39,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:02:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:39,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:39,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#true} assume { :begin_inline_ULTIMATE.init } true; {414#true} is VALID [2022-02-21 03:02:39,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {414#true} is VALID [2022-02-21 03:02:39,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume !(main_~x~0#1 < 0); {416#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:39,398 INFO L272 TraceCheckUtils]: 3: Hoare triple {416#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {417#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:39,399 INFO L290 TraceCheckUtils]: 4: Hoare triple {417#(<= 0 |g_#in~x|)} ~x := #in~x; {418#(<= 0 g_~x)} is VALID [2022-02-21 03:02:39,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {418#(<= 0 g_~x)} assume !(0 == ~x); {418#(<= 0 g_~x)} is VALID [2022-02-21 03:02:39,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {418#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {418#(<= 0 g_~x)} is VALID [2022-02-21 03:02:39,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {418#(<= 0 g_~x)} is VALID [2022-02-21 03:02:39,401 INFO L272 TraceCheckUtils]: 8: Hoare triple {418#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {419#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:39,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {420#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:39,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {420#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:39,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {420#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:39,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {420#(<= 0 (+ g_~x 1))} assume !(~x - 1 >= -2147483648); {415#false} is VALID [2022-02-21 03:02:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:39,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:39,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {460#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {415#false} is VALID [2022-02-21 03:02:39,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {460#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {460#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:39,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {460#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {460#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:39,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {470#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {460#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:39,557 INFO L272 TraceCheckUtils]: 8: Hoare triple {474#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {470#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:02:39,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {474#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:39,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {474#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {474#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:39,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {474#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:39,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {487#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {474#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:39,559 INFO L272 TraceCheckUtils]: 3: Hoare triple {491#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} call main_#t~ret3#1 := g(main_~x~0#1); {487#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:02:39,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume !(main_~x~0#1 < 0); {491#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483646))} is VALID [2022-02-21 03:02:39,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {414#true} is VALID [2022-02-21 03:02:39,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#true} assume { :begin_inline_ULTIMATE.init } true; {414#true} is VALID [2022-02-21 03:02:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:39,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480379461] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:39,560 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:39,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-02-21 03:02:39,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528102623] [2022-02-21 03:02:39,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:39,561 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 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:02:39,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:39,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:39,576 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:02:39,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:02:39,576 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:39,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:02:39,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:02:39,577 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,112 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-02-21 03:02:40,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-21 03:02:40,113 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 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:02:40,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 98 transitions. [2022-02-21 03:02:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 98 transitions. [2022-02-21 03:02:40,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 98 transitions. [2022-02-21 03:02:40,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:40,231 INFO L225 Difference]: With dead ends: 96 [2022-02-21 03:02:40,231 INFO L226 Difference]: Without dead ends: 95 [2022-02-21 03:02:40,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:02:40,233 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 127 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:40,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 126 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:02:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-21 03:02:40,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2022-02-21 03:02:40,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:40,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 77 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 59 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-21 03:02:40,286 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 77 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 59 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-21 03:02:40,287 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 77 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 59 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-21 03:02:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,291 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2022-02-21 03:02:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2022-02-21 03:02:40,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:40,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:40,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 59 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 95 states. [2022-02-21 03:02:40,293 INFO L87 Difference]: Start difference. First operand has 77 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 59 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 95 states. [2022-02-21 03:02:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,305 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2022-02-21 03:02:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2022-02-21 03:02:40,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:40,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:40,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:40,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 59 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-21 03:02:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2022-02-21 03:02:40,310 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 13 [2022-02-21 03:02:40,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:40,311 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2022-02-21 03:02:40,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2022-02-21 03:02:40,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 03:02:40,311 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:40,312 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:40,339 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:02:40,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:40,532 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:40,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:40,533 INFO L85 PathProgramCache]: Analyzing trace with hash 574996991, now seen corresponding path program 1 times [2022-02-21 03:02:40,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:40,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276903431] [2022-02-21 03:02:40,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:40,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:02:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {915#true} ~x := #in~x; {915#true} is VALID [2022-02-21 03:02:40,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {915#true} assume 0 == ~x;#res := 1; {922#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:40,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {922#(<= |g_#res| 1)} assume true; {922#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:40,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {922#(<= |g_#res| 1)} {915#true} #32#return; {921#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:40,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {915#true} assume { :begin_inline_ULTIMATE.init } true; {915#true} is VALID [2022-02-21 03:02:40,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {915#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {915#true} is VALID [2022-02-21 03:02:40,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {915#true} assume !(main_~x~0#1 < 0); {915#true} is VALID [2022-02-21 03:02:40,595 INFO L272 TraceCheckUtils]: 3: Hoare triple {915#true} call main_#t~ret3#1 := g(main_~x~0#1); {915#true} is VALID [2022-02-21 03:02:40,595 INFO L290 TraceCheckUtils]: 4: Hoare triple {915#true} ~x := #in~x; {915#true} is VALID [2022-02-21 03:02:40,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {915#true} assume !(0 == ~x); {915#true} is VALID [2022-02-21 03:02:40,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {915#true} assume ~x - 1 <= 2147483647; {915#true} is VALID [2022-02-21 03:02:40,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#true} assume ~x - 1 >= -2147483648; {915#true} is VALID [2022-02-21 03:02:40,596 INFO L272 TraceCheckUtils]: 8: Hoare triple {915#true} call #t~ret0 := g(~x - 1); {915#true} is VALID [2022-02-21 03:02:40,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {915#true} ~x := #in~x; {915#true} is VALID [2022-02-21 03:02:40,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {915#true} assume 0 == ~x;#res := 1; {922#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:40,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {922#(<= |g_#res| 1)} assume true; {922#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:40,597 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {922#(<= |g_#res| 1)} {915#true} #32#return; {921#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:40,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {921#(<= |g_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {921#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:40,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {921#(<= |g_#t~ret0| 1)} assume !(1 + #t~ret0 <= 2147483647); {916#false} is VALID [2022-02-21 03:02:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:40,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:40,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276903431] [2022-02-21 03:02:40,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276903431] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:40,599 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:40,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:02:40,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224404138] [2022-02-21 03:02:40,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:40,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-21 03:02:40,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:40,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:40,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:40,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:02:40,623 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:40,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:02:40,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:02:40,624 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,719 INFO L93 Difference]: Finished difference Result 117 states and 166 transitions. [2022-02-21 03:02:40,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:02:40,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-21 03:02:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:40,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-21 03:02:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-21 03:02:40,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-02-21 03:02:40,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:40,743 INFO L225 Difference]: With dead ends: 117 [2022-02-21 03:02:40,743 INFO L226 Difference]: Without dead ends: 116 [2022-02-21 03:02:40,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:02:40,744 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:40,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:40,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-02-21 03:02:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2022-02-21 03:02:40,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:40,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 99 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 75 states have internal predecessors, (92), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2022-02-21 03:02:40,777 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 99 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 75 states have internal predecessors, (92), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2022-02-21 03:02:40,778 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 99 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 75 states have internal predecessors, (92), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2022-02-21 03:02:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,782 INFO L93 Difference]: Finished difference Result 116 states and 160 transitions. [2022-02-21 03:02:40,782 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 160 transitions. [2022-02-21 03:02:40,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:40,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:40,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 75 states have internal predecessors, (92), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) Second operand 116 states. [2022-02-21 03:02:40,784 INFO L87 Difference]: Start difference. First operand has 99 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 75 states have internal predecessors, (92), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) Second operand 116 states. [2022-02-21 03:02:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,788 INFO L93 Difference]: Finished difference Result 116 states and 160 transitions. [2022-02-21 03:02:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 160 transitions. [2022-02-21 03:02:40,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:40,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:40,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:40,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 75 states have internal predecessors, (92), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2022-02-21 03:02:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2022-02-21 03:02:40,792 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 15 [2022-02-21 03:02:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:40,793 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2022-02-21 03:02:40,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2022-02-21 03:02:40,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-21 03:02:40,793 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:40,794 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:40,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:02:40,794 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:40,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:40,795 INFO L85 PathProgramCache]: Analyzing trace with hash 645037581, now seen corresponding path program 1 times [2022-02-21 03:02:40,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:40,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137756145] [2022-02-21 03:02:40,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:40,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:02:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:40,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {1417#true} ~x := #in~x; {1417#true} is VALID [2022-02-21 03:02:40,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {1417#true} assume 0 == ~x;#res := 1; {1417#true} is VALID [2022-02-21 03:02:40,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {1417#true} assume true; {1417#true} is VALID [2022-02-21 03:02:40,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1417#true} {1417#true} #32#return; {1417#true} is VALID [2022-02-21 03:02:40,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {1417#true} assume { :begin_inline_ULTIMATE.init } true; {1417#true} is VALID [2022-02-21 03:02:40,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {1417#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1417#true} is VALID [2022-02-21 03:02:40,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {1417#true} assume !(main_~x~0#1 < 0); {1417#true} is VALID [2022-02-21 03:02:40,842 INFO L272 TraceCheckUtils]: 3: Hoare triple {1417#true} call main_#t~ret3#1 := g(main_~x~0#1); {1417#true} is VALID [2022-02-21 03:02:40,842 INFO L290 TraceCheckUtils]: 4: Hoare triple {1417#true} ~x := #in~x; {1417#true} is VALID [2022-02-21 03:02:40,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {1417#true} assume !(0 == ~x); {1417#true} is VALID [2022-02-21 03:02:40,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {1417#true} assume ~x - 1 <= 2147483647; {1417#true} is VALID [2022-02-21 03:02:40,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {1417#true} assume ~x - 1 >= -2147483648; {1417#true} is VALID [2022-02-21 03:02:40,843 INFO L272 TraceCheckUtils]: 8: Hoare triple {1417#true} call #t~ret0 := g(~x - 1); {1417#true} is VALID [2022-02-21 03:02:40,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {1417#true} ~x := #in~x; {1417#true} is VALID [2022-02-21 03:02:40,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {1417#true} assume 0 == ~x;#res := 1; {1417#true} is VALID [2022-02-21 03:02:40,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {1417#true} assume true; {1417#true} is VALID [2022-02-21 03:02:40,844 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1417#true} {1417#true} #32#return; {1417#true} is VALID [2022-02-21 03:02:40,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {1417#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1423#(<= 0 (+ |g_#t~ret0| 2147483648))} is VALID [2022-02-21 03:02:40,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {1423#(<= 0 (+ |g_#t~ret0| 2147483648))} assume 1 + #t~ret0 <= 2147483647; {1423#(<= 0 (+ |g_#t~ret0| 2147483648))} is VALID [2022-02-21 03:02:40,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {1423#(<= 0 (+ |g_#t~ret0| 2147483648))} assume !(1 + #t~ret0 >= -2147483648); {1418#false} is VALID [2022-02-21 03:02:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:40,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:40,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137756145] [2022-02-21 03:02:40,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137756145] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:40,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:40,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:02:40,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105550229] [2022-02-21 03:02:40,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:40,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-21 03:02:40,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:40,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:40,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:40,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:02:40,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:40,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:02:40,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:02:40,856 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,925 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2022-02-21 03:02:40,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:02:40,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-21 03:02:40,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-02-21 03:02:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-02-21 03:02:40,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2022-02-21 03:02:40,942 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:02:40,945 INFO L225 Difference]: With dead ends: 99 [2022-02-21 03:02:40,945 INFO L226 Difference]: Without dead ends: 98 [2022-02-21 03:02:40,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:02:40,947 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:40,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:40,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-21 03:02:40,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-02-21 03:02:40,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:40,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 74 states have internal predecessors, (86), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2022-02-21 03:02:40,989 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 74 states have internal predecessors, (86), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2022-02-21 03:02:40,990 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 74 states have internal predecessors, (86), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2022-02-21 03:02:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,994 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2022-02-21 03:02:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2022-02-21 03:02:40,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:40,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:40,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 74 states have internal predecessors, (86), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) Second operand 98 states. [2022-02-21 03:02:40,995 INFO L87 Difference]: Start difference. First operand has 98 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 74 states have internal predecessors, (86), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) Second operand 98 states. [2022-02-21 03:02:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:40,998 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2022-02-21 03:02:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2022-02-21 03:02:40,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:40,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:40,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:40,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 74 states have internal predecessors, (86), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2022-02-21 03:02:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2022-02-21 03:02:41,002 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 16 [2022-02-21 03:02:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:41,002 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2022-02-21 03:02:41,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2022-02-21 03:02:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 03:02:41,003 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:41,003 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:41,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:02:41,004 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:41,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:41,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1915238450, now seen corresponding path program 1 times [2022-02-21 03:02:41,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:41,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686341952] [2022-02-21 03:02:41,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:41,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:41,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:02:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:41,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {1857#true} ~x := #in~x; {1857#true} is VALID [2022-02-21 03:02:41,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {1857#true} assume 0 == ~x;#res := 1; {1866#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:41,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {1866#(<= |g_#res| 1)} assume true; {1866#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:41,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1866#(<= |g_#res| 1)} {1857#true} #32#return; {1863#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:41,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {1857#true} assume { :begin_inline_ULTIMATE.init } true; {1857#true} is VALID [2022-02-21 03:02:41,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {1857#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1857#true} is VALID [2022-02-21 03:02:41,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {1857#true} assume !(main_~x~0#1 < 0); {1857#true} is VALID [2022-02-21 03:02:41,047 INFO L272 TraceCheckUtils]: 3: Hoare triple {1857#true} call main_#t~ret3#1 := g(main_~x~0#1); {1857#true} is VALID [2022-02-21 03:02:41,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {1857#true} ~x := #in~x; {1857#true} is VALID [2022-02-21 03:02:41,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {1857#true} assume !(0 == ~x); {1857#true} is VALID [2022-02-21 03:02:41,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {1857#true} assume ~x - 1 <= 2147483647; {1857#true} is VALID [2022-02-21 03:02:41,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {1857#true} assume ~x - 1 >= -2147483648; {1857#true} is VALID [2022-02-21 03:02:41,048 INFO L272 TraceCheckUtils]: 8: Hoare triple {1857#true} call #t~ret0 := g(~x - 1); {1857#true} is VALID [2022-02-21 03:02:41,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {1857#true} ~x := #in~x; {1857#true} is VALID [2022-02-21 03:02:41,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {1857#true} assume 0 == ~x;#res := 1; {1866#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:41,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {1866#(<= |g_#res| 1)} assume true; {1866#(<= |g_#res| 1)} is VALID [2022-02-21 03:02:41,050 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1866#(<= |g_#res| 1)} {1857#true} #32#return; {1863#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:41,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {1863#(<= |g_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1863#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:41,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {1863#(<= |g_#t~ret0| 1)} assume 1 + #t~ret0 <= 2147483647; {1863#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:41,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {1863#(<= |g_#t~ret0| 1)} assume 1 + #t~ret0 >= -2147483648; {1863#(<= |g_#t~ret0| 1)} is VALID [2022-02-21 03:02:41,051 INFO L272 TraceCheckUtils]: 16: Hoare triple {1863#(<= |g_#t~ret0| 1)} call #t~ret1 := g(1 + #t~ret0); {1864#(<= |g_#in~x| 2)} is VALID [2022-02-21 03:02:41,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {1864#(<= |g_#in~x| 2)} ~x := #in~x; {1865#(<= g_~x 2)} is VALID [2022-02-21 03:02:41,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {1865#(<= g_~x 2)} assume !(0 == ~x); {1865#(<= g_~x 2)} is VALID [2022-02-21 03:02:41,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {1865#(<= g_~x 2)} assume !(~x - 1 <= 2147483647); {1858#false} is VALID [2022-02-21 03:02:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:41,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:41,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686341952] [2022-02-21 03:02:41,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686341952] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:41,053 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:41,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:02:41,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837691535] [2022-02-21 03:02:41,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:41,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-21 03:02:41,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:41,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:41,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:41,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:02:41,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:41,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:02:41,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:41,066 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:41,371 INFO L93 Difference]: Finished difference Result 137 states and 175 transitions. [2022-02-21 03:02:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:02:41,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-21 03:02:41,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-02-21 03:02:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-02-21 03:02:41,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-02-21 03:02:41,415 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:02:41,418 INFO L225 Difference]: With dead ends: 137 [2022-02-21 03:02:41,418 INFO L226 Difference]: Without dead ends: 136 [2022-02-21 03:02:41,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:02:41,419 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:41,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 83 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:02:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-02-21 03:02:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2022-02-21 03:02:41,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:41,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 128 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 100 states have internal predecessors, (108), 22 states have call successors, (22), 7 states have call predecessors, (22), 12 states have return successors, (38), 20 states have call predecessors, (38), 19 states have call successors, (38) [2022-02-21 03:02:41,476 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 128 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 100 states have internal predecessors, (108), 22 states have call successors, (22), 7 states have call predecessors, (22), 12 states have return successors, (38), 20 states have call predecessors, (38), 19 states have call successors, (38) [2022-02-21 03:02:41,477 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 128 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 100 states have internal predecessors, (108), 22 states have call successors, (22), 7 states have call predecessors, (22), 12 states have return successors, (38), 20 states have call predecessors, (38), 19 states have call successors, (38) [2022-02-21 03:02:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:41,481 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2022-02-21 03:02:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2022-02-21 03:02:41,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:41,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:41,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 100 states have internal predecessors, (108), 22 states have call successors, (22), 7 states have call predecessors, (22), 12 states have return successors, (38), 20 states have call predecessors, (38), 19 states have call successors, (38) Second operand 136 states. [2022-02-21 03:02:41,483 INFO L87 Difference]: Start difference. First operand has 128 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 100 states have internal predecessors, (108), 22 states have call successors, (22), 7 states have call predecessors, (22), 12 states have return successors, (38), 20 states have call predecessors, (38), 19 states have call successors, (38) Second operand 136 states. [2022-02-21 03:02:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:41,494 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2022-02-21 03:02:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2022-02-21 03:02:41,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:41,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:41,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:41,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 100 states have internal predecessors, (108), 22 states have call successors, (22), 7 states have call predecessors, (22), 12 states have return successors, (38), 20 states have call predecessors, (38), 19 states have call successors, (38) [2022-02-21 03:02:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 168 transitions. [2022-02-21 03:02:41,499 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 168 transitions. Word has length 20 [2022-02-21 03:02:41,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:41,500 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 168 transitions. [2022-02-21 03:02:41,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:41,500 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2022-02-21 03:02:41,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 03:02:41,501 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:41,501 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:41,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:02:41,501 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:41,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:41,502 INFO L85 PathProgramCache]: Analyzing trace with hash 757150232, now seen corresponding path program 1 times [2022-02-21 03:02:41,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:41,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253938396] [2022-02-21 03:02:41,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:41,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:41,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:02:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:41,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {2473#true} ~x := #in~x; {2473#true} is VALID [2022-02-21 03:02:41,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {2473#true} assume 0 == ~x;#res := 1; {2482#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:41,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {2482#(<= 1 |g_#res|)} assume true; {2482#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:41,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2482#(<= 1 |g_#res|)} {2473#true} #32#return; {2479#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:41,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {2473#true} assume { :begin_inline_ULTIMATE.init } true; {2473#true} is VALID [2022-02-21 03:02:41,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {2473#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2473#true} is VALID [2022-02-21 03:02:41,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {2473#true} assume !(main_~x~0#1 < 0); {2473#true} is VALID [2022-02-21 03:02:41,546 INFO L272 TraceCheckUtils]: 3: Hoare triple {2473#true} call main_#t~ret3#1 := g(main_~x~0#1); {2473#true} is VALID [2022-02-21 03:02:41,546 INFO L290 TraceCheckUtils]: 4: Hoare triple {2473#true} ~x := #in~x; {2473#true} is VALID [2022-02-21 03:02:41,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {2473#true} assume !(0 == ~x); {2473#true} is VALID [2022-02-21 03:02:41,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {2473#true} assume ~x - 1 <= 2147483647; {2473#true} is VALID [2022-02-21 03:02:41,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {2473#true} assume ~x - 1 >= -2147483648; {2473#true} is VALID [2022-02-21 03:02:41,547 INFO L272 TraceCheckUtils]: 8: Hoare triple {2473#true} call #t~ret0 := g(~x - 1); {2473#true} is VALID [2022-02-21 03:02:41,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {2473#true} ~x := #in~x; {2473#true} is VALID [2022-02-21 03:02:41,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {2473#true} assume 0 == ~x;#res := 1; {2482#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:41,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {2482#(<= 1 |g_#res|)} assume true; {2482#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:41,548 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2482#(<= 1 |g_#res|)} {2473#true} #32#return; {2479#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:41,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {2479#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2479#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:41,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {2479#(<= 1 |g_#t~ret0|)} assume 1 + #t~ret0 <= 2147483647; {2479#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:41,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {2479#(<= 1 |g_#t~ret0|)} assume 1 + #t~ret0 >= -2147483648; {2479#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:41,550 INFO L272 TraceCheckUtils]: 16: Hoare triple {2479#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(1 + #t~ret0); {2480#(<= 2 |g_#in~x|)} is VALID [2022-02-21 03:02:41,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {2480#(<= 2 |g_#in~x|)} ~x := #in~x; {2481#(<= 2 g_~x)} is VALID [2022-02-21 03:02:41,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {2481#(<= 2 g_~x)} assume !(0 == ~x); {2481#(<= 2 g_~x)} is VALID [2022-02-21 03:02:41,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {2481#(<= 2 g_~x)} assume ~x - 1 <= 2147483647; {2481#(<= 2 g_~x)} is VALID [2022-02-21 03:02:41,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {2481#(<= 2 g_~x)} assume !(~x - 1 >= -2147483648); {2474#false} is VALID [2022-02-21 03:02:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:41,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:41,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253938396] [2022-02-21 03:02:41,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253938396] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:02:41,552 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:02:41,552 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:02:41,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199843774] [2022-02-21 03:02:41,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:02:41,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-21 03:02:41,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:41,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:41,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:41,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:02:41,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:41,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:02:41,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:02:41,566 INFO L87 Difference]: Start difference. First operand 128 states and 168 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:41,709 INFO L93 Difference]: Finished difference Result 149 states and 199 transitions. [2022-02-21 03:02:41,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:02:41,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-21 03:02:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:41,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-02-21 03:02:41,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-02-21 03:02:41,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-02-21 03:02:41,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:41,742 INFO L225 Difference]: With dead ends: 149 [2022-02-21 03:02:41,742 INFO L226 Difference]: Without dead ends: 78 [2022-02-21 03:02:41,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:02:41,744 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:41,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 61 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:02:41,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-21 03:02:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 43. [2022-02-21 03:02:41,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:41,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 43 states, 32 states have (on average 1.15625) internal successors, (37), 35 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:02:41,771 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 43 states, 32 states have (on average 1.15625) internal successors, (37), 35 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:02:41,771 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 43 states, 32 states have (on average 1.15625) internal successors, (37), 35 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:02:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:41,773 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-02-21 03:02:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2022-02-21 03:02:41,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:41,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:41,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 32 states have (on average 1.15625) internal successors, (37), 35 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 4 states have call successors, (4) Second operand 78 states. [2022-02-21 03:02:41,774 INFO L87 Difference]: Start difference. First operand has 43 states, 32 states have (on average 1.15625) internal successors, (37), 35 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 4 states have call successors, (4) Second operand 78 states. [2022-02-21 03:02:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:41,775 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-02-21 03:02:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2022-02-21 03:02:41,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:41,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:41,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:41,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.15625) internal successors, (37), 35 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:02:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-02-21 03:02:41,778 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 21 [2022-02-21 03:02:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:41,778 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-02-21 03:02:41,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:02:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-02-21 03:02:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 03:02:41,779 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:41,779 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:41,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 03:02:41,779 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:41,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:41,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1579949547, now seen corresponding path program 2 times [2022-02-21 03:02:41,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:41,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873029486] [2022-02-21 03:02:41,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:41,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:41,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:02:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:41,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {2884#true} ~x := #in~x; {2884#true} is VALID [2022-02-21 03:02:41,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {2884#true} assume 0 == ~x;#res := 1; {2895#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:41,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {2895#(<= 1 |g_#res|)} assume true; {2895#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:41,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2895#(<= 1 |g_#res|)} {2884#true} #32#return; {2890#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:41,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {2884#true} assume { :begin_inline_ULTIMATE.init } true; {2884#true} is VALID [2022-02-21 03:02:41,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {2884#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2884#true} is VALID [2022-02-21 03:02:41,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {2884#true} assume !(main_~x~0#1 < 0); {2884#true} is VALID [2022-02-21 03:02:41,836 INFO L272 TraceCheckUtils]: 3: Hoare triple {2884#true} call main_#t~ret3#1 := g(main_~x~0#1); {2884#true} is VALID [2022-02-21 03:02:41,836 INFO L290 TraceCheckUtils]: 4: Hoare triple {2884#true} ~x := #in~x; {2884#true} is VALID [2022-02-21 03:02:41,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {2884#true} assume !(0 == ~x); {2884#true} is VALID [2022-02-21 03:02:41,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {2884#true} assume ~x - 1 <= 2147483647; {2884#true} is VALID [2022-02-21 03:02:41,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {2884#true} assume ~x - 1 >= -2147483648; {2884#true} is VALID [2022-02-21 03:02:41,837 INFO L272 TraceCheckUtils]: 8: Hoare triple {2884#true} call #t~ret0 := g(~x - 1); {2884#true} is VALID [2022-02-21 03:02:41,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {2884#true} ~x := #in~x; {2884#true} is VALID [2022-02-21 03:02:41,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {2884#true} assume 0 == ~x;#res := 1; {2895#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:41,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {2895#(<= 1 |g_#res|)} assume true; {2895#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:41,838 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2895#(<= 1 |g_#res|)} {2884#true} #32#return; {2890#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:41,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {2890#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2890#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:41,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {2890#(<= 1 |g_#t~ret0|)} assume 1 + #t~ret0 <= 2147483647; {2890#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:41,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {2890#(<= 1 |g_#t~ret0|)} assume 1 + #t~ret0 >= -2147483648; {2890#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:41,840 INFO L272 TraceCheckUtils]: 16: Hoare triple {2890#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(1 + #t~ret0); {2891#(<= 2 |g_#in~x|)} is VALID [2022-02-21 03:02:41,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {2891#(<= 2 |g_#in~x|)} ~x := #in~x; {2892#(<= 2 g_~x)} is VALID [2022-02-21 03:02:41,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {2892#(<= 2 g_~x)} assume !(0 == ~x); {2892#(<= 2 g_~x)} is VALID [2022-02-21 03:02:41,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {2892#(<= 2 g_~x)} assume ~x - 1 <= 2147483647; {2892#(<= 2 g_~x)} is VALID [2022-02-21 03:02:41,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {2892#(<= 2 g_~x)} assume ~x - 1 >= -2147483648; {2892#(<= 2 g_~x)} is VALID [2022-02-21 03:02:41,842 INFO L272 TraceCheckUtils]: 21: Hoare triple {2892#(<= 2 g_~x)} call #t~ret0 := g(~x - 1); {2893#(<= 1 |g_#in~x|)} is VALID [2022-02-21 03:02:41,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {2893#(<= 1 |g_#in~x|)} ~x := #in~x; {2894#(<= 1 g_~x)} is VALID [2022-02-21 03:02:41,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {2894#(<= 1 g_~x)} assume !(0 == ~x); {2894#(<= 1 g_~x)} is VALID [2022-02-21 03:02:41,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {2894#(<= 1 g_~x)} assume ~x - 1 <= 2147483647; {2894#(<= 1 g_~x)} is VALID [2022-02-21 03:02:41,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {2894#(<= 1 g_~x)} assume !(~x - 1 >= -2147483648); {2885#false} is VALID [2022-02-21 03:02:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:41,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:41,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873029486] [2022-02-21 03:02:41,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873029486] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:41,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110822233] [2022-02-21 03:02:41,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:02:41,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:41,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:41,846 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:02:41,852 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:02:41,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:02:41,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:02:41,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:02:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:41,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:42,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {2884#true} assume { :begin_inline_ULTIMATE.init } true; {2884#true} is VALID [2022-02-21 03:02:42,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {2884#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2884#true} is VALID [2022-02-21 03:02:42,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {2884#true} assume !(main_~x~0#1 < 0); {2884#true} is VALID [2022-02-21 03:02:42,017 INFO L272 TraceCheckUtils]: 3: Hoare triple {2884#true} call main_#t~ret3#1 := g(main_~x~0#1); {2884#true} is VALID [2022-02-21 03:02:42,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {2884#true} ~x := #in~x; {2884#true} is VALID [2022-02-21 03:02:42,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {2884#true} assume !(0 == ~x); {2884#true} is VALID [2022-02-21 03:02:42,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {2884#true} assume ~x - 1 <= 2147483647; {2884#true} is VALID [2022-02-21 03:02:42,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {2884#true} assume ~x - 1 >= -2147483648; {2884#true} is VALID [2022-02-21 03:02:42,017 INFO L272 TraceCheckUtils]: 8: Hoare triple {2884#true} call #t~ret0 := g(~x - 1); {2884#true} is VALID [2022-02-21 03:02:42,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {2884#true} ~x := #in~x; {2884#true} is VALID [2022-02-21 03:02:42,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {2884#true} assume 0 == ~x;#res := 1; {2895#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:42,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {2895#(<= 1 |g_#res|)} assume true; {2895#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:42,019 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2895#(<= 1 |g_#res|)} {2884#true} #32#return; {2890#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:42,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {2890#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2890#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:42,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {2890#(<= 1 |g_#t~ret0|)} assume 1 + #t~ret0 <= 2147483647; {2890#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:42,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {2890#(<= 1 |g_#t~ret0|)} assume 1 + #t~ret0 >= -2147483648; {2890#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:42,023 INFO L272 TraceCheckUtils]: 16: Hoare triple {2890#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(1 + #t~ret0); {2891#(<= 2 |g_#in~x|)} is VALID [2022-02-21 03:02:42,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {2891#(<= 2 |g_#in~x|)} ~x := #in~x; {2892#(<= 2 g_~x)} is VALID [2022-02-21 03:02:42,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {2892#(<= 2 g_~x)} assume !(0 == ~x); {2892#(<= 2 g_~x)} is VALID [2022-02-21 03:02:42,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {2892#(<= 2 g_~x)} assume ~x - 1 <= 2147483647; {2892#(<= 2 g_~x)} is VALID [2022-02-21 03:02:42,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {2892#(<= 2 g_~x)} assume ~x - 1 >= -2147483648; {2892#(<= 2 g_~x)} is VALID [2022-02-21 03:02:42,034 INFO L272 TraceCheckUtils]: 21: Hoare triple {2892#(<= 2 g_~x)} call #t~ret0 := g(~x - 1); {2893#(<= 1 |g_#in~x|)} is VALID [2022-02-21 03:02:42,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {2893#(<= 1 |g_#in~x|)} ~x := #in~x; {2894#(<= 1 g_~x)} is VALID [2022-02-21 03:02:42,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {2894#(<= 1 g_~x)} assume !(0 == ~x); {2894#(<= 1 g_~x)} is VALID [2022-02-21 03:02:42,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {2894#(<= 1 g_~x)} assume ~x - 1 <= 2147483647; {2894#(<= 1 g_~x)} is VALID [2022-02-21 03:02:42,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {2894#(<= 1 g_~x)} assume !(~x - 1 >= -2147483648); {2885#false} is VALID [2022-02-21 03:02:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:42,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:42,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {2974#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {2885#false} is VALID [2022-02-21 03:02:42,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {2974#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {2974#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:42,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {2974#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {2974#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:42,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {2984#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {2974#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:42,268 INFO L272 TraceCheckUtils]: 21: Hoare triple {2988#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {2984#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:02:42,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {2988#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {2988#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:42,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {2988#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {2988#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:42,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {2988#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {2988#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:42,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {3001#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {2988#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:42,271 INFO L272 TraceCheckUtils]: 16: Hoare triple {3005#(<= 0 (+ 2147483647 |g_#t~ret0|))} call #t~ret1 := g(1 + #t~ret0); {3001#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:02:42,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {3005#(<= 0 (+ 2147483647 |g_#t~ret0|))} assume 1 + #t~ret0 >= -2147483648; {3005#(<= 0 (+ 2147483647 |g_#t~ret0|))} is VALID [2022-02-21 03:02:42,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {3005#(<= 0 (+ 2147483647 |g_#t~ret0|))} assume 1 + #t~ret0 <= 2147483647; {3005#(<= 0 (+ 2147483647 |g_#t~ret0|))} is VALID [2022-02-21 03:02:42,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {3005#(<= 0 (+ 2147483647 |g_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3005#(<= 0 (+ 2147483647 |g_#t~ret0|))} is VALID [2022-02-21 03:02:42,273 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3021#(<= 0 (+ 2147483647 |g_#res|))} {2884#true} #32#return; {3005#(<= 0 (+ 2147483647 |g_#t~ret0|))} is VALID [2022-02-21 03:02:42,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {3021#(<= 0 (+ 2147483647 |g_#res|))} assume true; {3021#(<= 0 (+ 2147483647 |g_#res|))} is VALID [2022-02-21 03:02:42,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {2884#true} assume 0 == ~x;#res := 1; {3021#(<= 0 (+ 2147483647 |g_#res|))} is VALID [2022-02-21 03:02:42,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {2884#true} ~x := #in~x; {2884#true} is VALID [2022-02-21 03:02:42,274 INFO L272 TraceCheckUtils]: 8: Hoare triple {2884#true} call #t~ret0 := g(~x - 1); {2884#true} is VALID [2022-02-21 03:02:42,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {2884#true} assume ~x - 1 >= -2147483648; {2884#true} is VALID [2022-02-21 03:02:42,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {2884#true} assume ~x - 1 <= 2147483647; {2884#true} is VALID [2022-02-21 03:02:42,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {2884#true} assume !(0 == ~x); {2884#true} is VALID [2022-02-21 03:02:42,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {2884#true} ~x := #in~x; {2884#true} is VALID [2022-02-21 03:02:42,274 INFO L272 TraceCheckUtils]: 3: Hoare triple {2884#true} call main_#t~ret3#1 := g(main_~x~0#1); {2884#true} is VALID [2022-02-21 03:02:42,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {2884#true} assume !(main_~x~0#1 < 0); {2884#true} is VALID [2022-02-21 03:02:42,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {2884#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2884#true} is VALID [2022-02-21 03:02:42,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {2884#true} assume { :begin_inline_ULTIMATE.init } true; {2884#true} is VALID [2022-02-21 03:02:42,274 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:42,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110822233] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:42,275 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:42,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-21 03:02:42,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483704002] [2022-02-21 03:02:42,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:42,275 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-02-21 03:02:42,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:42,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:42,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:42,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:02:42,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:42,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:02:42,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:02:42,301 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:42,847 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2022-02-21 03:02:42,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-21 03:02:42,847 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-02-21 03:02:42,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-02-21 03:02:42,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-02-21 03:02:42,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 74 transitions. [2022-02-21 03:02:42,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:42,913 INFO L225 Difference]: With dead ends: 93 [2022-02-21 03:02:42,913 INFO L226 Difference]: Without dead ends: 77 [2022-02-21 03:02:42,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:02:42,914 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 53 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:42,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 111 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:02:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-21 03:02:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 48. [2022-02-21 03:02:42,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:42,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 48 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 39 states have internal predecessors, (41), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 1 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:02:42,957 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 48 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 39 states have internal predecessors, (41), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 1 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:02:42,957 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 48 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 39 states have internal predecessors, (41), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 1 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:02:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:42,959 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-02-21 03:02:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-02-21 03:02:42,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:42,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:42,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 39 states have internal predecessors, (41), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 1 states have call predecessors, (4), 4 states have call successors, (4) Second operand 77 states. [2022-02-21 03:02:42,960 INFO L87 Difference]: Start difference. First operand has 48 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 39 states have internal predecessors, (41), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 1 states have call predecessors, (4), 4 states have call successors, (4) Second operand 77 states. [2022-02-21 03:02:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:42,961 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-02-21 03:02:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-02-21 03:02:42,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:42,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:42,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:42,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 39 states have internal predecessors, (41), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 1 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:02:42,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-02-21 03:02:42,962 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 26 [2022-02-21 03:02:42,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:42,963 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-02-21 03:02:42,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:42,963 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-02-21 03:02:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-21 03:02:42,963 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:42,963 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2022-02-21 03:02:42,982 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:02:43,176 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,SelfDestructingSolverStorable7 [2022-02-21 03:02:43,176 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:43,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:43,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1990306702, now seen corresponding path program 2 times [2022-02-21 03:02:43,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:43,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897716131] [2022-02-21 03:02:43,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:43,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:43,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {3411#true} assume { :begin_inline_ULTIMATE.init } true; {3411#true} is VALID [2022-02-21 03:02:43,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {3411#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {3411#true} is VALID [2022-02-21 03:02:43,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {3411#true} assume !(main_~x~0#1 < 0); {3413#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:43,295 INFO L272 TraceCheckUtils]: 3: Hoare triple {3413#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {3414#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:43,295 INFO L290 TraceCheckUtils]: 4: Hoare triple {3414#(<= 0 |g_#in~x|)} ~x := #in~x; {3415#(<= 0 g_~x)} is VALID [2022-02-21 03:02:43,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {3415#(<= 0 g_~x)} assume !(0 == ~x); {3415#(<= 0 g_~x)} is VALID [2022-02-21 03:02:43,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {3415#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {3415#(<= 0 g_~x)} is VALID [2022-02-21 03:02:43,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {3415#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {3415#(<= 0 g_~x)} is VALID [2022-02-21 03:02:43,297 INFO L272 TraceCheckUtils]: 8: Hoare triple {3415#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {3416#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:43,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {3416#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {3417#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:43,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {3417#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {3417#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:43,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {3417#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {3417#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:43,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {3417#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {3417#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:43,299 INFO L272 TraceCheckUtils]: 13: Hoare triple {3417#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {3418#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:02:43,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {3418#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {3419#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:43,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {3419#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {3419#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:43,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {3419#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {3419#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:43,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {3419#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {3419#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:43,301 INFO L272 TraceCheckUtils]: 18: Hoare triple {3419#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {3420#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:02:43,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {3420#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {3421#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:43,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {3421#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {3421#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:43,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {3421#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {3421#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:43,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {3421#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {3421#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:43,308 INFO L272 TraceCheckUtils]: 23: Hoare triple {3421#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {3422#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:02:43,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {3422#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {3423#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:43,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {3423#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {3423#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:43,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {3423#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {3423#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:43,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {3423#(<= 0 (+ g_~x 4))} assume !(~x - 1 >= -2147483648); {3412#false} is VALID [2022-02-21 03:02:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:43,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:43,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897716131] [2022-02-21 03:02:43,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897716131] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:43,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730241432] [2022-02-21 03:02:43,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:02:43,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:43,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:43,312 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:02:43,313 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:02:43,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:02:43,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:02:43,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:02:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:43,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:43,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {3411#true} assume { :begin_inline_ULTIMATE.init } true; {3411#true} is VALID [2022-02-21 03:02:43,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {3411#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {3411#true} is VALID [2022-02-21 03:02:43,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {3411#true} assume !(main_~x~0#1 < 0); {3413#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:43,549 INFO L272 TraceCheckUtils]: 3: Hoare triple {3413#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {3414#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:43,549 INFO L290 TraceCheckUtils]: 4: Hoare triple {3414#(<= 0 |g_#in~x|)} ~x := #in~x; {3415#(<= 0 g_~x)} is VALID [2022-02-21 03:02:43,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {3415#(<= 0 g_~x)} assume !(0 == ~x); {3415#(<= 0 g_~x)} is VALID [2022-02-21 03:02:43,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {3415#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {3415#(<= 0 g_~x)} is VALID [2022-02-21 03:02:43,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {3415#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {3415#(<= 0 g_~x)} is VALID [2022-02-21 03:02:43,551 INFO L272 TraceCheckUtils]: 8: Hoare triple {3415#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {3416#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:43,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {3416#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {3417#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:43,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {3417#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {3417#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:43,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {3417#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {3417#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:43,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {3417#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {3417#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:43,552 INFO L272 TraceCheckUtils]: 13: Hoare triple {3417#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {3418#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:02:43,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {3418#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {3419#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:43,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {3419#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {3419#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:43,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {3419#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {3419#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:43,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {3419#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {3419#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:43,554 INFO L272 TraceCheckUtils]: 18: Hoare triple {3419#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {3420#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:02:43,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {3420#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {3421#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:43,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {3421#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {3421#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:43,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {3421#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {3421#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:43,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {3421#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {3421#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:43,556 INFO L272 TraceCheckUtils]: 23: Hoare triple {3421#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {3422#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:02:43,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {3422#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {3423#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:43,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {3423#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {3423#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:43,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {3423#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {3423#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:43,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {3423#(<= 0 (+ g_~x 4))} assume !(~x - 1 >= -2147483648); {3412#false} is VALID [2022-02-21 03:02:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:43,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:43,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {3508#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {3412#false} is VALID [2022-02-21 03:02:43,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {3508#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {3508#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:43,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {3508#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {3508#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:43,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {3518#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {3508#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:43,868 INFO L272 TraceCheckUtils]: 23: Hoare triple {3522#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {3518#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:02:43,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {3522#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {3522#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:43,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {3522#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {3522#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:43,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {3522#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {3522#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:43,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {3535#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {3522#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:43,870 INFO L272 TraceCheckUtils]: 18: Hoare triple {3539#(<= 0 (+ 2147483645 g_~x))} call #t~ret0 := g(~x - 1); {3535#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:02:43,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {3539#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 >= -2147483648; {3539#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:43,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {3539#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 <= 2147483647; {3539#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:43,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {3539#(<= 0 (+ 2147483645 g_~x))} assume !(0 == ~x); {3539#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:43,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {3552#(<= 0 (+ 2147483645 |g_#in~x|))} ~x := #in~x; {3539#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:43,872 INFO L272 TraceCheckUtils]: 13: Hoare triple {3556#(<= 0 (+ g_~x 2147483644))} call #t~ret0 := g(~x - 1); {3552#(<= 0 (+ 2147483645 |g_#in~x|))} is VALID [2022-02-21 03:02:43,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {3556#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 >= -2147483648; {3556#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:43,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {3556#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 <= 2147483647; {3556#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:43,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {3556#(<= 0 (+ g_~x 2147483644))} assume !(0 == ~x); {3556#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:43,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {3569#(<= 0 (+ |g_#in~x| 2147483644))} ~x := #in~x; {3556#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:43,873 INFO L272 TraceCheckUtils]: 8: Hoare triple {3573#(<= 0 (+ 2147483643 g_~x))} call #t~ret0 := g(~x - 1); {3569#(<= 0 (+ |g_#in~x| 2147483644))} is VALID [2022-02-21 03:02:43,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {3573#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 >= -2147483648; {3573#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:43,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {3573#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 <= 2147483647; {3573#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:43,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {3573#(<= 0 (+ 2147483643 g_~x))} assume !(0 == ~x); {3573#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:43,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {3586#(<= 0 (+ 2147483643 |g_#in~x|))} ~x := #in~x; {3573#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:43,876 INFO L272 TraceCheckUtils]: 3: Hoare triple {3590#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~x~0#1|))} call main_#t~ret3#1 := g(main_~x~0#1); {3586#(<= 0 (+ 2147483643 |g_#in~x|))} is VALID [2022-02-21 03:02:43,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {3411#true} assume !(main_~x~0#1 < 0); {3590#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:02:43,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {3411#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {3411#true} is VALID [2022-02-21 03:02:43,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {3411#true} assume { :begin_inline_ULTIMATE.init } true; {3411#true} is VALID [2022-02-21 03:02:43,877 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:43,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730241432] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:43,878 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:43,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-02-21 03:02:43,878 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556654152] [2022-02-21 03:02:43,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:43,879 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 14 states have internal predecessors, (44), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-21 03:02:43,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:43,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 14 states have internal predecessors, (44), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:43,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:43,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-21 03:02:43,918 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:43,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-21 03:02:43,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2022-02-21 03:02:43,919 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 24 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 14 states have internal predecessors, (44), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:44,817 INFO L93 Difference]: Finished difference Result 148 states and 166 transitions. [2022-02-21 03:02:44,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-21 03:02:44,817 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 14 states have internal predecessors, (44), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-21 03:02:44,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 14 states have internal predecessors, (44), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 141 transitions. [2022-02-21 03:02:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 14 states have internal predecessors, (44), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 141 transitions. [2022-02-21 03:02:44,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 141 transitions. [2022-02-21 03:02:44,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:44,906 INFO L225 Difference]: With dead ends: 148 [2022-02-21 03:02:44,906 INFO L226 Difference]: Without dead ends: 147 [2022-02-21 03:02:44,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=554, Invalid=1252, Unknown=0, NotChecked=0, Total=1806 [2022-02-21 03:02:44,907 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 205 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:44,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 181 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:02:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-21 03:02:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 90. [2022-02-21 03:02:44,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:44,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 90 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 75 states have internal predecessors, (77), 13 states have call successors, (13), 13 states have call predecessors, (13), 10 states have return successors, (10), 1 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:02:44,990 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 90 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 75 states have internal predecessors, (77), 13 states have call successors, (13), 13 states have call predecessors, (13), 10 states have return successors, (10), 1 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:02:44,990 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 90 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 75 states have internal predecessors, (77), 13 states have call successors, (13), 13 states have call predecessors, (13), 10 states have return successors, (10), 1 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:02:44,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:44,993 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2022-02-21 03:02:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 160 transitions. [2022-02-21 03:02:44,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:44,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:44,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 75 states have internal predecessors, (77), 13 states have call successors, (13), 13 states have call predecessors, (13), 10 states have return successors, (10), 1 states have call predecessors, (10), 10 states have call successors, (10) Second operand 147 states. [2022-02-21 03:02:44,994 INFO L87 Difference]: Start difference. First operand has 90 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 75 states have internal predecessors, (77), 13 states have call successors, (13), 13 states have call predecessors, (13), 10 states have return successors, (10), 1 states have call predecessors, (10), 10 states have call successors, (10) Second operand 147 states. [2022-02-21 03:02:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:44,996 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2022-02-21 03:02:44,996 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 160 transitions. [2022-02-21 03:02:44,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:44,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:44,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:44,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 75 states have internal predecessors, (77), 13 states have call successors, (13), 13 states have call predecessors, (13), 10 states have return successors, (10), 1 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-21 03:02:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2022-02-21 03:02:44,998 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 28 [2022-02-21 03:02:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:44,998 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2022-02-21 03:02:44,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 14 states have internal predecessors, (44), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:44,999 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2022-02-21 03:02:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-21 03:02:44,999 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:45,000 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:02:45,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:02:45,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:45,216 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:45,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:45,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1862709720, now seen corresponding path program 3 times [2022-02-21 03:02:45,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:45,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943416664] [2022-02-21 03:02:45,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:45,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:45,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:02:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:45,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {4236#true} ~x := #in~x; {4236#true} is VALID [2022-02-21 03:02:45,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {4236#true} assume 0 == ~x;#res := 1; {4253#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:45,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {4253#(<= 1 |g_#res|)} assume true; {4253#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:45,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4253#(<= 1 |g_#res|)} {4236#true} #32#return; {4242#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:45,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {4236#true} assume { :begin_inline_ULTIMATE.init } true; {4236#true} is VALID [2022-02-21 03:02:45,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {4236#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {4236#true} is VALID [2022-02-21 03:02:45,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {4236#true} assume !(main_~x~0#1 < 0); {4236#true} is VALID [2022-02-21 03:02:45,343 INFO L272 TraceCheckUtils]: 3: Hoare triple {4236#true} call main_#t~ret3#1 := g(main_~x~0#1); {4236#true} is VALID [2022-02-21 03:02:45,343 INFO L290 TraceCheckUtils]: 4: Hoare triple {4236#true} ~x := #in~x; {4236#true} is VALID [2022-02-21 03:02:45,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {4236#true} assume !(0 == ~x); {4236#true} is VALID [2022-02-21 03:02:45,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {4236#true} assume ~x - 1 <= 2147483647; {4236#true} is VALID [2022-02-21 03:02:45,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {4236#true} assume ~x - 1 >= -2147483648; {4236#true} is VALID [2022-02-21 03:02:45,344 INFO L272 TraceCheckUtils]: 8: Hoare triple {4236#true} call #t~ret0 := g(~x - 1); {4236#true} is VALID [2022-02-21 03:02:45,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {4236#true} ~x := #in~x; {4236#true} is VALID [2022-02-21 03:02:45,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {4236#true} assume 0 == ~x;#res := 1; {4253#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:45,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {4253#(<= 1 |g_#res|)} assume true; {4253#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:45,345 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4253#(<= 1 |g_#res|)} {4236#true} #32#return; {4242#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:45,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {4242#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4242#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:45,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {4242#(<= 1 |g_#t~ret0|)} assume 1 + #t~ret0 <= 2147483647; {4242#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:45,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {4242#(<= 1 |g_#t~ret0|)} assume 1 + #t~ret0 >= -2147483648; {4242#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:45,347 INFO L272 TraceCheckUtils]: 16: Hoare triple {4242#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(1 + #t~ret0); {4243#(<= 2 |g_#in~x|)} is VALID [2022-02-21 03:02:45,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {4243#(<= 2 |g_#in~x|)} ~x := #in~x; {4244#(<= 2 g_~x)} is VALID [2022-02-21 03:02:45,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {4244#(<= 2 g_~x)} assume !(0 == ~x); {4244#(<= 2 g_~x)} is VALID [2022-02-21 03:02:45,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {4244#(<= 2 g_~x)} assume ~x - 1 <= 2147483647; {4244#(<= 2 g_~x)} is VALID [2022-02-21 03:02:45,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {4244#(<= 2 g_~x)} assume ~x - 1 >= -2147483648; {4244#(<= 2 g_~x)} is VALID [2022-02-21 03:02:45,348 INFO L272 TraceCheckUtils]: 21: Hoare triple {4244#(<= 2 g_~x)} call #t~ret0 := g(~x - 1); {4245#(<= 1 |g_#in~x|)} is VALID [2022-02-21 03:02:45,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {4245#(<= 1 |g_#in~x|)} ~x := #in~x; {4246#(<= 1 g_~x)} is VALID [2022-02-21 03:02:45,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {4246#(<= 1 g_~x)} assume !(0 == ~x); {4246#(<= 1 g_~x)} is VALID [2022-02-21 03:02:45,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {4246#(<= 1 g_~x)} assume ~x - 1 <= 2147483647; {4246#(<= 1 g_~x)} is VALID [2022-02-21 03:02:45,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {4246#(<= 1 g_~x)} assume ~x - 1 >= -2147483648; {4246#(<= 1 g_~x)} is VALID [2022-02-21 03:02:45,350 INFO L272 TraceCheckUtils]: 26: Hoare triple {4246#(<= 1 g_~x)} call #t~ret0 := g(~x - 1); {4247#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:45,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {4247#(<= 0 |g_#in~x|)} ~x := #in~x; {4248#(<= 0 g_~x)} is VALID [2022-02-21 03:02:45,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {4248#(<= 0 g_~x)} assume !(0 == ~x); {4248#(<= 0 g_~x)} is VALID [2022-02-21 03:02:45,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {4248#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {4248#(<= 0 g_~x)} is VALID [2022-02-21 03:02:45,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {4248#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {4248#(<= 0 g_~x)} is VALID [2022-02-21 03:02:45,351 INFO L272 TraceCheckUtils]: 31: Hoare triple {4248#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {4249#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:45,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {4249#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {4250#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:45,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {4250#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {4250#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:45,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {4250#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {4250#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:45,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {4250#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {4250#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:45,353 INFO L272 TraceCheckUtils]: 36: Hoare triple {4250#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {4251#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:02:45,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {4251#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {4252#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:45,354 INFO L290 TraceCheckUtils]: 38: Hoare triple {4252#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {4252#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:45,354 INFO L290 TraceCheckUtils]: 39: Hoare triple {4252#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {4252#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:45,354 INFO L290 TraceCheckUtils]: 40: Hoare triple {4252#(<= 0 (+ 2 g_~x))} assume !(~x - 1 >= -2147483648); {4237#false} is VALID [2022-02-21 03:02:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 34 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:45,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:45,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943416664] [2022-02-21 03:02:45,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943416664] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:45,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696581609] [2022-02-21 03:02:45,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:02:45,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:45,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:45,356 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:02:45,358 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:02:45,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-02-21 03:02:45,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:02:45,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:02:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:45,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:45,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {4236#true} assume { :begin_inline_ULTIMATE.init } true; {4236#true} is VALID [2022-02-21 03:02:45,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {4236#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {4236#true} is VALID [2022-02-21 03:02:45,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {4236#true} assume !(main_~x~0#1 < 0); {4236#true} is VALID [2022-02-21 03:02:45,563 INFO L272 TraceCheckUtils]: 3: Hoare triple {4236#true} call main_#t~ret3#1 := g(main_~x~0#1); {4236#true} is VALID [2022-02-21 03:02:45,563 INFO L290 TraceCheckUtils]: 4: Hoare triple {4236#true} ~x := #in~x; {4236#true} is VALID [2022-02-21 03:02:45,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {4236#true} assume !(0 == ~x); {4236#true} is VALID [2022-02-21 03:02:45,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {4236#true} assume ~x - 1 <= 2147483647; {4236#true} is VALID [2022-02-21 03:02:45,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {4236#true} assume ~x - 1 >= -2147483648; {4236#true} is VALID [2022-02-21 03:02:45,563 INFO L272 TraceCheckUtils]: 8: Hoare triple {4236#true} call #t~ret0 := g(~x - 1); {4236#true} is VALID [2022-02-21 03:02:45,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {4236#true} ~x := #in~x; {4236#true} is VALID [2022-02-21 03:02:45,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {4236#true} assume 0 == ~x;#res := 1; {4253#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:45,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {4253#(<= 1 |g_#res|)} assume true; {4253#(<= 1 |g_#res|)} is VALID [2022-02-21 03:02:45,565 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4253#(<= 1 |g_#res|)} {4236#true} #32#return; {4242#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:45,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {4242#(<= 1 |g_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4242#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:45,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {4242#(<= 1 |g_#t~ret0|)} assume 1 + #t~ret0 <= 2147483647; {4242#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:45,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {4242#(<= 1 |g_#t~ret0|)} assume 1 + #t~ret0 >= -2147483648; {4242#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:02:45,566 INFO L272 TraceCheckUtils]: 16: Hoare triple {4242#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(1 + #t~ret0); {4243#(<= 2 |g_#in~x|)} is VALID [2022-02-21 03:02:45,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {4243#(<= 2 |g_#in~x|)} ~x := #in~x; {4244#(<= 2 g_~x)} is VALID [2022-02-21 03:02:45,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {4244#(<= 2 g_~x)} assume !(0 == ~x); {4244#(<= 2 g_~x)} is VALID [2022-02-21 03:02:45,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {4244#(<= 2 g_~x)} assume ~x - 1 <= 2147483647; {4244#(<= 2 g_~x)} is VALID [2022-02-21 03:02:45,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {4244#(<= 2 g_~x)} assume ~x - 1 >= -2147483648; {4244#(<= 2 g_~x)} is VALID [2022-02-21 03:02:45,570 INFO L272 TraceCheckUtils]: 21: Hoare triple {4244#(<= 2 g_~x)} call #t~ret0 := g(~x - 1); {4245#(<= 1 |g_#in~x|)} is VALID [2022-02-21 03:02:45,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {4245#(<= 1 |g_#in~x|)} ~x := #in~x; {4246#(<= 1 g_~x)} is VALID [2022-02-21 03:02:45,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {4246#(<= 1 g_~x)} assume !(0 == ~x); {4246#(<= 1 g_~x)} is VALID [2022-02-21 03:02:45,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {4246#(<= 1 g_~x)} assume ~x - 1 <= 2147483647; {4246#(<= 1 g_~x)} is VALID [2022-02-21 03:02:45,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {4246#(<= 1 g_~x)} assume ~x - 1 >= -2147483648; {4246#(<= 1 g_~x)} is VALID [2022-02-21 03:02:45,576 INFO L272 TraceCheckUtils]: 26: Hoare triple {4246#(<= 1 g_~x)} call #t~ret0 := g(~x - 1); {4247#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:45,576 INFO L290 TraceCheckUtils]: 27: Hoare triple {4247#(<= 0 |g_#in~x|)} ~x := #in~x; {4248#(<= 0 g_~x)} is VALID [2022-02-21 03:02:45,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {4248#(<= 0 g_~x)} assume !(0 == ~x); {4248#(<= 0 g_~x)} is VALID [2022-02-21 03:02:45,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {4248#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {4248#(<= 0 g_~x)} is VALID [2022-02-21 03:02:45,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {4248#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {4248#(<= 0 g_~x)} is VALID [2022-02-21 03:02:45,579 INFO L272 TraceCheckUtils]: 31: Hoare triple {4248#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {4249#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:45,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {4249#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {4250#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:45,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {4250#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {4250#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:45,580 INFO L290 TraceCheckUtils]: 34: Hoare triple {4250#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {4250#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:45,580 INFO L290 TraceCheckUtils]: 35: Hoare triple {4250#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {4250#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:45,581 INFO L272 TraceCheckUtils]: 36: Hoare triple {4250#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {4251#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:02:45,581 INFO L290 TraceCheckUtils]: 37: Hoare triple {4251#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {4252#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:45,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {4252#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {4252#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:45,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {4252#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {4252#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:45,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {4252#(<= 0 (+ 2 g_~x))} assume !(~x - 1 >= -2147483648); {4237#false} is VALID [2022-02-21 03:02:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 34 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:45,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:45,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {4377#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {4237#false} is VALID [2022-02-21 03:02:45,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {4377#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {4377#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:45,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {4377#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {4377#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:45,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {4387#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {4377#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:45,916 INFO L272 TraceCheckUtils]: 36: Hoare triple {4391#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {4387#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:02:45,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {4391#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {4391#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:45,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {4391#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {4391#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:45,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {4391#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {4391#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:45,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {4404#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {4391#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:45,917 INFO L272 TraceCheckUtils]: 31: Hoare triple {4408#(<= 0 (+ 2147483645 g_~x))} call #t~ret0 := g(~x - 1); {4404#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:02:45,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {4408#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 >= -2147483648; {4408#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:45,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {4408#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 <= 2147483647; {4408#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:45,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {4408#(<= 0 (+ 2147483645 g_~x))} assume !(0 == ~x); {4408#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:45,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {4421#(<= 0 (+ 2147483645 |g_#in~x|))} ~x := #in~x; {4408#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:45,919 INFO L272 TraceCheckUtils]: 26: Hoare triple {4425#(<= 0 (+ g_~x 2147483644))} call #t~ret0 := g(~x - 1); {4421#(<= 0 (+ 2147483645 |g_#in~x|))} is VALID [2022-02-21 03:02:45,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {4425#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 >= -2147483648; {4425#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:45,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {4425#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 <= 2147483647; {4425#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:45,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {4425#(<= 0 (+ g_~x 2147483644))} assume !(0 == ~x); {4425#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:45,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {4438#(<= 0 (+ |g_#in~x| 2147483644))} ~x := #in~x; {4425#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:45,921 INFO L272 TraceCheckUtils]: 21: Hoare triple {4442#(<= 0 (+ 2147483643 g_~x))} call #t~ret0 := g(~x - 1); {4438#(<= 0 (+ |g_#in~x| 2147483644))} is VALID [2022-02-21 03:02:45,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {4442#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 >= -2147483648; {4442#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:45,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {4442#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 <= 2147483647; {4442#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:45,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {4442#(<= 0 (+ 2147483643 g_~x))} assume !(0 == ~x); {4442#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:45,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {4455#(<= 0 (+ 2147483643 |g_#in~x|))} ~x := #in~x; {4442#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:45,922 INFO L272 TraceCheckUtils]: 16: Hoare triple {4459#(<= 0 (+ 2147483644 |g_#t~ret0|))} call #t~ret1 := g(1 + #t~ret0); {4455#(<= 0 (+ 2147483643 |g_#in~x|))} is VALID [2022-02-21 03:02:45,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {4459#(<= 0 (+ 2147483644 |g_#t~ret0|))} assume 1 + #t~ret0 >= -2147483648; {4459#(<= 0 (+ 2147483644 |g_#t~ret0|))} is VALID [2022-02-21 03:02:45,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {4459#(<= 0 (+ 2147483644 |g_#t~ret0|))} assume 1 + #t~ret0 <= 2147483647; {4459#(<= 0 (+ 2147483644 |g_#t~ret0|))} is VALID [2022-02-21 03:02:45,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {4459#(<= 0 (+ 2147483644 |g_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4459#(<= 0 (+ 2147483644 |g_#t~ret0|))} is VALID [2022-02-21 03:02:45,924 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4475#(<= 0 (+ |g_#res| 2147483644))} {4236#true} #32#return; {4459#(<= 0 (+ 2147483644 |g_#t~ret0|))} is VALID [2022-02-21 03:02:45,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {4475#(<= 0 (+ |g_#res| 2147483644))} assume true; {4475#(<= 0 (+ |g_#res| 2147483644))} is VALID [2022-02-21 03:02:45,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {4236#true} assume 0 == ~x;#res := 1; {4475#(<= 0 (+ |g_#res| 2147483644))} is VALID [2022-02-21 03:02:45,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {4236#true} ~x := #in~x; {4236#true} is VALID [2022-02-21 03:02:45,925 INFO L272 TraceCheckUtils]: 8: Hoare triple {4236#true} call #t~ret0 := g(~x - 1); {4236#true} is VALID [2022-02-21 03:02:45,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {4236#true} assume ~x - 1 >= -2147483648; {4236#true} is VALID [2022-02-21 03:02:45,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {4236#true} assume ~x - 1 <= 2147483647; {4236#true} is VALID [2022-02-21 03:02:45,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {4236#true} assume !(0 == ~x); {4236#true} is VALID [2022-02-21 03:02:45,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {4236#true} ~x := #in~x; {4236#true} is VALID [2022-02-21 03:02:45,926 INFO L272 TraceCheckUtils]: 3: Hoare triple {4236#true} call main_#t~ret3#1 := g(main_~x~0#1); {4236#true} is VALID [2022-02-21 03:02:45,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {4236#true} assume !(main_~x~0#1 < 0); {4236#true} is VALID [2022-02-21 03:02:45,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {4236#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {4236#true} is VALID [2022-02-21 03:02:45,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {4236#true} assume { :begin_inline_ULTIMATE.init } true; {4236#true} is VALID [2022-02-21 03:02:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 34 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:02:45,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696581609] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:45,927 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:45,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-21 03:02:45,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989095389] [2022-02-21 03:02:45,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:45,928 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 16 states have internal predecessors, (57), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-02-21 03:02:45,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:45,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.28) internal successors, (57), 16 states have internal predecessors, (57), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:45,965 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:02:45,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-21 03:02:45,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:45,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-21 03:02:45,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2022-02-21 03:02:45,967 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 16 states have internal predecessors, (57), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:46,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:46,374 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2022-02-21 03:02:46,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-21 03:02:46,375 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 16 states have internal predecessors, (57), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-02-21 03:02:46,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 16 states have internal predecessors, (57), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 45 transitions. [2022-02-21 03:02:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 16 states have internal predecessors, (57), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 45 transitions. [2022-02-21 03:02:46,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 45 transitions. [2022-02-21 03:02:46,395 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:02:46,396 INFO L225 Difference]: With dead ends: 122 [2022-02-21 03:02:46,396 INFO L226 Difference]: Without dead ends: 59 [2022-02-21 03:02:46,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=316, Invalid=874, Unknown=0, NotChecked=0, Total=1190 [2022-02-21 03:02:46,397 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 47 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:46,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 155 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:02:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-21 03:02:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-02-21 03:02:46,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:46,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:46,439 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:46,439 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:46,440 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-02-21 03:02:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-02-21 03:02:46,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:46,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:46,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 59 states. [2022-02-21 03:02:46,440 INFO L87 Difference]: Start difference. First operand has 59 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 59 states. [2022-02-21 03:02:46,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:46,441 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-02-21 03:02:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-02-21 03:02:46,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:46,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:46,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:46,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-02-21 03:02:46,443 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 41 [2022-02-21 03:02:46,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:46,443 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-02-21 03:02:46,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 16 states have internal predecessors, (57), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:02:46,444 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-02-21 03:02:46,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-21 03:02:46,444 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:46,444 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1, 1] [2022-02-21 03:02:46,468 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:02:46,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:46,668 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:46,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:46,669 INFO L85 PathProgramCache]: Analyzing trace with hash 235894418, now seen corresponding path program 3 times [2022-02-21 03:02:46,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:46,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752866376] [2022-02-21 03:02:46,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:46,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:46,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {4881#true} assume { :begin_inline_ULTIMATE.init } true; {4881#true} is VALID [2022-02-21 03:02:46,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {4881#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {4881#true} is VALID [2022-02-21 03:02:46,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {4881#true} assume !(main_~x~0#1 < 0); {4883#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:46,929 INFO L272 TraceCheckUtils]: 3: Hoare triple {4883#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {4884#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:46,930 INFO L290 TraceCheckUtils]: 4: Hoare triple {4884#(<= 0 |g_#in~x|)} ~x := #in~x; {4885#(<= 0 g_~x)} is VALID [2022-02-21 03:02:46,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {4885#(<= 0 g_~x)} assume !(0 == ~x); {4885#(<= 0 g_~x)} is VALID [2022-02-21 03:02:46,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {4885#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {4885#(<= 0 g_~x)} is VALID [2022-02-21 03:02:46,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {4885#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {4885#(<= 0 g_~x)} is VALID [2022-02-21 03:02:46,932 INFO L272 TraceCheckUtils]: 8: Hoare triple {4885#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {4886#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:46,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {4886#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {4887#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:46,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {4887#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {4887#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:46,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {4887#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {4887#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:46,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {4887#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {4887#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:46,934 INFO L272 TraceCheckUtils]: 13: Hoare triple {4887#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {4888#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:02:46,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {4888#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {4889#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:46,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {4889#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {4889#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:46,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {4889#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {4889#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:46,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {4889#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {4889#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:46,936 INFO L272 TraceCheckUtils]: 18: Hoare triple {4889#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {4890#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:02:46,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {4890#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {4891#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:46,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {4891#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {4891#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:46,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {4891#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {4891#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:46,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {4891#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {4891#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:46,937 INFO L272 TraceCheckUtils]: 23: Hoare triple {4891#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {4892#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:02:46,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {4892#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {4893#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:46,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {4893#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {4893#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:46,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {4893#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {4893#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:46,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {4893#(<= 0 (+ g_~x 4))} assume ~x - 1 >= -2147483648; {4893#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:46,939 INFO L272 TraceCheckUtils]: 28: Hoare triple {4893#(<= 0 (+ g_~x 4))} call #t~ret0 := g(~x - 1); {4894#(<= 0 (+ 5 |g_#in~x|))} is VALID [2022-02-21 03:02:46,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {4894#(<= 0 (+ 5 |g_#in~x|))} ~x := #in~x; {4895#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:46,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {4895#(<= 0 (+ 5 g_~x))} assume !(0 == ~x); {4895#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:46,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {4895#(<= 0 (+ 5 g_~x))} assume ~x - 1 <= 2147483647; {4895#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:46,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {4895#(<= 0 (+ 5 g_~x))} assume ~x - 1 >= -2147483648; {4895#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:46,941 INFO L272 TraceCheckUtils]: 33: Hoare triple {4895#(<= 0 (+ 5 g_~x))} call #t~ret0 := g(~x - 1); {4896#(<= 0 (+ |g_#in~x| 6))} is VALID [2022-02-21 03:02:46,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {4896#(<= 0 (+ |g_#in~x| 6))} ~x := #in~x; {4897#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:46,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {4897#(<= 0 (+ 6 g_~x))} assume !(0 == ~x); {4897#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:46,943 INFO L290 TraceCheckUtils]: 36: Hoare triple {4897#(<= 0 (+ 6 g_~x))} assume ~x - 1 <= 2147483647; {4897#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:46,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {4897#(<= 0 (+ 6 g_~x))} assume ~x - 1 >= -2147483648; {4897#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:46,943 INFO L272 TraceCheckUtils]: 38: Hoare triple {4897#(<= 0 (+ 6 g_~x))} call #t~ret0 := g(~x - 1); {4898#(<= 0 (+ 7 |g_#in~x|))} is VALID [2022-02-21 03:02:46,944 INFO L290 TraceCheckUtils]: 39: Hoare triple {4898#(<= 0 (+ 7 |g_#in~x|))} ~x := #in~x; {4899#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:46,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {4899#(<= 0 (+ 7 g_~x))} assume !(0 == ~x); {4899#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:46,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {4899#(<= 0 (+ 7 g_~x))} assume ~x - 1 <= 2147483647; {4899#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:46,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {4899#(<= 0 (+ 7 g_~x))} assume ~x - 1 >= -2147483648; {4899#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:46,945 INFO L272 TraceCheckUtils]: 43: Hoare triple {4899#(<= 0 (+ 7 g_~x))} call #t~ret0 := g(~x - 1); {4900#(<= 0 (+ |g_#in~x| 8))} is VALID [2022-02-21 03:02:46,946 INFO L290 TraceCheckUtils]: 44: Hoare triple {4900#(<= 0 (+ |g_#in~x| 8))} ~x := #in~x; {4901#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:46,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {4901#(<= 0 (+ g_~x 8))} assume !(0 == ~x); {4901#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:46,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {4901#(<= 0 (+ g_~x 8))} assume ~x - 1 <= 2147483647; {4901#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:46,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {4901#(<= 0 (+ g_~x 8))} assume ~x - 1 >= -2147483648; {4901#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:46,947 INFO L272 TraceCheckUtils]: 48: Hoare triple {4901#(<= 0 (+ g_~x 8))} call #t~ret0 := g(~x - 1); {4902#(<= 0 (+ |g_#in~x| 9))} is VALID [2022-02-21 03:02:46,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {4902#(<= 0 (+ |g_#in~x| 9))} ~x := #in~x; {4903#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:46,948 INFO L290 TraceCheckUtils]: 50: Hoare triple {4903#(<= 0 (+ 9 g_~x))} assume !(0 == ~x); {4903#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:46,948 INFO L290 TraceCheckUtils]: 51: Hoare triple {4903#(<= 0 (+ 9 g_~x))} assume ~x - 1 <= 2147483647; {4903#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:46,948 INFO L290 TraceCheckUtils]: 52: Hoare triple {4903#(<= 0 (+ 9 g_~x))} assume ~x - 1 >= -2147483648; {4903#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:46,949 INFO L272 TraceCheckUtils]: 53: Hoare triple {4903#(<= 0 (+ 9 g_~x))} call #t~ret0 := g(~x - 1); {4904#(<= 0 (+ |g_#in~x| 10))} is VALID [2022-02-21 03:02:46,949 INFO L290 TraceCheckUtils]: 54: Hoare triple {4904#(<= 0 (+ |g_#in~x| 10))} ~x := #in~x; {4905#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:46,950 INFO L290 TraceCheckUtils]: 55: Hoare triple {4905#(<= 0 (+ g_~x 10))} assume !(0 == ~x); {4905#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:46,950 INFO L290 TraceCheckUtils]: 56: Hoare triple {4905#(<= 0 (+ g_~x 10))} assume ~x - 1 <= 2147483647; {4905#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:46,950 INFO L290 TraceCheckUtils]: 57: Hoare triple {4905#(<= 0 (+ g_~x 10))} assume !(~x - 1 >= -2147483648); {4882#false} is VALID [2022-02-21 03:02:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:46,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:46,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752866376] [2022-02-21 03:02:46,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752866376] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:46,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074708457] [2022-02-21 03:02:46,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:02:46,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:46,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:46,957 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:02:46,958 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:02:46,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-21 03:02:46,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:02:47,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 03:02:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:47,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:47,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {4881#true} assume { :begin_inline_ULTIMATE.init } true; {4881#true} is VALID [2022-02-21 03:02:47,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {4881#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {4881#true} is VALID [2022-02-21 03:02:47,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {4881#true} assume !(main_~x~0#1 < 0); {4883#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:47,406 INFO L272 TraceCheckUtils]: 3: Hoare triple {4883#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {4884#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:47,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {4884#(<= 0 |g_#in~x|)} ~x := #in~x; {4885#(<= 0 g_~x)} is VALID [2022-02-21 03:02:47,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {4885#(<= 0 g_~x)} assume !(0 == ~x); {4885#(<= 0 g_~x)} is VALID [2022-02-21 03:02:47,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {4885#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {4885#(<= 0 g_~x)} is VALID [2022-02-21 03:02:47,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {4885#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {4885#(<= 0 g_~x)} is VALID [2022-02-21 03:02:47,407 INFO L272 TraceCheckUtils]: 8: Hoare triple {4885#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {4886#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:47,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {4886#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {4887#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:47,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {4887#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {4887#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:47,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {4887#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {4887#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:47,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {4887#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {4887#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:47,410 INFO L272 TraceCheckUtils]: 13: Hoare triple {4887#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {4888#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:02:47,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {4888#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {4889#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:47,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {4889#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {4889#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:47,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {4889#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {4889#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:47,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {4889#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {4889#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:47,412 INFO L272 TraceCheckUtils]: 18: Hoare triple {4889#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {4890#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:02:47,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {4890#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {4891#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:47,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {4891#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {4891#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:47,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {4891#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {4891#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:47,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {4891#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {4891#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:47,414 INFO L272 TraceCheckUtils]: 23: Hoare triple {4891#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {4892#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:02:47,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {4892#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {4893#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:47,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {4893#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {4893#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:47,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {4893#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {4893#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:47,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {4893#(<= 0 (+ g_~x 4))} assume ~x - 1 >= -2147483648; {4893#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:47,416 INFO L272 TraceCheckUtils]: 28: Hoare triple {4893#(<= 0 (+ g_~x 4))} call #t~ret0 := g(~x - 1); {4894#(<= 0 (+ 5 |g_#in~x|))} is VALID [2022-02-21 03:02:47,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {4894#(<= 0 (+ 5 |g_#in~x|))} ~x := #in~x; {4895#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:47,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {4895#(<= 0 (+ 5 g_~x))} assume !(0 == ~x); {4895#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:47,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {4895#(<= 0 (+ 5 g_~x))} assume ~x - 1 <= 2147483647; {4895#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:47,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {4895#(<= 0 (+ 5 g_~x))} assume ~x - 1 >= -2147483648; {4895#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:47,418 INFO L272 TraceCheckUtils]: 33: Hoare triple {4895#(<= 0 (+ 5 g_~x))} call #t~ret0 := g(~x - 1); {4896#(<= 0 (+ |g_#in~x| 6))} is VALID [2022-02-21 03:02:47,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {4896#(<= 0 (+ |g_#in~x| 6))} ~x := #in~x; {4897#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:47,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {4897#(<= 0 (+ 6 g_~x))} assume !(0 == ~x); {4897#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:47,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {4897#(<= 0 (+ 6 g_~x))} assume ~x - 1 <= 2147483647; {4897#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:47,419 INFO L290 TraceCheckUtils]: 37: Hoare triple {4897#(<= 0 (+ 6 g_~x))} assume ~x - 1 >= -2147483648; {4897#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:47,419 INFO L272 TraceCheckUtils]: 38: Hoare triple {4897#(<= 0 (+ 6 g_~x))} call #t~ret0 := g(~x - 1); {4898#(<= 0 (+ 7 |g_#in~x|))} is VALID [2022-02-21 03:02:47,419 INFO L290 TraceCheckUtils]: 39: Hoare triple {4898#(<= 0 (+ 7 |g_#in~x|))} ~x := #in~x; {4899#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:47,420 INFO L290 TraceCheckUtils]: 40: Hoare triple {4899#(<= 0 (+ 7 g_~x))} assume !(0 == ~x); {4899#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:47,420 INFO L290 TraceCheckUtils]: 41: Hoare triple {4899#(<= 0 (+ 7 g_~x))} assume ~x - 1 <= 2147483647; {4899#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:47,420 INFO L290 TraceCheckUtils]: 42: Hoare triple {4899#(<= 0 (+ 7 g_~x))} assume ~x - 1 >= -2147483648; {4899#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:47,421 INFO L272 TraceCheckUtils]: 43: Hoare triple {4899#(<= 0 (+ 7 g_~x))} call #t~ret0 := g(~x - 1); {4900#(<= 0 (+ |g_#in~x| 8))} is VALID [2022-02-21 03:02:47,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {4900#(<= 0 (+ |g_#in~x| 8))} ~x := #in~x; {4901#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:47,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {4901#(<= 0 (+ g_~x 8))} assume !(0 == ~x); {4901#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:47,421 INFO L290 TraceCheckUtils]: 46: Hoare triple {4901#(<= 0 (+ g_~x 8))} assume ~x - 1 <= 2147483647; {4901#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:47,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {4901#(<= 0 (+ g_~x 8))} assume ~x - 1 >= -2147483648; {4901#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:47,422 INFO L272 TraceCheckUtils]: 48: Hoare triple {4901#(<= 0 (+ g_~x 8))} call #t~ret0 := g(~x - 1); {4902#(<= 0 (+ |g_#in~x| 9))} is VALID [2022-02-21 03:02:47,422 INFO L290 TraceCheckUtils]: 49: Hoare triple {4902#(<= 0 (+ |g_#in~x| 9))} ~x := #in~x; {4903#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:47,423 INFO L290 TraceCheckUtils]: 50: Hoare triple {4903#(<= 0 (+ 9 g_~x))} assume !(0 == ~x); {4903#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:47,423 INFO L290 TraceCheckUtils]: 51: Hoare triple {4903#(<= 0 (+ 9 g_~x))} assume ~x - 1 <= 2147483647; {4903#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:47,423 INFO L290 TraceCheckUtils]: 52: Hoare triple {4903#(<= 0 (+ 9 g_~x))} assume ~x - 1 >= -2147483648; {4903#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:47,424 INFO L272 TraceCheckUtils]: 53: Hoare triple {4903#(<= 0 (+ 9 g_~x))} call #t~ret0 := g(~x - 1); {4904#(<= 0 (+ |g_#in~x| 10))} is VALID [2022-02-21 03:02:47,424 INFO L290 TraceCheckUtils]: 54: Hoare triple {4904#(<= 0 (+ |g_#in~x| 10))} ~x := #in~x; {4905#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:47,424 INFO L290 TraceCheckUtils]: 55: Hoare triple {4905#(<= 0 (+ g_~x 10))} assume !(0 == ~x); {4905#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:47,424 INFO L290 TraceCheckUtils]: 56: Hoare triple {4905#(<= 0 (+ g_~x 10))} assume ~x - 1 <= 2147483647; {4905#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:47,425 INFO L290 TraceCheckUtils]: 57: Hoare triple {4905#(<= 0 (+ g_~x 10))} assume !(~x - 1 >= -2147483648); {4882#false} is VALID [2022-02-21 03:02:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:47,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:48,082 INFO L290 TraceCheckUtils]: 57: Hoare triple {5080#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {4882#false} is VALID [2022-02-21 03:02:48,083 INFO L290 TraceCheckUtils]: 56: Hoare triple {5080#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {5080#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:48,083 INFO L290 TraceCheckUtils]: 55: Hoare triple {5080#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {5080#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:48,083 INFO L290 TraceCheckUtils]: 54: Hoare triple {5090#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {5080#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:48,084 INFO L272 TraceCheckUtils]: 53: Hoare triple {5094#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {5090#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:02:48,084 INFO L290 TraceCheckUtils]: 52: Hoare triple {5094#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {5094#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:48,084 INFO L290 TraceCheckUtils]: 51: Hoare triple {5094#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {5094#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:48,085 INFO L290 TraceCheckUtils]: 50: Hoare triple {5094#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {5094#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:48,085 INFO L290 TraceCheckUtils]: 49: Hoare triple {5107#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {5094#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:48,085 INFO L272 TraceCheckUtils]: 48: Hoare triple {5111#(<= 0 (+ 2147483645 g_~x))} call #t~ret0 := g(~x - 1); {5107#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:02:48,086 INFO L290 TraceCheckUtils]: 47: Hoare triple {5111#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 >= -2147483648; {5111#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:48,086 INFO L290 TraceCheckUtils]: 46: Hoare triple {5111#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 <= 2147483647; {5111#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:48,086 INFO L290 TraceCheckUtils]: 45: Hoare triple {5111#(<= 0 (+ 2147483645 g_~x))} assume !(0 == ~x); {5111#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:48,086 INFO L290 TraceCheckUtils]: 44: Hoare triple {5124#(<= 0 (+ 2147483645 |g_#in~x|))} ~x := #in~x; {5111#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:48,087 INFO L272 TraceCheckUtils]: 43: Hoare triple {5128#(<= 0 (+ g_~x 2147483644))} call #t~ret0 := g(~x - 1); {5124#(<= 0 (+ 2147483645 |g_#in~x|))} is VALID [2022-02-21 03:02:48,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {5128#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 >= -2147483648; {5128#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:48,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {5128#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 <= 2147483647; {5128#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:48,087 INFO L290 TraceCheckUtils]: 40: Hoare triple {5128#(<= 0 (+ g_~x 2147483644))} assume !(0 == ~x); {5128#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:48,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {5141#(<= 0 (+ |g_#in~x| 2147483644))} ~x := #in~x; {5128#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:48,088 INFO L272 TraceCheckUtils]: 38: Hoare triple {5145#(<= 0 (+ 2147483643 g_~x))} call #t~ret0 := g(~x - 1); {5141#(<= 0 (+ |g_#in~x| 2147483644))} is VALID [2022-02-21 03:02:48,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {5145#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 >= -2147483648; {5145#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:48,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {5145#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 <= 2147483647; {5145#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:48,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {5145#(<= 0 (+ 2147483643 g_~x))} assume !(0 == ~x); {5145#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:48,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {5158#(<= 0 (+ 2147483643 |g_#in~x|))} ~x := #in~x; {5145#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:48,090 INFO L272 TraceCheckUtils]: 33: Hoare triple {5162#(<= 0 (+ g_~x 2147483642))} call #t~ret0 := g(~x - 1); {5158#(<= 0 (+ 2147483643 |g_#in~x|))} is VALID [2022-02-21 03:02:48,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {5162#(<= 0 (+ g_~x 2147483642))} assume ~x - 1 >= -2147483648; {5162#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:02:48,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {5162#(<= 0 (+ g_~x 2147483642))} assume ~x - 1 <= 2147483647; {5162#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:02:48,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {5162#(<= 0 (+ g_~x 2147483642))} assume !(0 == ~x); {5162#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:02:48,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {5175#(<= 0 (+ |g_#in~x| 2147483642))} ~x := #in~x; {5162#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:02:48,091 INFO L272 TraceCheckUtils]: 28: Hoare triple {5179#(<= 0 (+ g_~x 2147483641))} call #t~ret0 := g(~x - 1); {5175#(<= 0 (+ |g_#in~x| 2147483642))} is VALID [2022-02-21 03:02:48,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {5179#(<= 0 (+ g_~x 2147483641))} assume ~x - 1 >= -2147483648; {5179#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:02:48,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {5179#(<= 0 (+ g_~x 2147483641))} assume ~x - 1 <= 2147483647; {5179#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:02:48,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {5179#(<= 0 (+ g_~x 2147483641))} assume !(0 == ~x); {5179#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:02:48,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {5192#(<= 0 (+ |g_#in~x| 2147483641))} ~x := #in~x; {5179#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:02:48,092 INFO L272 TraceCheckUtils]: 23: Hoare triple {5196#(<= 0 (+ g_~x 2147483640))} call #t~ret0 := g(~x - 1); {5192#(<= 0 (+ |g_#in~x| 2147483641))} is VALID [2022-02-21 03:02:48,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {5196#(<= 0 (+ g_~x 2147483640))} assume ~x - 1 >= -2147483648; {5196#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:02:48,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {5196#(<= 0 (+ g_~x 2147483640))} assume ~x - 1 <= 2147483647; {5196#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:02:48,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {5196#(<= 0 (+ g_~x 2147483640))} assume !(0 == ~x); {5196#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:02:48,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {5209#(<= 0 (+ |g_#in~x| 2147483640))} ~x := #in~x; {5196#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:02:48,094 INFO L272 TraceCheckUtils]: 18: Hoare triple {5213#(<= 0 (+ g_~x 2147483639))} call #t~ret0 := g(~x - 1); {5209#(<= 0 (+ |g_#in~x| 2147483640))} is VALID [2022-02-21 03:02:48,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {5213#(<= 0 (+ g_~x 2147483639))} assume ~x - 1 >= -2147483648; {5213#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:02:48,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {5213#(<= 0 (+ g_~x 2147483639))} assume ~x - 1 <= 2147483647; {5213#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:02:48,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {5213#(<= 0 (+ g_~x 2147483639))} assume !(0 == ~x); {5213#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:02:48,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {5226#(<= 0 (+ |g_#in~x| 2147483639))} ~x := #in~x; {5213#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:02:48,095 INFO L272 TraceCheckUtils]: 13: Hoare triple {5230#(<= 0 (+ 2147483638 g_~x))} call #t~ret0 := g(~x - 1); {5226#(<= 0 (+ |g_#in~x| 2147483639))} is VALID [2022-02-21 03:02:48,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {5230#(<= 0 (+ 2147483638 g_~x))} assume ~x - 1 >= -2147483648; {5230#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:02:48,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {5230#(<= 0 (+ 2147483638 g_~x))} assume ~x - 1 <= 2147483647; {5230#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:02:48,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {5230#(<= 0 (+ 2147483638 g_~x))} assume !(0 == ~x); {5230#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:02:48,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {5243#(<= 0 (+ 2147483638 |g_#in~x|))} ~x := #in~x; {5230#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:02:48,097 INFO L272 TraceCheckUtils]: 8: Hoare triple {5247#(<= 0 (+ g_~x 2147483637))} call #t~ret0 := g(~x - 1); {5243#(<= 0 (+ 2147483638 |g_#in~x|))} is VALID [2022-02-21 03:02:48,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {5247#(<= 0 (+ g_~x 2147483637))} assume ~x - 1 >= -2147483648; {5247#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:02:48,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {5247#(<= 0 (+ g_~x 2147483637))} assume ~x - 1 <= 2147483647; {5247#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:02:48,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {5247#(<= 0 (+ g_~x 2147483637))} assume !(0 == ~x); {5247#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:02:48,098 INFO L290 TraceCheckUtils]: 4: Hoare triple {5260#(<= 0 (+ |g_#in~x| 2147483637))} ~x := #in~x; {5247#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:02:48,098 INFO L272 TraceCheckUtils]: 3: Hoare triple {5264#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483637))} call main_#t~ret3#1 := g(main_~x~0#1); {5260#(<= 0 (+ |g_#in~x| 2147483637))} is VALID [2022-02-21 03:02:48,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {4881#true} assume !(main_~x~0#1 < 0); {5264#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483637))} is VALID [2022-02-21 03:02:48,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {4881#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {4881#true} is VALID [2022-02-21 03:02:48,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {4881#true} assume { :begin_inline_ULTIMATE.init } true; {4881#true} is VALID [2022-02-21 03:02:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:48,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074708457] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:48,099 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:48,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2022-02-21 03:02:48,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65350166] [2022-02-21 03:02:48,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:48,100 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 26 states have internal predecessors, (92), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-21 03:02:48,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:48,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 26 states have internal predecessors, (92), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:48,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:48,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-02-21 03:02:48,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:48,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-02-21 03:02:48,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2022-02-21 03:02:48,170 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 26 states have internal predecessors, (92), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:49,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:49,016 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2022-02-21 03:02:49,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-21 03:02:49,016 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 26 states have internal predecessors, (92), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-21 03:02:49,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:49,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 26 states have internal predecessors, (92), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 132 transitions. [2022-02-21 03:02:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 26 states have internal predecessors, (92), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 132 transitions. [2022-02-21 03:02:49,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 132 transitions. [2022-02-21 03:02:49,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:49,117 INFO L225 Difference]: With dead ends: 121 [2022-02-21 03:02:49,117 INFO L226 Difference]: Without dead ends: 120 [2022-02-21 03:02:49,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2022-02-21 03:02:49,119 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 326 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:49,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 36 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:02:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-21 03:02:49,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-02-21 03:02:49,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:49,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 119 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 23 states have call successors, (23), 23 states have call predecessors, (23), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:49,254 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 119 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 23 states have call successors, (23), 23 states have call predecessors, (23), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:49,254 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 119 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 23 states have call successors, (23), 23 states have call predecessors, (23), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:49,255 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2022-02-21 03:02:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2022-02-21 03:02:49,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:49,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:49,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 23 states have call successors, (23), 23 states have call predecessors, (23), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 120 states. [2022-02-21 03:02:49,256 INFO L87 Difference]: Start difference. First operand has 119 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 23 states have call successors, (23), 23 states have call predecessors, (23), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 120 states. [2022-02-21 03:02:49,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:49,257 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2022-02-21 03:02:49,257 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2022-02-21 03:02:49,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:49,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:49,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:49,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 23 states have call successors, (23), 23 states have call predecessors, (23), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2022-02-21 03:02:49,260 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 58 [2022-02-21 03:02:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:49,260 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2022-02-21 03:02:49,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 26 states have internal predecessors, (92), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:49,261 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2022-02-21 03:02:49,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-21 03:02:49,261 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:49,261 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1, 1, 1] [2022-02-21 03:02:49,284 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:02:49,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-21 03:02:49,477 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:49,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:49,478 INFO L85 PathProgramCache]: Analyzing trace with hash -102214958, now seen corresponding path program 4 times [2022-02-21 03:02:49,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:49,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444394785] [2022-02-21 03:02:49,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:49,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:50,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {5890#true} assume { :begin_inline_ULTIMATE.init } true; {5890#true} is VALID [2022-02-21 03:02:50,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {5890#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {5890#true} is VALID [2022-02-21 03:02:50,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {5890#true} assume !(main_~x~0#1 < 0); {5892#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:50,290 INFO L272 TraceCheckUtils]: 3: Hoare triple {5892#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {5893#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:50,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {5893#(<= 0 |g_#in~x|)} ~x := #in~x; {5894#(<= 0 g_~x)} is VALID [2022-02-21 03:02:50,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {5894#(<= 0 g_~x)} assume !(0 == ~x); {5894#(<= 0 g_~x)} is VALID [2022-02-21 03:02:50,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {5894#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {5894#(<= 0 g_~x)} is VALID [2022-02-21 03:02:50,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {5894#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {5894#(<= 0 g_~x)} is VALID [2022-02-21 03:02:50,292 INFO L272 TraceCheckUtils]: 8: Hoare triple {5894#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {5895#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:50,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {5895#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {5896#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:50,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {5896#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {5896#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:50,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {5896#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {5896#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:50,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {5896#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {5896#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:50,294 INFO L272 TraceCheckUtils]: 13: Hoare triple {5896#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {5897#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:02:50,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {5897#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {5898#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:50,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {5898#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {5898#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:50,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {5898#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {5898#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:50,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {5898#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {5898#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:50,296 INFO L272 TraceCheckUtils]: 18: Hoare triple {5898#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {5899#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:02:50,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {5899#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {5900#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:50,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {5900#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {5900#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:50,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {5900#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {5900#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:50,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {5900#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {5900#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:50,298 INFO L272 TraceCheckUtils]: 23: Hoare triple {5900#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {5901#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:02:50,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {5901#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {5902#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:50,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {5902#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {5902#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:50,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {5902#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {5902#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:50,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {5902#(<= 0 (+ g_~x 4))} assume ~x - 1 >= -2147483648; {5902#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:50,300 INFO L272 TraceCheckUtils]: 28: Hoare triple {5902#(<= 0 (+ g_~x 4))} call #t~ret0 := g(~x - 1); {5903#(<= 0 (+ 5 |g_#in~x|))} is VALID [2022-02-21 03:02:50,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {5903#(<= 0 (+ 5 |g_#in~x|))} ~x := #in~x; {5904#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:50,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {5904#(<= 0 (+ 5 g_~x))} assume !(0 == ~x); {5904#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:50,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {5904#(<= 0 (+ 5 g_~x))} assume ~x - 1 <= 2147483647; {5904#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:50,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {5904#(<= 0 (+ 5 g_~x))} assume ~x - 1 >= -2147483648; {5904#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:50,301 INFO L272 TraceCheckUtils]: 33: Hoare triple {5904#(<= 0 (+ 5 g_~x))} call #t~ret0 := g(~x - 1); {5905#(<= 0 (+ |g_#in~x| 6))} is VALID [2022-02-21 03:02:50,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {5905#(<= 0 (+ |g_#in~x| 6))} ~x := #in~x; {5906#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:50,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {5906#(<= 0 (+ 6 g_~x))} assume !(0 == ~x); {5906#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:50,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {5906#(<= 0 (+ 6 g_~x))} assume ~x - 1 <= 2147483647; {5906#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:50,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {5906#(<= 0 (+ 6 g_~x))} assume ~x - 1 >= -2147483648; {5906#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:50,303 INFO L272 TraceCheckUtils]: 38: Hoare triple {5906#(<= 0 (+ 6 g_~x))} call #t~ret0 := g(~x - 1); {5907#(<= 0 (+ 7 |g_#in~x|))} is VALID [2022-02-21 03:02:50,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {5907#(<= 0 (+ 7 |g_#in~x|))} ~x := #in~x; {5908#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:50,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {5908#(<= 0 (+ 7 g_~x))} assume !(0 == ~x); {5908#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:50,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {5908#(<= 0 (+ 7 g_~x))} assume ~x - 1 <= 2147483647; {5908#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:50,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {5908#(<= 0 (+ 7 g_~x))} assume ~x - 1 >= -2147483648; {5908#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:50,305 INFO L272 TraceCheckUtils]: 43: Hoare triple {5908#(<= 0 (+ 7 g_~x))} call #t~ret0 := g(~x - 1); {5909#(<= 0 (+ |g_#in~x| 8))} is VALID [2022-02-21 03:02:50,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {5909#(<= 0 (+ |g_#in~x| 8))} ~x := #in~x; {5910#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:50,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {5910#(<= 0 (+ g_~x 8))} assume !(0 == ~x); {5910#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:50,306 INFO L290 TraceCheckUtils]: 46: Hoare triple {5910#(<= 0 (+ g_~x 8))} assume ~x - 1 <= 2147483647; {5910#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:50,307 INFO L290 TraceCheckUtils]: 47: Hoare triple {5910#(<= 0 (+ g_~x 8))} assume ~x - 1 >= -2147483648; {5910#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:50,307 INFO L272 TraceCheckUtils]: 48: Hoare triple {5910#(<= 0 (+ g_~x 8))} call #t~ret0 := g(~x - 1); {5911#(<= 0 (+ |g_#in~x| 9))} is VALID [2022-02-21 03:02:50,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {5911#(<= 0 (+ |g_#in~x| 9))} ~x := #in~x; {5912#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:50,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {5912#(<= 0 (+ 9 g_~x))} assume !(0 == ~x); {5912#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:50,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {5912#(<= 0 (+ 9 g_~x))} assume ~x - 1 <= 2147483647; {5912#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:50,308 INFO L290 TraceCheckUtils]: 52: Hoare triple {5912#(<= 0 (+ 9 g_~x))} assume ~x - 1 >= -2147483648; {5912#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:50,309 INFO L272 TraceCheckUtils]: 53: Hoare triple {5912#(<= 0 (+ 9 g_~x))} call #t~ret0 := g(~x - 1); {5913#(<= 0 (+ |g_#in~x| 10))} is VALID [2022-02-21 03:02:50,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {5913#(<= 0 (+ |g_#in~x| 10))} ~x := #in~x; {5914#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:50,310 INFO L290 TraceCheckUtils]: 55: Hoare triple {5914#(<= 0 (+ g_~x 10))} assume !(0 == ~x); {5914#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:50,310 INFO L290 TraceCheckUtils]: 56: Hoare triple {5914#(<= 0 (+ g_~x 10))} assume ~x - 1 <= 2147483647; {5914#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:50,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {5914#(<= 0 (+ g_~x 10))} assume ~x - 1 >= -2147483648; {5914#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:50,311 INFO L272 TraceCheckUtils]: 58: Hoare triple {5914#(<= 0 (+ g_~x 10))} call #t~ret0 := g(~x - 1); {5915#(<= 0 (+ |g_#in~x| 11))} is VALID [2022-02-21 03:02:50,311 INFO L290 TraceCheckUtils]: 59: Hoare triple {5915#(<= 0 (+ |g_#in~x| 11))} ~x := #in~x; {5916#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:02:50,311 INFO L290 TraceCheckUtils]: 60: Hoare triple {5916#(<= 0 (+ g_~x 11))} assume !(0 == ~x); {5916#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:02:50,312 INFO L290 TraceCheckUtils]: 61: Hoare triple {5916#(<= 0 (+ g_~x 11))} assume ~x - 1 <= 2147483647; {5916#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:02:50,312 INFO L290 TraceCheckUtils]: 62: Hoare triple {5916#(<= 0 (+ g_~x 11))} assume ~x - 1 >= -2147483648; {5916#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:02:50,313 INFO L272 TraceCheckUtils]: 63: Hoare triple {5916#(<= 0 (+ g_~x 11))} call #t~ret0 := g(~x - 1); {5917#(<= 0 (+ |g_#in~x| 12))} is VALID [2022-02-21 03:02:50,313 INFO L290 TraceCheckUtils]: 64: Hoare triple {5917#(<= 0 (+ |g_#in~x| 12))} ~x := #in~x; {5918#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:02:50,313 INFO L290 TraceCheckUtils]: 65: Hoare triple {5918#(<= 0 (+ g_~x 12))} assume !(0 == ~x); {5918#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:02:50,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {5918#(<= 0 (+ g_~x 12))} assume ~x - 1 <= 2147483647; {5918#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:02:50,314 INFO L290 TraceCheckUtils]: 67: Hoare triple {5918#(<= 0 (+ g_~x 12))} assume ~x - 1 >= -2147483648; {5918#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:02:50,314 INFO L272 TraceCheckUtils]: 68: Hoare triple {5918#(<= 0 (+ g_~x 12))} call #t~ret0 := g(~x - 1); {5919#(<= 0 (+ |g_#in~x| 13))} is VALID [2022-02-21 03:02:50,315 INFO L290 TraceCheckUtils]: 69: Hoare triple {5919#(<= 0 (+ |g_#in~x| 13))} ~x := #in~x; {5920#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:02:50,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {5920#(<= 0 (+ g_~x 13))} assume !(0 == ~x); {5920#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:02:50,315 INFO L290 TraceCheckUtils]: 71: Hoare triple {5920#(<= 0 (+ g_~x 13))} assume ~x - 1 <= 2147483647; {5920#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:02:50,316 INFO L290 TraceCheckUtils]: 72: Hoare triple {5920#(<= 0 (+ g_~x 13))} assume ~x - 1 >= -2147483648; {5920#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:02:50,316 INFO L272 TraceCheckUtils]: 73: Hoare triple {5920#(<= 0 (+ g_~x 13))} call #t~ret0 := g(~x - 1); {5921#(<= 0 (+ |g_#in~x| 14))} is VALID [2022-02-21 03:02:50,317 INFO L290 TraceCheckUtils]: 74: Hoare triple {5921#(<= 0 (+ |g_#in~x| 14))} ~x := #in~x; {5922#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:02:50,317 INFO L290 TraceCheckUtils]: 75: Hoare triple {5922#(<= 0 (+ 14 g_~x))} assume !(0 == ~x); {5922#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:02:50,317 INFO L290 TraceCheckUtils]: 76: Hoare triple {5922#(<= 0 (+ 14 g_~x))} assume ~x - 1 <= 2147483647; {5922#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:02:50,318 INFO L290 TraceCheckUtils]: 77: Hoare triple {5922#(<= 0 (+ 14 g_~x))} assume ~x - 1 >= -2147483648; {5922#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:02:50,318 INFO L272 TraceCheckUtils]: 78: Hoare triple {5922#(<= 0 (+ 14 g_~x))} call #t~ret0 := g(~x - 1); {5923#(<= 0 (+ |g_#in~x| 15))} is VALID [2022-02-21 03:02:50,319 INFO L290 TraceCheckUtils]: 79: Hoare triple {5923#(<= 0 (+ |g_#in~x| 15))} ~x := #in~x; {5924#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:02:50,319 INFO L290 TraceCheckUtils]: 80: Hoare triple {5924#(<= 0 (+ g_~x 15))} assume !(0 == ~x); {5924#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:02:50,319 INFO L290 TraceCheckUtils]: 81: Hoare triple {5924#(<= 0 (+ g_~x 15))} assume ~x - 1 <= 2147483647; {5924#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:02:50,320 INFO L290 TraceCheckUtils]: 82: Hoare triple {5924#(<= 0 (+ g_~x 15))} assume ~x - 1 >= -2147483648; {5924#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:02:50,320 INFO L272 TraceCheckUtils]: 83: Hoare triple {5924#(<= 0 (+ g_~x 15))} call #t~ret0 := g(~x - 1); {5925#(<= 0 (+ |g_#in~x| 16))} is VALID [2022-02-21 03:02:50,320 INFO L290 TraceCheckUtils]: 84: Hoare triple {5925#(<= 0 (+ |g_#in~x| 16))} ~x := #in~x; {5926#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:02:50,321 INFO L290 TraceCheckUtils]: 85: Hoare triple {5926#(<= 0 (+ 16 g_~x))} assume !(0 == ~x); {5926#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:02:50,321 INFO L290 TraceCheckUtils]: 86: Hoare triple {5926#(<= 0 (+ 16 g_~x))} assume ~x - 1 <= 2147483647; {5926#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:02:50,321 INFO L290 TraceCheckUtils]: 87: Hoare triple {5926#(<= 0 (+ 16 g_~x))} assume ~x - 1 >= -2147483648; {5926#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:02:50,322 INFO L272 TraceCheckUtils]: 88: Hoare triple {5926#(<= 0 (+ 16 g_~x))} call #t~ret0 := g(~x - 1); {5927#(<= 0 (+ |g_#in~x| 17))} is VALID [2022-02-21 03:02:50,322 INFO L290 TraceCheckUtils]: 89: Hoare triple {5927#(<= 0 (+ |g_#in~x| 17))} ~x := #in~x; {5928#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:02:50,323 INFO L290 TraceCheckUtils]: 90: Hoare triple {5928#(<= 0 (+ g_~x 17))} assume !(0 == ~x); {5928#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:02:50,323 INFO L290 TraceCheckUtils]: 91: Hoare triple {5928#(<= 0 (+ g_~x 17))} assume ~x - 1 <= 2147483647; {5928#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:02:50,323 INFO L290 TraceCheckUtils]: 92: Hoare triple {5928#(<= 0 (+ g_~x 17))} assume ~x - 1 >= -2147483648; {5928#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:02:50,324 INFO L272 TraceCheckUtils]: 93: Hoare triple {5928#(<= 0 (+ g_~x 17))} call #t~ret0 := g(~x - 1); {5929#(<= 0 (+ |g_#in~x| 18))} is VALID [2022-02-21 03:02:50,324 INFO L290 TraceCheckUtils]: 94: Hoare triple {5929#(<= 0 (+ |g_#in~x| 18))} ~x := #in~x; {5930#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:02:50,324 INFO L290 TraceCheckUtils]: 95: Hoare triple {5930#(<= 0 (+ g_~x 18))} assume !(0 == ~x); {5930#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:02:50,325 INFO L290 TraceCheckUtils]: 96: Hoare triple {5930#(<= 0 (+ g_~x 18))} assume ~x - 1 <= 2147483647; {5930#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:02:50,325 INFO L290 TraceCheckUtils]: 97: Hoare triple {5930#(<= 0 (+ g_~x 18))} assume ~x - 1 >= -2147483648; {5930#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:02:50,326 INFO L272 TraceCheckUtils]: 98: Hoare triple {5930#(<= 0 (+ g_~x 18))} call #t~ret0 := g(~x - 1); {5931#(<= 0 (+ 19 |g_#in~x|))} is VALID [2022-02-21 03:02:50,326 INFO L290 TraceCheckUtils]: 99: Hoare triple {5931#(<= 0 (+ 19 |g_#in~x|))} ~x := #in~x; {5932#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:02:50,326 INFO L290 TraceCheckUtils]: 100: Hoare triple {5932#(<= 0 (+ 19 g_~x))} assume !(0 == ~x); {5932#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:02:50,327 INFO L290 TraceCheckUtils]: 101: Hoare triple {5932#(<= 0 (+ 19 g_~x))} assume ~x - 1 <= 2147483647; {5932#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:02:50,327 INFO L290 TraceCheckUtils]: 102: Hoare triple {5932#(<= 0 (+ 19 g_~x))} assume ~x - 1 >= -2147483648; {5932#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:02:50,327 INFO L272 TraceCheckUtils]: 103: Hoare triple {5932#(<= 0 (+ 19 g_~x))} call #t~ret0 := g(~x - 1); {5933#(<= 0 (+ |g_#in~x| 20))} is VALID [2022-02-21 03:02:50,328 INFO L290 TraceCheckUtils]: 104: Hoare triple {5933#(<= 0 (+ |g_#in~x| 20))} ~x := #in~x; {5934#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:02:50,328 INFO L290 TraceCheckUtils]: 105: Hoare triple {5934#(<= 0 (+ g_~x 20))} assume !(0 == ~x); {5934#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:02:50,328 INFO L290 TraceCheckUtils]: 106: Hoare triple {5934#(<= 0 (+ g_~x 20))} assume ~x - 1 <= 2147483647; {5934#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:02:50,329 INFO L290 TraceCheckUtils]: 107: Hoare triple {5934#(<= 0 (+ g_~x 20))} assume ~x - 1 >= -2147483648; {5934#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:02:50,329 INFO L272 TraceCheckUtils]: 108: Hoare triple {5934#(<= 0 (+ g_~x 20))} call #t~ret0 := g(~x - 1); {5935#(<= 0 (+ |g_#in~x| 21))} is VALID [2022-02-21 03:02:50,330 INFO L290 TraceCheckUtils]: 109: Hoare triple {5935#(<= 0 (+ |g_#in~x| 21))} ~x := #in~x; {5936#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:02:50,330 INFO L290 TraceCheckUtils]: 110: Hoare triple {5936#(<= 0 (+ 21 g_~x))} assume !(0 == ~x); {5936#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:02:50,330 INFO L290 TraceCheckUtils]: 111: Hoare triple {5936#(<= 0 (+ 21 g_~x))} assume ~x - 1 <= 2147483647; {5936#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:02:50,331 INFO L290 TraceCheckUtils]: 112: Hoare triple {5936#(<= 0 (+ 21 g_~x))} assume ~x - 1 >= -2147483648; {5936#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:02:50,331 INFO L272 TraceCheckUtils]: 113: Hoare triple {5936#(<= 0 (+ 21 g_~x))} call #t~ret0 := g(~x - 1); {5937#(<= 0 (+ |g_#in~x| 22))} is VALID [2022-02-21 03:02:50,332 INFO L290 TraceCheckUtils]: 114: Hoare triple {5937#(<= 0 (+ |g_#in~x| 22))} ~x := #in~x; {5938#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:02:50,332 INFO L290 TraceCheckUtils]: 115: Hoare triple {5938#(<= 0 (+ 22 g_~x))} assume !(0 == ~x); {5938#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:02:50,332 INFO L290 TraceCheckUtils]: 116: Hoare triple {5938#(<= 0 (+ 22 g_~x))} assume ~x - 1 <= 2147483647; {5938#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:02:50,333 INFO L290 TraceCheckUtils]: 117: Hoare triple {5938#(<= 0 (+ 22 g_~x))} assume !(~x - 1 >= -2147483648); {5891#false} is VALID [2022-02-21 03:02:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:50,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:50,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444394785] [2022-02-21 03:02:50,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444394785] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:50,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897951213] [2022-02-21 03:02:50,334 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:02:50,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:50,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:50,335 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:02:50,337 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:02:50,386 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:02:50,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:02:50,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-21 03:02:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:50,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:02:50,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {5890#true} assume { :begin_inline_ULTIMATE.init } true; {5890#true} is VALID [2022-02-21 03:02:50,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {5890#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {5890#true} is VALID [2022-02-21 03:02:50,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {5890#true} assume !(main_~x~0#1 < 0); {5892#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:50,942 INFO L272 TraceCheckUtils]: 3: Hoare triple {5892#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {5893#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:50,943 INFO L290 TraceCheckUtils]: 4: Hoare triple {5893#(<= 0 |g_#in~x|)} ~x := #in~x; {5894#(<= 0 g_~x)} is VALID [2022-02-21 03:02:50,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {5894#(<= 0 g_~x)} assume !(0 == ~x); {5894#(<= 0 g_~x)} is VALID [2022-02-21 03:02:50,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {5894#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {5894#(<= 0 g_~x)} is VALID [2022-02-21 03:02:50,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {5894#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {5894#(<= 0 g_~x)} is VALID [2022-02-21 03:02:50,944 INFO L272 TraceCheckUtils]: 8: Hoare triple {5894#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {5895#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:50,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {5895#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {5896#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:50,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {5896#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {5896#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:50,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {5896#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {5896#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:50,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {5896#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {5896#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:50,945 INFO L272 TraceCheckUtils]: 13: Hoare triple {5896#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {5897#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:02:50,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {5897#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {5898#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:50,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {5898#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {5898#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:50,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {5898#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {5898#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:50,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {5898#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {5898#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:50,947 INFO L272 TraceCheckUtils]: 18: Hoare triple {5898#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {5899#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:02:50,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {5899#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {5900#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:50,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {5900#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {5900#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:50,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {5900#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {5900#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:50,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {5900#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {5900#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:50,948 INFO L272 TraceCheckUtils]: 23: Hoare triple {5900#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {5901#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:02:50,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {5901#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {5902#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:50,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {5902#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {5902#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:50,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {5902#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {5902#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:50,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {5902#(<= 0 (+ g_~x 4))} assume ~x - 1 >= -2147483648; {5902#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:50,950 INFO L272 TraceCheckUtils]: 28: Hoare triple {5902#(<= 0 (+ g_~x 4))} call #t~ret0 := g(~x - 1); {5903#(<= 0 (+ 5 |g_#in~x|))} is VALID [2022-02-21 03:02:50,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {5903#(<= 0 (+ 5 |g_#in~x|))} ~x := #in~x; {5904#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:50,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {5904#(<= 0 (+ 5 g_~x))} assume !(0 == ~x); {5904#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:50,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {5904#(<= 0 (+ 5 g_~x))} assume ~x - 1 <= 2147483647; {5904#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:50,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {5904#(<= 0 (+ 5 g_~x))} assume ~x - 1 >= -2147483648; {5904#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:50,951 INFO L272 TraceCheckUtils]: 33: Hoare triple {5904#(<= 0 (+ 5 g_~x))} call #t~ret0 := g(~x - 1); {5905#(<= 0 (+ |g_#in~x| 6))} is VALID [2022-02-21 03:02:50,952 INFO L290 TraceCheckUtils]: 34: Hoare triple {5905#(<= 0 (+ |g_#in~x| 6))} ~x := #in~x; {5906#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:50,952 INFO L290 TraceCheckUtils]: 35: Hoare triple {5906#(<= 0 (+ 6 g_~x))} assume !(0 == ~x); {5906#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:50,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {5906#(<= 0 (+ 6 g_~x))} assume ~x - 1 <= 2147483647; {5906#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:50,953 INFO L290 TraceCheckUtils]: 37: Hoare triple {5906#(<= 0 (+ 6 g_~x))} assume ~x - 1 >= -2147483648; {5906#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:50,953 INFO L272 TraceCheckUtils]: 38: Hoare triple {5906#(<= 0 (+ 6 g_~x))} call #t~ret0 := g(~x - 1); {5907#(<= 0 (+ 7 |g_#in~x|))} is VALID [2022-02-21 03:02:50,953 INFO L290 TraceCheckUtils]: 39: Hoare triple {5907#(<= 0 (+ 7 |g_#in~x|))} ~x := #in~x; {5908#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:50,954 INFO L290 TraceCheckUtils]: 40: Hoare triple {5908#(<= 0 (+ 7 g_~x))} assume !(0 == ~x); {5908#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:50,954 INFO L290 TraceCheckUtils]: 41: Hoare triple {5908#(<= 0 (+ 7 g_~x))} assume ~x - 1 <= 2147483647; {5908#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:50,954 INFO L290 TraceCheckUtils]: 42: Hoare triple {5908#(<= 0 (+ 7 g_~x))} assume ~x - 1 >= -2147483648; {5908#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:50,955 INFO L272 TraceCheckUtils]: 43: Hoare triple {5908#(<= 0 (+ 7 g_~x))} call #t~ret0 := g(~x - 1); {5909#(<= 0 (+ |g_#in~x| 8))} is VALID [2022-02-21 03:02:50,955 INFO L290 TraceCheckUtils]: 44: Hoare triple {5909#(<= 0 (+ |g_#in~x| 8))} ~x := #in~x; {5910#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:50,955 INFO L290 TraceCheckUtils]: 45: Hoare triple {5910#(<= 0 (+ g_~x 8))} assume !(0 == ~x); {5910#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:50,955 INFO L290 TraceCheckUtils]: 46: Hoare triple {5910#(<= 0 (+ g_~x 8))} assume ~x - 1 <= 2147483647; {5910#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:50,956 INFO L290 TraceCheckUtils]: 47: Hoare triple {5910#(<= 0 (+ g_~x 8))} assume ~x - 1 >= -2147483648; {5910#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:50,956 INFO L272 TraceCheckUtils]: 48: Hoare triple {5910#(<= 0 (+ g_~x 8))} call #t~ret0 := g(~x - 1); {5911#(<= 0 (+ |g_#in~x| 9))} is VALID [2022-02-21 03:02:50,956 INFO L290 TraceCheckUtils]: 49: Hoare triple {5911#(<= 0 (+ |g_#in~x| 9))} ~x := #in~x; {5912#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:50,957 INFO L290 TraceCheckUtils]: 50: Hoare triple {5912#(<= 0 (+ 9 g_~x))} assume !(0 == ~x); {5912#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:50,957 INFO L290 TraceCheckUtils]: 51: Hoare triple {5912#(<= 0 (+ 9 g_~x))} assume ~x - 1 <= 2147483647; {5912#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:50,957 INFO L290 TraceCheckUtils]: 52: Hoare triple {5912#(<= 0 (+ 9 g_~x))} assume ~x - 1 >= -2147483648; {5912#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:50,958 INFO L272 TraceCheckUtils]: 53: Hoare triple {5912#(<= 0 (+ 9 g_~x))} call #t~ret0 := g(~x - 1); {5913#(<= 0 (+ |g_#in~x| 10))} is VALID [2022-02-21 03:02:50,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {5913#(<= 0 (+ |g_#in~x| 10))} ~x := #in~x; {5914#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:50,958 INFO L290 TraceCheckUtils]: 55: Hoare triple {5914#(<= 0 (+ g_~x 10))} assume !(0 == ~x); {5914#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:50,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {5914#(<= 0 (+ g_~x 10))} assume ~x - 1 <= 2147483647; {5914#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:50,959 INFO L290 TraceCheckUtils]: 57: Hoare triple {5914#(<= 0 (+ g_~x 10))} assume ~x - 1 >= -2147483648; {5914#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:50,959 INFO L272 TraceCheckUtils]: 58: Hoare triple {5914#(<= 0 (+ g_~x 10))} call #t~ret0 := g(~x - 1); {5915#(<= 0 (+ |g_#in~x| 11))} is VALID [2022-02-21 03:02:50,959 INFO L290 TraceCheckUtils]: 59: Hoare triple {5915#(<= 0 (+ |g_#in~x| 11))} ~x := #in~x; {5916#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:02:50,959 INFO L290 TraceCheckUtils]: 60: Hoare triple {5916#(<= 0 (+ g_~x 11))} assume !(0 == ~x); {5916#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:02:50,960 INFO L290 TraceCheckUtils]: 61: Hoare triple {5916#(<= 0 (+ g_~x 11))} assume ~x - 1 <= 2147483647; {5916#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:02:50,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {5916#(<= 0 (+ g_~x 11))} assume ~x - 1 >= -2147483648; {5916#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:02:50,960 INFO L272 TraceCheckUtils]: 63: Hoare triple {5916#(<= 0 (+ g_~x 11))} call #t~ret0 := g(~x - 1); {5917#(<= 0 (+ |g_#in~x| 12))} is VALID [2022-02-21 03:02:50,961 INFO L290 TraceCheckUtils]: 64: Hoare triple {5917#(<= 0 (+ |g_#in~x| 12))} ~x := #in~x; {5918#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:02:50,961 INFO L290 TraceCheckUtils]: 65: Hoare triple {5918#(<= 0 (+ g_~x 12))} assume !(0 == ~x); {5918#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:02:50,961 INFO L290 TraceCheckUtils]: 66: Hoare triple {5918#(<= 0 (+ g_~x 12))} assume ~x - 1 <= 2147483647; {5918#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:02:50,961 INFO L290 TraceCheckUtils]: 67: Hoare triple {5918#(<= 0 (+ g_~x 12))} assume ~x - 1 >= -2147483648; {5918#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:02:50,962 INFO L272 TraceCheckUtils]: 68: Hoare triple {5918#(<= 0 (+ g_~x 12))} call #t~ret0 := g(~x - 1); {5919#(<= 0 (+ |g_#in~x| 13))} is VALID [2022-02-21 03:02:50,962 INFO L290 TraceCheckUtils]: 69: Hoare triple {5919#(<= 0 (+ |g_#in~x| 13))} ~x := #in~x; {5920#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:02:50,962 INFO L290 TraceCheckUtils]: 70: Hoare triple {5920#(<= 0 (+ g_~x 13))} assume !(0 == ~x); {5920#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:02:50,963 INFO L290 TraceCheckUtils]: 71: Hoare triple {5920#(<= 0 (+ g_~x 13))} assume ~x - 1 <= 2147483647; {5920#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:02:50,963 INFO L290 TraceCheckUtils]: 72: Hoare triple {5920#(<= 0 (+ g_~x 13))} assume ~x - 1 >= -2147483648; {5920#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:02:50,963 INFO L272 TraceCheckUtils]: 73: Hoare triple {5920#(<= 0 (+ g_~x 13))} call #t~ret0 := g(~x - 1); {5921#(<= 0 (+ |g_#in~x| 14))} is VALID [2022-02-21 03:02:50,964 INFO L290 TraceCheckUtils]: 74: Hoare triple {5921#(<= 0 (+ |g_#in~x| 14))} ~x := #in~x; {5922#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:02:50,964 INFO L290 TraceCheckUtils]: 75: Hoare triple {5922#(<= 0 (+ 14 g_~x))} assume !(0 == ~x); {5922#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:02:50,964 INFO L290 TraceCheckUtils]: 76: Hoare triple {5922#(<= 0 (+ 14 g_~x))} assume ~x - 1 <= 2147483647; {5922#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:02:50,964 INFO L290 TraceCheckUtils]: 77: Hoare triple {5922#(<= 0 (+ 14 g_~x))} assume ~x - 1 >= -2147483648; {5922#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:02:50,965 INFO L272 TraceCheckUtils]: 78: Hoare triple {5922#(<= 0 (+ 14 g_~x))} call #t~ret0 := g(~x - 1); {5923#(<= 0 (+ |g_#in~x| 15))} is VALID [2022-02-21 03:02:50,965 INFO L290 TraceCheckUtils]: 79: Hoare triple {5923#(<= 0 (+ |g_#in~x| 15))} ~x := #in~x; {5924#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:02:50,965 INFO L290 TraceCheckUtils]: 80: Hoare triple {5924#(<= 0 (+ g_~x 15))} assume !(0 == ~x); {5924#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:02:50,966 INFO L290 TraceCheckUtils]: 81: Hoare triple {5924#(<= 0 (+ g_~x 15))} assume ~x - 1 <= 2147483647; {5924#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:02:50,966 INFO L290 TraceCheckUtils]: 82: Hoare triple {5924#(<= 0 (+ g_~x 15))} assume ~x - 1 >= -2147483648; {5924#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:02:50,966 INFO L272 TraceCheckUtils]: 83: Hoare triple {5924#(<= 0 (+ g_~x 15))} call #t~ret0 := g(~x - 1); {5925#(<= 0 (+ |g_#in~x| 16))} is VALID [2022-02-21 03:02:50,967 INFO L290 TraceCheckUtils]: 84: Hoare triple {5925#(<= 0 (+ |g_#in~x| 16))} ~x := #in~x; {5926#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:02:50,967 INFO L290 TraceCheckUtils]: 85: Hoare triple {5926#(<= 0 (+ 16 g_~x))} assume !(0 == ~x); {5926#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:02:50,967 INFO L290 TraceCheckUtils]: 86: Hoare triple {5926#(<= 0 (+ 16 g_~x))} assume ~x - 1 <= 2147483647; {5926#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:02:50,967 INFO L290 TraceCheckUtils]: 87: Hoare triple {5926#(<= 0 (+ 16 g_~x))} assume ~x - 1 >= -2147483648; {5926#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:02:50,968 INFO L272 TraceCheckUtils]: 88: Hoare triple {5926#(<= 0 (+ 16 g_~x))} call #t~ret0 := g(~x - 1); {5927#(<= 0 (+ |g_#in~x| 17))} is VALID [2022-02-21 03:02:50,968 INFO L290 TraceCheckUtils]: 89: Hoare triple {5927#(<= 0 (+ |g_#in~x| 17))} ~x := #in~x; {5928#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:02:50,968 INFO L290 TraceCheckUtils]: 90: Hoare triple {5928#(<= 0 (+ g_~x 17))} assume !(0 == ~x); {5928#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:02:50,969 INFO L290 TraceCheckUtils]: 91: Hoare triple {5928#(<= 0 (+ g_~x 17))} assume ~x - 1 <= 2147483647; {5928#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:02:50,969 INFO L290 TraceCheckUtils]: 92: Hoare triple {5928#(<= 0 (+ g_~x 17))} assume ~x - 1 >= -2147483648; {5928#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:02:50,969 INFO L272 TraceCheckUtils]: 93: Hoare triple {5928#(<= 0 (+ g_~x 17))} call #t~ret0 := g(~x - 1); {5929#(<= 0 (+ |g_#in~x| 18))} is VALID [2022-02-21 03:02:50,970 INFO L290 TraceCheckUtils]: 94: Hoare triple {5929#(<= 0 (+ |g_#in~x| 18))} ~x := #in~x; {5930#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:02:50,970 INFO L290 TraceCheckUtils]: 95: Hoare triple {5930#(<= 0 (+ g_~x 18))} assume !(0 == ~x); {5930#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:02:50,970 INFO L290 TraceCheckUtils]: 96: Hoare triple {5930#(<= 0 (+ g_~x 18))} assume ~x - 1 <= 2147483647; {5930#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:02:50,970 INFO L290 TraceCheckUtils]: 97: Hoare triple {5930#(<= 0 (+ g_~x 18))} assume ~x - 1 >= -2147483648; {5930#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:02:50,971 INFO L272 TraceCheckUtils]: 98: Hoare triple {5930#(<= 0 (+ g_~x 18))} call #t~ret0 := g(~x - 1); {5931#(<= 0 (+ 19 |g_#in~x|))} is VALID [2022-02-21 03:02:50,971 INFO L290 TraceCheckUtils]: 99: Hoare triple {5931#(<= 0 (+ 19 |g_#in~x|))} ~x := #in~x; {5932#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:02:50,971 INFO L290 TraceCheckUtils]: 100: Hoare triple {5932#(<= 0 (+ 19 g_~x))} assume !(0 == ~x); {5932#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:02:50,972 INFO L290 TraceCheckUtils]: 101: Hoare triple {5932#(<= 0 (+ 19 g_~x))} assume ~x - 1 <= 2147483647; {5932#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:02:50,972 INFO L290 TraceCheckUtils]: 102: Hoare triple {5932#(<= 0 (+ 19 g_~x))} assume ~x - 1 >= -2147483648; {5932#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:02:50,972 INFO L272 TraceCheckUtils]: 103: Hoare triple {5932#(<= 0 (+ 19 g_~x))} call #t~ret0 := g(~x - 1); {5933#(<= 0 (+ |g_#in~x| 20))} is VALID [2022-02-21 03:02:50,973 INFO L290 TraceCheckUtils]: 104: Hoare triple {5933#(<= 0 (+ |g_#in~x| 20))} ~x := #in~x; {5934#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:02:50,973 INFO L290 TraceCheckUtils]: 105: Hoare triple {5934#(<= 0 (+ g_~x 20))} assume !(0 == ~x); {5934#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:02:50,973 INFO L290 TraceCheckUtils]: 106: Hoare triple {5934#(<= 0 (+ g_~x 20))} assume ~x - 1 <= 2147483647; {5934#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:02:50,973 INFO L290 TraceCheckUtils]: 107: Hoare triple {5934#(<= 0 (+ g_~x 20))} assume ~x - 1 >= -2147483648; {5934#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:02:50,974 INFO L272 TraceCheckUtils]: 108: Hoare triple {5934#(<= 0 (+ g_~x 20))} call #t~ret0 := g(~x - 1); {5935#(<= 0 (+ |g_#in~x| 21))} is VALID [2022-02-21 03:02:50,974 INFO L290 TraceCheckUtils]: 109: Hoare triple {5935#(<= 0 (+ |g_#in~x| 21))} ~x := #in~x; {5936#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:02:50,974 INFO L290 TraceCheckUtils]: 110: Hoare triple {5936#(<= 0 (+ 21 g_~x))} assume !(0 == ~x); {5936#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:02:50,975 INFO L290 TraceCheckUtils]: 111: Hoare triple {5936#(<= 0 (+ 21 g_~x))} assume ~x - 1 <= 2147483647; {5936#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:02:50,975 INFO L290 TraceCheckUtils]: 112: Hoare triple {5936#(<= 0 (+ 21 g_~x))} assume ~x - 1 >= -2147483648; {5936#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:02:50,975 INFO L272 TraceCheckUtils]: 113: Hoare triple {5936#(<= 0 (+ 21 g_~x))} call #t~ret0 := g(~x - 1); {5937#(<= 0 (+ |g_#in~x| 22))} is VALID [2022-02-21 03:02:50,976 INFO L290 TraceCheckUtils]: 114: Hoare triple {5937#(<= 0 (+ |g_#in~x| 22))} ~x := #in~x; {5938#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:02:50,976 INFO L290 TraceCheckUtils]: 115: Hoare triple {5938#(<= 0 (+ 22 g_~x))} assume !(0 == ~x); {5938#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:02:50,976 INFO L290 TraceCheckUtils]: 116: Hoare triple {5938#(<= 0 (+ 22 g_~x))} assume ~x - 1 <= 2147483647; {5938#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:02:50,977 INFO L290 TraceCheckUtils]: 117: Hoare triple {5938#(<= 0 (+ 22 g_~x))} assume !(~x - 1 >= -2147483648); {5891#false} is VALID [2022-02-21 03:02:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:50,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:02:52,635 INFO L290 TraceCheckUtils]: 117: Hoare triple {6293#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {5891#false} is VALID [2022-02-21 03:02:52,636 INFO L290 TraceCheckUtils]: 116: Hoare triple {6293#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {6293#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:52,636 INFO L290 TraceCheckUtils]: 115: Hoare triple {6293#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {6293#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:52,636 INFO L290 TraceCheckUtils]: 114: Hoare triple {6303#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {6293#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:02:52,637 INFO L272 TraceCheckUtils]: 113: Hoare triple {6307#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {6303#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:02:52,637 INFO L290 TraceCheckUtils]: 112: Hoare triple {6307#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {6307#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:52,637 INFO L290 TraceCheckUtils]: 111: Hoare triple {6307#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {6307#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:52,638 INFO L290 TraceCheckUtils]: 110: Hoare triple {6307#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {6307#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:52,638 INFO L290 TraceCheckUtils]: 109: Hoare triple {6320#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {6307#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:02:52,639 INFO L272 TraceCheckUtils]: 108: Hoare triple {6324#(<= 0 (+ 2147483645 g_~x))} call #t~ret0 := g(~x - 1); {6320#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:02:52,639 INFO L290 TraceCheckUtils]: 107: Hoare triple {6324#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 >= -2147483648; {6324#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:52,639 INFO L290 TraceCheckUtils]: 106: Hoare triple {6324#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 <= 2147483647; {6324#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:52,639 INFO L290 TraceCheckUtils]: 105: Hoare triple {6324#(<= 0 (+ 2147483645 g_~x))} assume !(0 == ~x); {6324#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:52,640 INFO L290 TraceCheckUtils]: 104: Hoare triple {6337#(<= 0 (+ 2147483645 |g_#in~x|))} ~x := #in~x; {6324#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:02:52,640 INFO L272 TraceCheckUtils]: 103: Hoare triple {6341#(<= 0 (+ g_~x 2147483644))} call #t~ret0 := g(~x - 1); {6337#(<= 0 (+ 2147483645 |g_#in~x|))} is VALID [2022-02-21 03:02:52,641 INFO L290 TraceCheckUtils]: 102: Hoare triple {6341#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 >= -2147483648; {6341#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:52,641 INFO L290 TraceCheckUtils]: 101: Hoare triple {6341#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 <= 2147483647; {6341#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:52,641 INFO L290 TraceCheckUtils]: 100: Hoare triple {6341#(<= 0 (+ g_~x 2147483644))} assume !(0 == ~x); {6341#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:52,642 INFO L290 TraceCheckUtils]: 99: Hoare triple {6354#(<= 0 (+ |g_#in~x| 2147483644))} ~x := #in~x; {6341#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:02:52,642 INFO L272 TraceCheckUtils]: 98: Hoare triple {6358#(<= 0 (+ 2147483643 g_~x))} call #t~ret0 := g(~x - 1); {6354#(<= 0 (+ |g_#in~x| 2147483644))} is VALID [2022-02-21 03:02:52,642 INFO L290 TraceCheckUtils]: 97: Hoare triple {6358#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 >= -2147483648; {6358#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:52,643 INFO L290 TraceCheckUtils]: 96: Hoare triple {6358#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 <= 2147483647; {6358#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:52,643 INFO L290 TraceCheckUtils]: 95: Hoare triple {6358#(<= 0 (+ 2147483643 g_~x))} assume !(0 == ~x); {6358#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:52,643 INFO L290 TraceCheckUtils]: 94: Hoare triple {6371#(<= 0 (+ 2147483643 |g_#in~x|))} ~x := #in~x; {6358#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:02:52,644 INFO L272 TraceCheckUtils]: 93: Hoare triple {6375#(<= 0 (+ g_~x 2147483642))} call #t~ret0 := g(~x - 1); {6371#(<= 0 (+ 2147483643 |g_#in~x|))} is VALID [2022-02-21 03:02:52,644 INFO L290 TraceCheckUtils]: 92: Hoare triple {6375#(<= 0 (+ g_~x 2147483642))} assume ~x - 1 >= -2147483648; {6375#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:02:52,644 INFO L290 TraceCheckUtils]: 91: Hoare triple {6375#(<= 0 (+ g_~x 2147483642))} assume ~x - 1 <= 2147483647; {6375#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:02:52,645 INFO L290 TraceCheckUtils]: 90: Hoare triple {6375#(<= 0 (+ g_~x 2147483642))} assume !(0 == ~x); {6375#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:02:52,645 INFO L290 TraceCheckUtils]: 89: Hoare triple {6388#(<= 0 (+ |g_#in~x| 2147483642))} ~x := #in~x; {6375#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:02:52,646 INFO L272 TraceCheckUtils]: 88: Hoare triple {6392#(<= 0 (+ g_~x 2147483641))} call #t~ret0 := g(~x - 1); {6388#(<= 0 (+ |g_#in~x| 2147483642))} is VALID [2022-02-21 03:02:52,646 INFO L290 TraceCheckUtils]: 87: Hoare triple {6392#(<= 0 (+ g_~x 2147483641))} assume ~x - 1 >= -2147483648; {6392#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:02:52,646 INFO L290 TraceCheckUtils]: 86: Hoare triple {6392#(<= 0 (+ g_~x 2147483641))} assume ~x - 1 <= 2147483647; {6392#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:02:52,647 INFO L290 TraceCheckUtils]: 85: Hoare triple {6392#(<= 0 (+ g_~x 2147483641))} assume !(0 == ~x); {6392#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:02:52,647 INFO L290 TraceCheckUtils]: 84: Hoare triple {6405#(<= 0 (+ |g_#in~x| 2147483641))} ~x := #in~x; {6392#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:02:52,647 INFO L272 TraceCheckUtils]: 83: Hoare triple {6409#(<= 0 (+ g_~x 2147483640))} call #t~ret0 := g(~x - 1); {6405#(<= 0 (+ |g_#in~x| 2147483641))} is VALID [2022-02-21 03:02:52,648 INFO L290 TraceCheckUtils]: 82: Hoare triple {6409#(<= 0 (+ g_~x 2147483640))} assume ~x - 1 >= -2147483648; {6409#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:02:52,648 INFO L290 TraceCheckUtils]: 81: Hoare triple {6409#(<= 0 (+ g_~x 2147483640))} assume ~x - 1 <= 2147483647; {6409#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:02:52,648 INFO L290 TraceCheckUtils]: 80: Hoare triple {6409#(<= 0 (+ g_~x 2147483640))} assume !(0 == ~x); {6409#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:02:52,649 INFO L290 TraceCheckUtils]: 79: Hoare triple {6422#(<= 0 (+ |g_#in~x| 2147483640))} ~x := #in~x; {6409#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:02:52,649 INFO L272 TraceCheckUtils]: 78: Hoare triple {6426#(<= 0 (+ g_~x 2147483639))} call #t~ret0 := g(~x - 1); {6422#(<= 0 (+ |g_#in~x| 2147483640))} is VALID [2022-02-21 03:02:52,650 INFO L290 TraceCheckUtils]: 77: Hoare triple {6426#(<= 0 (+ g_~x 2147483639))} assume ~x - 1 >= -2147483648; {6426#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:02:52,650 INFO L290 TraceCheckUtils]: 76: Hoare triple {6426#(<= 0 (+ g_~x 2147483639))} assume ~x - 1 <= 2147483647; {6426#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:02:52,650 INFO L290 TraceCheckUtils]: 75: Hoare triple {6426#(<= 0 (+ g_~x 2147483639))} assume !(0 == ~x); {6426#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:02:52,650 INFO L290 TraceCheckUtils]: 74: Hoare triple {6439#(<= 0 (+ |g_#in~x| 2147483639))} ~x := #in~x; {6426#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:02:52,651 INFO L272 TraceCheckUtils]: 73: Hoare triple {6443#(<= 0 (+ 2147483638 g_~x))} call #t~ret0 := g(~x - 1); {6439#(<= 0 (+ |g_#in~x| 2147483639))} is VALID [2022-02-21 03:02:52,651 INFO L290 TraceCheckUtils]: 72: Hoare triple {6443#(<= 0 (+ 2147483638 g_~x))} assume ~x - 1 >= -2147483648; {6443#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:02:52,652 INFO L290 TraceCheckUtils]: 71: Hoare triple {6443#(<= 0 (+ 2147483638 g_~x))} assume ~x - 1 <= 2147483647; {6443#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:02:52,652 INFO L290 TraceCheckUtils]: 70: Hoare triple {6443#(<= 0 (+ 2147483638 g_~x))} assume !(0 == ~x); {6443#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:02:52,652 INFO L290 TraceCheckUtils]: 69: Hoare triple {6456#(<= 0 (+ 2147483638 |g_#in~x|))} ~x := #in~x; {6443#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:02:52,653 INFO L272 TraceCheckUtils]: 68: Hoare triple {6460#(<= 0 (+ g_~x 2147483637))} call #t~ret0 := g(~x - 1); {6456#(<= 0 (+ 2147483638 |g_#in~x|))} is VALID [2022-02-21 03:02:52,653 INFO L290 TraceCheckUtils]: 67: Hoare triple {6460#(<= 0 (+ g_~x 2147483637))} assume ~x - 1 >= -2147483648; {6460#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:02:52,654 INFO L290 TraceCheckUtils]: 66: Hoare triple {6460#(<= 0 (+ g_~x 2147483637))} assume ~x - 1 <= 2147483647; {6460#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:02:52,654 INFO L290 TraceCheckUtils]: 65: Hoare triple {6460#(<= 0 (+ g_~x 2147483637))} assume !(0 == ~x); {6460#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:02:52,654 INFO L290 TraceCheckUtils]: 64: Hoare triple {6473#(<= 0 (+ |g_#in~x| 2147483637))} ~x := #in~x; {6460#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:02:52,655 INFO L272 TraceCheckUtils]: 63: Hoare triple {6477#(<= 0 (+ g_~x 2147483636))} call #t~ret0 := g(~x - 1); {6473#(<= 0 (+ |g_#in~x| 2147483637))} is VALID [2022-02-21 03:02:52,655 INFO L290 TraceCheckUtils]: 62: Hoare triple {6477#(<= 0 (+ g_~x 2147483636))} assume ~x - 1 >= -2147483648; {6477#(<= 0 (+ g_~x 2147483636))} is VALID [2022-02-21 03:02:52,655 INFO L290 TraceCheckUtils]: 61: Hoare triple {6477#(<= 0 (+ g_~x 2147483636))} assume ~x - 1 <= 2147483647; {6477#(<= 0 (+ g_~x 2147483636))} is VALID [2022-02-21 03:02:52,656 INFO L290 TraceCheckUtils]: 60: Hoare triple {6477#(<= 0 (+ g_~x 2147483636))} assume !(0 == ~x); {6477#(<= 0 (+ g_~x 2147483636))} is VALID [2022-02-21 03:02:52,656 INFO L290 TraceCheckUtils]: 59: Hoare triple {6490#(<= 0 (+ |g_#in~x| 2147483636))} ~x := #in~x; {6477#(<= 0 (+ g_~x 2147483636))} is VALID [2022-02-21 03:02:52,657 INFO L272 TraceCheckUtils]: 58: Hoare triple {6494#(<= 0 (+ g_~x 2147483635))} call #t~ret0 := g(~x - 1); {6490#(<= 0 (+ |g_#in~x| 2147483636))} is VALID [2022-02-21 03:02:52,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {6494#(<= 0 (+ g_~x 2147483635))} assume ~x - 1 >= -2147483648; {6494#(<= 0 (+ g_~x 2147483635))} is VALID [2022-02-21 03:02:52,657 INFO L290 TraceCheckUtils]: 56: Hoare triple {6494#(<= 0 (+ g_~x 2147483635))} assume ~x - 1 <= 2147483647; {6494#(<= 0 (+ g_~x 2147483635))} is VALID [2022-02-21 03:02:52,657 INFO L290 TraceCheckUtils]: 55: Hoare triple {6494#(<= 0 (+ g_~x 2147483635))} assume !(0 == ~x); {6494#(<= 0 (+ g_~x 2147483635))} is VALID [2022-02-21 03:02:52,658 INFO L290 TraceCheckUtils]: 54: Hoare triple {6507#(<= 0 (+ |g_#in~x| 2147483635))} ~x := #in~x; {6494#(<= 0 (+ g_~x 2147483635))} is VALID [2022-02-21 03:02:52,658 INFO L272 TraceCheckUtils]: 53: Hoare triple {6511#(<= 0 (+ g_~x 2147483634))} call #t~ret0 := g(~x - 1); {6507#(<= 0 (+ |g_#in~x| 2147483635))} is VALID [2022-02-21 03:02:52,659 INFO L290 TraceCheckUtils]: 52: Hoare triple {6511#(<= 0 (+ g_~x 2147483634))} assume ~x - 1 >= -2147483648; {6511#(<= 0 (+ g_~x 2147483634))} is VALID [2022-02-21 03:02:52,659 INFO L290 TraceCheckUtils]: 51: Hoare triple {6511#(<= 0 (+ g_~x 2147483634))} assume ~x - 1 <= 2147483647; {6511#(<= 0 (+ g_~x 2147483634))} is VALID [2022-02-21 03:02:52,659 INFO L290 TraceCheckUtils]: 50: Hoare triple {6511#(<= 0 (+ g_~x 2147483634))} assume !(0 == ~x); {6511#(<= 0 (+ g_~x 2147483634))} is VALID [2022-02-21 03:02:52,660 INFO L290 TraceCheckUtils]: 49: Hoare triple {6524#(<= 0 (+ |g_#in~x| 2147483634))} ~x := #in~x; {6511#(<= 0 (+ g_~x 2147483634))} is VALID [2022-02-21 03:02:52,660 INFO L272 TraceCheckUtils]: 48: Hoare triple {6528#(<= 0 (+ g_~x 2147483633))} call #t~ret0 := g(~x - 1); {6524#(<= 0 (+ |g_#in~x| 2147483634))} is VALID [2022-02-21 03:02:52,660 INFO L290 TraceCheckUtils]: 47: Hoare triple {6528#(<= 0 (+ g_~x 2147483633))} assume ~x - 1 >= -2147483648; {6528#(<= 0 (+ g_~x 2147483633))} is VALID [2022-02-21 03:02:52,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {6528#(<= 0 (+ g_~x 2147483633))} assume ~x - 1 <= 2147483647; {6528#(<= 0 (+ g_~x 2147483633))} is VALID [2022-02-21 03:02:52,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {6528#(<= 0 (+ g_~x 2147483633))} assume !(0 == ~x); {6528#(<= 0 (+ g_~x 2147483633))} is VALID [2022-02-21 03:02:52,661 INFO L290 TraceCheckUtils]: 44: Hoare triple {6541#(<= 0 (+ |g_#in~x| 2147483633))} ~x := #in~x; {6528#(<= 0 (+ g_~x 2147483633))} is VALID [2022-02-21 03:02:52,662 INFO L272 TraceCheckUtils]: 43: Hoare triple {6545#(<= 0 (+ 2147483632 g_~x))} call #t~ret0 := g(~x - 1); {6541#(<= 0 (+ |g_#in~x| 2147483633))} is VALID [2022-02-21 03:02:52,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {6545#(<= 0 (+ 2147483632 g_~x))} assume ~x - 1 >= -2147483648; {6545#(<= 0 (+ 2147483632 g_~x))} is VALID [2022-02-21 03:02:52,663 INFO L290 TraceCheckUtils]: 41: Hoare triple {6545#(<= 0 (+ 2147483632 g_~x))} assume ~x - 1 <= 2147483647; {6545#(<= 0 (+ 2147483632 g_~x))} is VALID [2022-02-21 03:02:52,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {6545#(<= 0 (+ 2147483632 g_~x))} assume !(0 == ~x); {6545#(<= 0 (+ 2147483632 g_~x))} is VALID [2022-02-21 03:02:52,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {6558#(<= 0 (+ 2147483632 |g_#in~x|))} ~x := #in~x; {6545#(<= 0 (+ 2147483632 g_~x))} is VALID [2022-02-21 03:02:52,664 INFO L272 TraceCheckUtils]: 38: Hoare triple {6562#(<= 0 (+ g_~x 2147483631))} call #t~ret0 := g(~x - 1); {6558#(<= 0 (+ 2147483632 |g_#in~x|))} is VALID [2022-02-21 03:02:52,664 INFO L290 TraceCheckUtils]: 37: Hoare triple {6562#(<= 0 (+ g_~x 2147483631))} assume ~x - 1 >= -2147483648; {6562#(<= 0 (+ g_~x 2147483631))} is VALID [2022-02-21 03:02:52,664 INFO L290 TraceCheckUtils]: 36: Hoare triple {6562#(<= 0 (+ g_~x 2147483631))} assume ~x - 1 <= 2147483647; {6562#(<= 0 (+ g_~x 2147483631))} is VALID [2022-02-21 03:02:52,665 INFO L290 TraceCheckUtils]: 35: Hoare triple {6562#(<= 0 (+ g_~x 2147483631))} assume !(0 == ~x); {6562#(<= 0 (+ g_~x 2147483631))} is VALID [2022-02-21 03:02:52,665 INFO L290 TraceCheckUtils]: 34: Hoare triple {6575#(<= 0 (+ |g_#in~x| 2147483631))} ~x := #in~x; {6562#(<= 0 (+ g_~x 2147483631))} is VALID [2022-02-21 03:02:52,666 INFO L272 TraceCheckUtils]: 33: Hoare triple {6579#(<= 0 (+ g_~x 2147483630))} call #t~ret0 := g(~x - 1); {6575#(<= 0 (+ |g_#in~x| 2147483631))} is VALID [2022-02-21 03:02:52,666 INFO L290 TraceCheckUtils]: 32: Hoare triple {6579#(<= 0 (+ g_~x 2147483630))} assume ~x - 1 >= -2147483648; {6579#(<= 0 (+ g_~x 2147483630))} is VALID [2022-02-21 03:02:52,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {6579#(<= 0 (+ g_~x 2147483630))} assume ~x - 1 <= 2147483647; {6579#(<= 0 (+ g_~x 2147483630))} is VALID [2022-02-21 03:02:52,666 INFO L290 TraceCheckUtils]: 30: Hoare triple {6579#(<= 0 (+ g_~x 2147483630))} assume !(0 == ~x); {6579#(<= 0 (+ g_~x 2147483630))} is VALID [2022-02-21 03:02:52,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {6592#(<= 0 (+ |g_#in~x| 2147483630))} ~x := #in~x; {6579#(<= 0 (+ g_~x 2147483630))} is VALID [2022-02-21 03:02:52,667 INFO L272 TraceCheckUtils]: 28: Hoare triple {6596#(<= 0 (+ g_~x 2147483629))} call #t~ret0 := g(~x - 1); {6592#(<= 0 (+ |g_#in~x| 2147483630))} is VALID [2022-02-21 03:02:52,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {6596#(<= 0 (+ g_~x 2147483629))} assume ~x - 1 >= -2147483648; {6596#(<= 0 (+ g_~x 2147483629))} is VALID [2022-02-21 03:02:52,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {6596#(<= 0 (+ g_~x 2147483629))} assume ~x - 1 <= 2147483647; {6596#(<= 0 (+ g_~x 2147483629))} is VALID [2022-02-21 03:02:52,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {6596#(<= 0 (+ g_~x 2147483629))} assume !(0 == ~x); {6596#(<= 0 (+ g_~x 2147483629))} is VALID [2022-02-21 03:02:52,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {6609#(<= 0 (+ |g_#in~x| 2147483629))} ~x := #in~x; {6596#(<= 0 (+ g_~x 2147483629))} is VALID [2022-02-21 03:02:52,669 INFO L272 TraceCheckUtils]: 23: Hoare triple {6613#(<= 0 (+ g_~x 2147483628))} call #t~ret0 := g(~x - 1); {6609#(<= 0 (+ |g_#in~x| 2147483629))} is VALID [2022-02-21 03:02:52,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {6613#(<= 0 (+ g_~x 2147483628))} assume ~x - 1 >= -2147483648; {6613#(<= 0 (+ g_~x 2147483628))} is VALID [2022-02-21 03:02:52,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {6613#(<= 0 (+ g_~x 2147483628))} assume ~x - 1 <= 2147483647; {6613#(<= 0 (+ g_~x 2147483628))} is VALID [2022-02-21 03:02:52,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {6613#(<= 0 (+ g_~x 2147483628))} assume !(0 == ~x); {6613#(<= 0 (+ g_~x 2147483628))} is VALID [2022-02-21 03:02:52,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {6626#(<= 0 (+ |g_#in~x| 2147483628))} ~x := #in~x; {6613#(<= 0 (+ g_~x 2147483628))} is VALID [2022-02-21 03:02:52,671 INFO L272 TraceCheckUtils]: 18: Hoare triple {6630#(<= 0 (+ g_~x 2147483627))} call #t~ret0 := g(~x - 1); {6626#(<= 0 (+ |g_#in~x| 2147483628))} is VALID [2022-02-21 03:02:52,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {6630#(<= 0 (+ g_~x 2147483627))} assume ~x - 1 >= -2147483648; {6630#(<= 0 (+ g_~x 2147483627))} is VALID [2022-02-21 03:02:52,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {6630#(<= 0 (+ g_~x 2147483627))} assume ~x - 1 <= 2147483647; {6630#(<= 0 (+ g_~x 2147483627))} is VALID [2022-02-21 03:02:52,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {6630#(<= 0 (+ g_~x 2147483627))} assume !(0 == ~x); {6630#(<= 0 (+ g_~x 2147483627))} is VALID [2022-02-21 03:02:52,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {6643#(<= 0 (+ |g_#in~x| 2147483627))} ~x := #in~x; {6630#(<= 0 (+ g_~x 2147483627))} is VALID [2022-02-21 03:02:52,673 INFO L272 TraceCheckUtils]: 13: Hoare triple {6647#(<= 0 (+ 2147483626 g_~x))} call #t~ret0 := g(~x - 1); {6643#(<= 0 (+ |g_#in~x| 2147483627))} is VALID [2022-02-21 03:02:52,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {6647#(<= 0 (+ 2147483626 g_~x))} assume ~x - 1 >= -2147483648; {6647#(<= 0 (+ 2147483626 g_~x))} is VALID [2022-02-21 03:02:52,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {6647#(<= 0 (+ 2147483626 g_~x))} assume ~x - 1 <= 2147483647; {6647#(<= 0 (+ 2147483626 g_~x))} is VALID [2022-02-21 03:02:52,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {6647#(<= 0 (+ 2147483626 g_~x))} assume !(0 == ~x); {6647#(<= 0 (+ 2147483626 g_~x))} is VALID [2022-02-21 03:02:52,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {6660#(<= 0 (+ 2147483626 |g_#in~x|))} ~x := #in~x; {6647#(<= 0 (+ 2147483626 g_~x))} is VALID [2022-02-21 03:02:52,674 INFO L272 TraceCheckUtils]: 8: Hoare triple {6664#(<= 0 (+ 2147483625 g_~x))} call #t~ret0 := g(~x - 1); {6660#(<= 0 (+ 2147483626 |g_#in~x|))} is VALID [2022-02-21 03:02:52,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {6664#(<= 0 (+ 2147483625 g_~x))} assume ~x - 1 >= -2147483648; {6664#(<= 0 (+ 2147483625 g_~x))} is VALID [2022-02-21 03:02:52,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {6664#(<= 0 (+ 2147483625 g_~x))} assume ~x - 1 <= 2147483647; {6664#(<= 0 (+ 2147483625 g_~x))} is VALID [2022-02-21 03:02:52,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {6664#(<= 0 (+ 2147483625 g_~x))} assume !(0 == ~x); {6664#(<= 0 (+ 2147483625 g_~x))} is VALID [2022-02-21 03:02:52,676 INFO L290 TraceCheckUtils]: 4: Hoare triple {6677#(<= 0 (+ 2147483625 |g_#in~x|))} ~x := #in~x; {6664#(<= 0 (+ 2147483625 g_~x))} is VALID [2022-02-21 03:02:52,676 INFO L272 TraceCheckUtils]: 3: Hoare triple {6681#(<= 0 (+ 2147483625 |ULTIMATE.start_main_~x~0#1|))} call main_#t~ret3#1 := g(main_~x~0#1); {6677#(<= 0 (+ 2147483625 |g_#in~x|))} is VALID [2022-02-21 03:02:52,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {5890#true} assume !(main_~x~0#1 < 0); {6681#(<= 0 (+ 2147483625 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:02:52,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {5890#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {5890#true} is VALID [2022-02-21 03:02:52,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {5890#true} assume { :begin_inline_ULTIMATE.init } true; {5890#true} is VALID [2022-02-21 03:02:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:52,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897951213] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:02:52,678 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:02:52,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2022-02-21 03:02:52,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479440098] [2022-02-21 03:02:52,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:02:52,680 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 93 states have (on average 2.021505376344086) internal successors, (188), 50 states have internal predecessors, (188), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-02-21 03:02:52,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:02:52,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 96 states, 93 states have (on average 2.021505376344086) internal successors, (188), 50 states have internal predecessors, (188), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:52,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:52,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-02-21 03:02:52,836 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:02:52,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-02-21 03:02:52,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2022-02-21 03:02:52,839 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand has 96 states, 93 states have (on average 2.021505376344086) internal successors, (188), 50 states have internal predecessors, (188), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:54,938 INFO L93 Difference]: Finished difference Result 241 states and 264 transitions. [2022-02-21 03:02:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-02-21 03:02:54,938 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 93 states have (on average 2.021505376344086) internal successors, (188), 50 states have internal predecessors, (188), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-02-21 03:02:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:02:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 93 states have (on average 2.021505376344086) internal successors, (188), 50 states have internal predecessors, (188), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 264 transitions. [2022-02-21 03:02:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 93 states have (on average 2.021505376344086) internal successors, (188), 50 states have internal predecessors, (188), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 264 transitions. [2022-02-21 03:02:54,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states and 264 transitions. [2022-02-21 03:02:55,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:02:55,109 INFO L225 Difference]: With dead ends: 241 [2022-02-21 03:02:55,109 INFO L226 Difference]: Without dead ends: 240 [2022-02-21 03:02:55,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=5549, Invalid=14473, Unknown=0, NotChecked=0, Total=20022 [2022-02-21 03:02:55,114 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 585 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:02:55,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 59 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:02:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-02-21 03:02:55,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2022-02-21 03:02:55,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:02:55,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 239 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:55,387 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 239 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:55,388 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 239 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:55,394 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2022-02-21 03:02:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2022-02-21 03:02:55,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:55,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:55,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 240 states. [2022-02-21 03:02:55,395 INFO L87 Difference]: Start difference. First operand has 239 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 240 states. [2022-02-21 03:02:55,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:02:55,399 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2022-02-21 03:02:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2022-02-21 03:02:55,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:02:55,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:02:55,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:02:55,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:02:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2022-02-21 03:02:55,404 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 118 [2022-02-21 03:02:55,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:02:55,405 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2022-02-21 03:02:55,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 93 states have (on average 2.021505376344086) internal successors, (188), 50 states have internal predecessors, (188), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:02:55,405 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2022-02-21 03:02:55,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-02-21 03:02:55,411 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:02:55,411 INFO L514 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1, 1, 1] [2022-02-21 03:02:55,430 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:02:55,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:55,628 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:02:55,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:02:55,628 INFO L85 PathProgramCache]: Analyzing trace with hash -827561134, now seen corresponding path program 5 times [2022-02-21 03:02:55,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:02:55,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276443828] [2022-02-21 03:02:55,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:02:55,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:02:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:58,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {7931#true} assume { :begin_inline_ULTIMATE.init } true; {7931#true} is VALID [2022-02-21 03:02:58,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {7931#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {7931#true} is VALID [2022-02-21 03:02:58,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {7931#true} assume !(main_~x~0#1 < 0); {7933#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:02:58,297 INFO L272 TraceCheckUtils]: 3: Hoare triple {7933#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {7934#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:02:58,298 INFO L290 TraceCheckUtils]: 4: Hoare triple {7934#(<= 0 |g_#in~x|)} ~x := #in~x; {7935#(<= 0 g_~x)} is VALID [2022-02-21 03:02:58,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {7935#(<= 0 g_~x)} assume !(0 == ~x); {7935#(<= 0 g_~x)} is VALID [2022-02-21 03:02:58,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {7935#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {7935#(<= 0 g_~x)} is VALID [2022-02-21 03:02:58,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {7935#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {7935#(<= 0 g_~x)} is VALID [2022-02-21 03:02:58,299 INFO L272 TraceCheckUtils]: 8: Hoare triple {7935#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {7936#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:02:58,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {7936#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {7937#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:58,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {7937#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {7937#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:58,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {7937#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {7937#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:58,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {7937#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {7937#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:02:58,301 INFO L272 TraceCheckUtils]: 13: Hoare triple {7937#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {7938#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:02:58,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {7938#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {7939#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:58,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {7939#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {7939#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:58,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {7939#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {7939#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:58,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {7939#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {7939#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:02:58,303 INFO L272 TraceCheckUtils]: 18: Hoare triple {7939#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {7940#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:02:58,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {7940#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {7941#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:58,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {7941#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {7941#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:58,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {7941#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {7941#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:58,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {7941#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {7941#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:02:58,305 INFO L272 TraceCheckUtils]: 23: Hoare triple {7941#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {7942#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:02:58,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {7942#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {7943#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:58,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {7943#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {7943#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:58,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {7943#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {7943#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:58,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {7943#(<= 0 (+ g_~x 4))} assume ~x - 1 >= -2147483648; {7943#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:02:58,306 INFO L272 TraceCheckUtils]: 28: Hoare triple {7943#(<= 0 (+ g_~x 4))} call #t~ret0 := g(~x - 1); {7944#(<= 0 (+ 5 |g_#in~x|))} is VALID [2022-02-21 03:02:58,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {7944#(<= 0 (+ 5 |g_#in~x|))} ~x := #in~x; {7945#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:58,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {7945#(<= 0 (+ 5 g_~x))} assume !(0 == ~x); {7945#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:58,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {7945#(<= 0 (+ 5 g_~x))} assume ~x - 1 <= 2147483647; {7945#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:58,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {7945#(<= 0 (+ 5 g_~x))} assume ~x - 1 >= -2147483648; {7945#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:02:58,308 INFO L272 TraceCheckUtils]: 33: Hoare triple {7945#(<= 0 (+ 5 g_~x))} call #t~ret0 := g(~x - 1); {7946#(<= 0 (+ |g_#in~x| 6))} is VALID [2022-02-21 03:02:58,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {7946#(<= 0 (+ |g_#in~x| 6))} ~x := #in~x; {7947#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:58,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {7947#(<= 0 (+ 6 g_~x))} assume !(0 == ~x); {7947#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:58,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {7947#(<= 0 (+ 6 g_~x))} assume ~x - 1 <= 2147483647; {7947#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:58,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {7947#(<= 0 (+ 6 g_~x))} assume ~x - 1 >= -2147483648; {7947#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:02:58,310 INFO L272 TraceCheckUtils]: 38: Hoare triple {7947#(<= 0 (+ 6 g_~x))} call #t~ret0 := g(~x - 1); {7948#(<= 0 (+ 7 |g_#in~x|))} is VALID [2022-02-21 03:02:58,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {7948#(<= 0 (+ 7 |g_#in~x|))} ~x := #in~x; {7949#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:58,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {7949#(<= 0 (+ 7 g_~x))} assume !(0 == ~x); {7949#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:58,311 INFO L290 TraceCheckUtils]: 41: Hoare triple {7949#(<= 0 (+ 7 g_~x))} assume ~x - 1 <= 2147483647; {7949#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:58,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {7949#(<= 0 (+ 7 g_~x))} assume ~x - 1 >= -2147483648; {7949#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:02:58,312 INFO L272 TraceCheckUtils]: 43: Hoare triple {7949#(<= 0 (+ 7 g_~x))} call #t~ret0 := g(~x - 1); {7950#(<= 0 (+ |g_#in~x| 8))} is VALID [2022-02-21 03:02:58,312 INFO L290 TraceCheckUtils]: 44: Hoare triple {7950#(<= 0 (+ |g_#in~x| 8))} ~x := #in~x; {7951#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:58,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {7951#(<= 0 (+ g_~x 8))} assume !(0 == ~x); {7951#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:58,313 INFO L290 TraceCheckUtils]: 46: Hoare triple {7951#(<= 0 (+ g_~x 8))} assume ~x - 1 <= 2147483647; {7951#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:58,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {7951#(<= 0 (+ g_~x 8))} assume ~x - 1 >= -2147483648; {7951#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:02:58,313 INFO L272 TraceCheckUtils]: 48: Hoare triple {7951#(<= 0 (+ g_~x 8))} call #t~ret0 := g(~x - 1); {7952#(<= 0 (+ |g_#in~x| 9))} is VALID [2022-02-21 03:02:58,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {7952#(<= 0 (+ |g_#in~x| 9))} ~x := #in~x; {7953#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:58,314 INFO L290 TraceCheckUtils]: 50: Hoare triple {7953#(<= 0 (+ 9 g_~x))} assume !(0 == ~x); {7953#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:58,314 INFO L290 TraceCheckUtils]: 51: Hoare triple {7953#(<= 0 (+ 9 g_~x))} assume ~x - 1 <= 2147483647; {7953#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:58,315 INFO L290 TraceCheckUtils]: 52: Hoare triple {7953#(<= 0 (+ 9 g_~x))} assume ~x - 1 >= -2147483648; {7953#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:02:58,315 INFO L272 TraceCheckUtils]: 53: Hoare triple {7953#(<= 0 (+ 9 g_~x))} call #t~ret0 := g(~x - 1); {7954#(<= 0 (+ |g_#in~x| 10))} is VALID [2022-02-21 03:02:58,315 INFO L290 TraceCheckUtils]: 54: Hoare triple {7954#(<= 0 (+ |g_#in~x| 10))} ~x := #in~x; {7955#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:58,316 INFO L290 TraceCheckUtils]: 55: Hoare triple {7955#(<= 0 (+ g_~x 10))} assume !(0 == ~x); {7955#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:58,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {7955#(<= 0 (+ g_~x 10))} assume ~x - 1 <= 2147483647; {7955#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:58,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {7955#(<= 0 (+ g_~x 10))} assume ~x - 1 >= -2147483648; {7955#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:02:58,317 INFO L272 TraceCheckUtils]: 58: Hoare triple {7955#(<= 0 (+ g_~x 10))} call #t~ret0 := g(~x - 1); {7956#(<= 0 (+ |g_#in~x| 11))} is VALID [2022-02-21 03:02:58,317 INFO L290 TraceCheckUtils]: 59: Hoare triple {7956#(<= 0 (+ |g_#in~x| 11))} ~x := #in~x; {7957#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:02:58,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {7957#(<= 0 (+ g_~x 11))} assume !(0 == ~x); {7957#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:02:58,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {7957#(<= 0 (+ g_~x 11))} assume ~x - 1 <= 2147483647; {7957#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:02:58,318 INFO L290 TraceCheckUtils]: 62: Hoare triple {7957#(<= 0 (+ g_~x 11))} assume ~x - 1 >= -2147483648; {7957#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:02:58,318 INFO L272 TraceCheckUtils]: 63: Hoare triple {7957#(<= 0 (+ g_~x 11))} call #t~ret0 := g(~x - 1); {7958#(<= 0 (+ |g_#in~x| 12))} is VALID [2022-02-21 03:02:58,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {7958#(<= 0 (+ |g_#in~x| 12))} ~x := #in~x; {7959#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:02:58,319 INFO L290 TraceCheckUtils]: 65: Hoare triple {7959#(<= 0 (+ g_~x 12))} assume !(0 == ~x); {7959#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:02:58,319 INFO L290 TraceCheckUtils]: 66: Hoare triple {7959#(<= 0 (+ g_~x 12))} assume ~x - 1 <= 2147483647; {7959#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:02:58,319 INFO L290 TraceCheckUtils]: 67: Hoare triple {7959#(<= 0 (+ g_~x 12))} assume ~x - 1 >= -2147483648; {7959#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:02:58,320 INFO L272 TraceCheckUtils]: 68: Hoare triple {7959#(<= 0 (+ g_~x 12))} call #t~ret0 := g(~x - 1); {7960#(<= 0 (+ |g_#in~x| 13))} is VALID [2022-02-21 03:02:58,320 INFO L290 TraceCheckUtils]: 69: Hoare triple {7960#(<= 0 (+ |g_#in~x| 13))} ~x := #in~x; {7961#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:02:58,320 INFO L290 TraceCheckUtils]: 70: Hoare triple {7961#(<= 0 (+ g_~x 13))} assume !(0 == ~x); {7961#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:02:58,321 INFO L290 TraceCheckUtils]: 71: Hoare triple {7961#(<= 0 (+ g_~x 13))} assume ~x - 1 <= 2147483647; {7961#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:02:58,321 INFO L290 TraceCheckUtils]: 72: Hoare triple {7961#(<= 0 (+ g_~x 13))} assume ~x - 1 >= -2147483648; {7961#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:02:58,322 INFO L272 TraceCheckUtils]: 73: Hoare triple {7961#(<= 0 (+ g_~x 13))} call #t~ret0 := g(~x - 1); {7962#(<= 0 (+ |g_#in~x| 14))} is VALID [2022-02-21 03:02:58,323 INFO L290 TraceCheckUtils]: 74: Hoare triple {7962#(<= 0 (+ |g_#in~x| 14))} ~x := #in~x; {7963#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:02:58,323 INFO L290 TraceCheckUtils]: 75: Hoare triple {7963#(<= 0 (+ 14 g_~x))} assume !(0 == ~x); {7963#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:02:58,323 INFO L290 TraceCheckUtils]: 76: Hoare triple {7963#(<= 0 (+ 14 g_~x))} assume ~x - 1 <= 2147483647; {7963#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:02:58,324 INFO L290 TraceCheckUtils]: 77: Hoare triple {7963#(<= 0 (+ 14 g_~x))} assume ~x - 1 >= -2147483648; {7963#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:02:58,324 INFO L272 TraceCheckUtils]: 78: Hoare triple {7963#(<= 0 (+ 14 g_~x))} call #t~ret0 := g(~x - 1); {7964#(<= 0 (+ |g_#in~x| 15))} is VALID [2022-02-21 03:02:58,324 INFO L290 TraceCheckUtils]: 79: Hoare triple {7964#(<= 0 (+ |g_#in~x| 15))} ~x := #in~x; {7965#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:02:58,325 INFO L290 TraceCheckUtils]: 80: Hoare triple {7965#(<= 0 (+ g_~x 15))} assume !(0 == ~x); {7965#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:02:58,325 INFO L290 TraceCheckUtils]: 81: Hoare triple {7965#(<= 0 (+ g_~x 15))} assume ~x - 1 <= 2147483647; {7965#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:02:58,325 INFO L290 TraceCheckUtils]: 82: Hoare triple {7965#(<= 0 (+ g_~x 15))} assume ~x - 1 >= -2147483648; {7965#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:02:58,326 INFO L272 TraceCheckUtils]: 83: Hoare triple {7965#(<= 0 (+ g_~x 15))} call #t~ret0 := g(~x - 1); {7966#(<= 0 (+ |g_#in~x| 16))} is VALID [2022-02-21 03:02:58,326 INFO L290 TraceCheckUtils]: 84: Hoare triple {7966#(<= 0 (+ |g_#in~x| 16))} ~x := #in~x; {7967#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:02:58,326 INFO L290 TraceCheckUtils]: 85: Hoare triple {7967#(<= 0 (+ 16 g_~x))} assume !(0 == ~x); {7967#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:02:58,326 INFO L290 TraceCheckUtils]: 86: Hoare triple {7967#(<= 0 (+ 16 g_~x))} assume ~x - 1 <= 2147483647; {7967#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:02:58,327 INFO L290 TraceCheckUtils]: 87: Hoare triple {7967#(<= 0 (+ 16 g_~x))} assume ~x - 1 >= -2147483648; {7967#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:02:58,327 INFO L272 TraceCheckUtils]: 88: Hoare triple {7967#(<= 0 (+ 16 g_~x))} call #t~ret0 := g(~x - 1); {7968#(<= 0 (+ |g_#in~x| 17))} is VALID [2022-02-21 03:02:58,327 INFO L290 TraceCheckUtils]: 89: Hoare triple {7968#(<= 0 (+ |g_#in~x| 17))} ~x := #in~x; {7969#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:02:58,328 INFO L290 TraceCheckUtils]: 90: Hoare triple {7969#(<= 0 (+ g_~x 17))} assume !(0 == ~x); {7969#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:02:58,328 INFO L290 TraceCheckUtils]: 91: Hoare triple {7969#(<= 0 (+ g_~x 17))} assume ~x - 1 <= 2147483647; {7969#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:02:58,328 INFO L290 TraceCheckUtils]: 92: Hoare triple {7969#(<= 0 (+ g_~x 17))} assume ~x - 1 >= -2147483648; {7969#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:02:58,329 INFO L272 TraceCheckUtils]: 93: Hoare triple {7969#(<= 0 (+ g_~x 17))} call #t~ret0 := g(~x - 1); {7970#(<= 0 (+ |g_#in~x| 18))} is VALID [2022-02-21 03:02:58,329 INFO L290 TraceCheckUtils]: 94: Hoare triple {7970#(<= 0 (+ |g_#in~x| 18))} ~x := #in~x; {7971#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:02:58,329 INFO L290 TraceCheckUtils]: 95: Hoare triple {7971#(<= 0 (+ g_~x 18))} assume !(0 == ~x); {7971#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:02:58,330 INFO L290 TraceCheckUtils]: 96: Hoare triple {7971#(<= 0 (+ g_~x 18))} assume ~x - 1 <= 2147483647; {7971#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:02:58,330 INFO L290 TraceCheckUtils]: 97: Hoare triple {7971#(<= 0 (+ g_~x 18))} assume ~x - 1 >= -2147483648; {7971#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:02:58,330 INFO L272 TraceCheckUtils]: 98: Hoare triple {7971#(<= 0 (+ g_~x 18))} call #t~ret0 := g(~x - 1); {7972#(<= 0 (+ 19 |g_#in~x|))} is VALID [2022-02-21 03:02:58,330 INFO L290 TraceCheckUtils]: 99: Hoare triple {7972#(<= 0 (+ 19 |g_#in~x|))} ~x := #in~x; {7973#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:02:58,331 INFO L290 TraceCheckUtils]: 100: Hoare triple {7973#(<= 0 (+ 19 g_~x))} assume !(0 == ~x); {7973#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:02:58,331 INFO L290 TraceCheckUtils]: 101: Hoare triple {7973#(<= 0 (+ 19 g_~x))} assume ~x - 1 <= 2147483647; {7973#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:02:58,331 INFO L290 TraceCheckUtils]: 102: Hoare triple {7973#(<= 0 (+ 19 g_~x))} assume ~x - 1 >= -2147483648; {7973#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:02:58,333 INFO L272 TraceCheckUtils]: 103: Hoare triple {7973#(<= 0 (+ 19 g_~x))} call #t~ret0 := g(~x - 1); {7974#(<= 0 (+ |g_#in~x| 20))} is VALID [2022-02-21 03:02:58,334 INFO L290 TraceCheckUtils]: 104: Hoare triple {7974#(<= 0 (+ |g_#in~x| 20))} ~x := #in~x; {7975#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:02:58,334 INFO L290 TraceCheckUtils]: 105: Hoare triple {7975#(<= 0 (+ g_~x 20))} assume !(0 == ~x); {7975#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:02:58,334 INFO L290 TraceCheckUtils]: 106: Hoare triple {7975#(<= 0 (+ g_~x 20))} assume ~x - 1 <= 2147483647; {7975#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:02:58,334 INFO L290 TraceCheckUtils]: 107: Hoare triple {7975#(<= 0 (+ g_~x 20))} assume ~x - 1 >= -2147483648; {7975#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:02:58,335 INFO L272 TraceCheckUtils]: 108: Hoare triple {7975#(<= 0 (+ g_~x 20))} call #t~ret0 := g(~x - 1); {7976#(<= 0 (+ |g_#in~x| 21))} is VALID [2022-02-21 03:02:58,335 INFO L290 TraceCheckUtils]: 109: Hoare triple {7976#(<= 0 (+ |g_#in~x| 21))} ~x := #in~x; {7977#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:02:58,335 INFO L290 TraceCheckUtils]: 110: Hoare triple {7977#(<= 0 (+ 21 g_~x))} assume !(0 == ~x); {7977#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:02:58,336 INFO L290 TraceCheckUtils]: 111: Hoare triple {7977#(<= 0 (+ 21 g_~x))} assume ~x - 1 <= 2147483647; {7977#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:02:58,336 INFO L290 TraceCheckUtils]: 112: Hoare triple {7977#(<= 0 (+ 21 g_~x))} assume ~x - 1 >= -2147483648; {7977#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:02:58,336 INFO L272 TraceCheckUtils]: 113: Hoare triple {7977#(<= 0 (+ 21 g_~x))} call #t~ret0 := g(~x - 1); {7978#(<= 0 (+ |g_#in~x| 22))} is VALID [2022-02-21 03:02:58,337 INFO L290 TraceCheckUtils]: 114: Hoare triple {7978#(<= 0 (+ |g_#in~x| 22))} ~x := #in~x; {7979#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:02:58,337 INFO L290 TraceCheckUtils]: 115: Hoare triple {7979#(<= 0 (+ 22 g_~x))} assume !(0 == ~x); {7979#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:02:58,337 INFO L290 TraceCheckUtils]: 116: Hoare triple {7979#(<= 0 (+ 22 g_~x))} assume ~x - 1 <= 2147483647; {7979#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:02:58,337 INFO L290 TraceCheckUtils]: 117: Hoare triple {7979#(<= 0 (+ 22 g_~x))} assume ~x - 1 >= -2147483648; {7979#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:02:58,338 INFO L272 TraceCheckUtils]: 118: Hoare triple {7979#(<= 0 (+ 22 g_~x))} call #t~ret0 := g(~x - 1); {7980#(<= 0 (+ 23 |g_#in~x|))} is VALID [2022-02-21 03:02:58,338 INFO L290 TraceCheckUtils]: 119: Hoare triple {7980#(<= 0 (+ 23 |g_#in~x|))} ~x := #in~x; {7981#(<= 0 (+ 23 g_~x))} is VALID [2022-02-21 03:02:58,338 INFO L290 TraceCheckUtils]: 120: Hoare triple {7981#(<= 0 (+ 23 g_~x))} assume !(0 == ~x); {7981#(<= 0 (+ 23 g_~x))} is VALID [2022-02-21 03:02:58,339 INFO L290 TraceCheckUtils]: 121: Hoare triple {7981#(<= 0 (+ 23 g_~x))} assume ~x - 1 <= 2147483647; {7981#(<= 0 (+ 23 g_~x))} is VALID [2022-02-21 03:02:58,339 INFO L290 TraceCheckUtils]: 122: Hoare triple {7981#(<= 0 (+ 23 g_~x))} assume ~x - 1 >= -2147483648; {7981#(<= 0 (+ 23 g_~x))} is VALID [2022-02-21 03:02:58,339 INFO L272 TraceCheckUtils]: 123: Hoare triple {7981#(<= 0 (+ 23 g_~x))} call #t~ret0 := g(~x - 1); {7982#(<= 0 (+ |g_#in~x| 24))} is VALID [2022-02-21 03:02:58,340 INFO L290 TraceCheckUtils]: 124: Hoare triple {7982#(<= 0 (+ |g_#in~x| 24))} ~x := #in~x; {7983#(<= 0 (+ g_~x 24))} is VALID [2022-02-21 03:02:58,340 INFO L290 TraceCheckUtils]: 125: Hoare triple {7983#(<= 0 (+ g_~x 24))} assume !(0 == ~x); {7983#(<= 0 (+ g_~x 24))} is VALID [2022-02-21 03:02:58,340 INFO L290 TraceCheckUtils]: 126: Hoare triple {7983#(<= 0 (+ g_~x 24))} assume ~x - 1 <= 2147483647; {7983#(<= 0 (+ g_~x 24))} is VALID [2022-02-21 03:02:58,340 INFO L290 TraceCheckUtils]: 127: Hoare triple {7983#(<= 0 (+ g_~x 24))} assume ~x - 1 >= -2147483648; {7983#(<= 0 (+ g_~x 24))} is VALID [2022-02-21 03:02:58,341 INFO L272 TraceCheckUtils]: 128: Hoare triple {7983#(<= 0 (+ g_~x 24))} call #t~ret0 := g(~x - 1); {7984#(<= 0 (+ |g_#in~x| 25))} is VALID [2022-02-21 03:02:58,341 INFO L290 TraceCheckUtils]: 129: Hoare triple {7984#(<= 0 (+ |g_#in~x| 25))} ~x := #in~x; {7985#(<= 0 (+ g_~x 25))} is VALID [2022-02-21 03:02:58,341 INFO L290 TraceCheckUtils]: 130: Hoare triple {7985#(<= 0 (+ g_~x 25))} assume !(0 == ~x); {7985#(<= 0 (+ g_~x 25))} is VALID [2022-02-21 03:02:58,341 INFO L290 TraceCheckUtils]: 131: Hoare triple {7985#(<= 0 (+ g_~x 25))} assume ~x - 1 <= 2147483647; {7985#(<= 0 (+ g_~x 25))} is VALID [2022-02-21 03:02:58,342 INFO L290 TraceCheckUtils]: 132: Hoare triple {7985#(<= 0 (+ g_~x 25))} assume ~x - 1 >= -2147483648; {7985#(<= 0 (+ g_~x 25))} is VALID [2022-02-21 03:02:58,342 INFO L272 TraceCheckUtils]: 133: Hoare triple {7985#(<= 0 (+ g_~x 25))} call #t~ret0 := g(~x - 1); {7986#(<= 0 (+ |g_#in~x| 26))} is VALID [2022-02-21 03:02:58,342 INFO L290 TraceCheckUtils]: 134: Hoare triple {7986#(<= 0 (+ |g_#in~x| 26))} ~x := #in~x; {7987#(<= 0 (+ g_~x 26))} is VALID [2022-02-21 03:02:58,343 INFO L290 TraceCheckUtils]: 135: Hoare triple {7987#(<= 0 (+ g_~x 26))} assume !(0 == ~x); {7987#(<= 0 (+ g_~x 26))} is VALID [2022-02-21 03:02:58,343 INFO L290 TraceCheckUtils]: 136: Hoare triple {7987#(<= 0 (+ g_~x 26))} assume ~x - 1 <= 2147483647; {7987#(<= 0 (+ g_~x 26))} is VALID [2022-02-21 03:02:58,343 INFO L290 TraceCheckUtils]: 137: Hoare triple {7987#(<= 0 (+ g_~x 26))} assume ~x - 1 >= -2147483648; {7987#(<= 0 (+ g_~x 26))} is VALID [2022-02-21 03:02:58,344 INFO L272 TraceCheckUtils]: 138: Hoare triple {7987#(<= 0 (+ g_~x 26))} call #t~ret0 := g(~x - 1); {7988#(<= 0 (+ |g_#in~x| 27))} is VALID [2022-02-21 03:02:58,344 INFO L290 TraceCheckUtils]: 139: Hoare triple {7988#(<= 0 (+ |g_#in~x| 27))} ~x := #in~x; {7989#(<= 0 (+ g_~x 27))} is VALID [2022-02-21 03:02:58,344 INFO L290 TraceCheckUtils]: 140: Hoare triple {7989#(<= 0 (+ g_~x 27))} assume !(0 == ~x); {7989#(<= 0 (+ g_~x 27))} is VALID [2022-02-21 03:02:58,344 INFO L290 TraceCheckUtils]: 141: Hoare triple {7989#(<= 0 (+ g_~x 27))} assume ~x - 1 <= 2147483647; {7989#(<= 0 (+ g_~x 27))} is VALID [2022-02-21 03:02:58,345 INFO L290 TraceCheckUtils]: 142: Hoare triple {7989#(<= 0 (+ g_~x 27))} assume ~x - 1 >= -2147483648; {7989#(<= 0 (+ g_~x 27))} is VALID [2022-02-21 03:02:58,345 INFO L272 TraceCheckUtils]: 143: Hoare triple {7989#(<= 0 (+ g_~x 27))} call #t~ret0 := g(~x - 1); {7990#(<= 0 (+ |g_#in~x| 28))} is VALID [2022-02-21 03:02:58,345 INFO L290 TraceCheckUtils]: 144: Hoare triple {7990#(<= 0 (+ |g_#in~x| 28))} ~x := #in~x; {7991#(<= 0 (+ g_~x 28))} is VALID [2022-02-21 03:02:58,346 INFO L290 TraceCheckUtils]: 145: Hoare triple {7991#(<= 0 (+ g_~x 28))} assume !(0 == ~x); {7991#(<= 0 (+ g_~x 28))} is VALID [2022-02-21 03:02:58,346 INFO L290 TraceCheckUtils]: 146: Hoare triple {7991#(<= 0 (+ g_~x 28))} assume ~x - 1 <= 2147483647; {7991#(<= 0 (+ g_~x 28))} is VALID [2022-02-21 03:02:58,346 INFO L290 TraceCheckUtils]: 147: Hoare triple {7991#(<= 0 (+ g_~x 28))} assume ~x - 1 >= -2147483648; {7991#(<= 0 (+ g_~x 28))} is VALID [2022-02-21 03:02:58,347 INFO L272 TraceCheckUtils]: 148: Hoare triple {7991#(<= 0 (+ g_~x 28))} call #t~ret0 := g(~x - 1); {7992#(<= 0 (+ 29 |g_#in~x|))} is VALID [2022-02-21 03:02:58,347 INFO L290 TraceCheckUtils]: 149: Hoare triple {7992#(<= 0 (+ 29 |g_#in~x|))} ~x := #in~x; {7993#(<= 0 (+ 29 g_~x))} is VALID [2022-02-21 03:02:58,347 INFO L290 TraceCheckUtils]: 150: Hoare triple {7993#(<= 0 (+ 29 g_~x))} assume !(0 == ~x); {7993#(<= 0 (+ 29 g_~x))} is VALID [2022-02-21 03:02:58,347 INFO L290 TraceCheckUtils]: 151: Hoare triple {7993#(<= 0 (+ 29 g_~x))} assume ~x - 1 <= 2147483647; {7993#(<= 0 (+ 29 g_~x))} is VALID [2022-02-21 03:02:58,348 INFO L290 TraceCheckUtils]: 152: Hoare triple {7993#(<= 0 (+ 29 g_~x))} assume ~x - 1 >= -2147483648; {7993#(<= 0 (+ 29 g_~x))} is VALID [2022-02-21 03:02:58,348 INFO L272 TraceCheckUtils]: 153: Hoare triple {7993#(<= 0 (+ 29 g_~x))} call #t~ret0 := g(~x - 1); {7994#(<= 0 (+ 30 |g_#in~x|))} is VALID [2022-02-21 03:02:58,348 INFO L290 TraceCheckUtils]: 154: Hoare triple {7994#(<= 0 (+ 30 |g_#in~x|))} ~x := #in~x; {7995#(<= 0 (+ 30 g_~x))} is VALID [2022-02-21 03:02:58,349 INFO L290 TraceCheckUtils]: 155: Hoare triple {7995#(<= 0 (+ 30 g_~x))} assume !(0 == ~x); {7995#(<= 0 (+ 30 g_~x))} is VALID [2022-02-21 03:02:58,349 INFO L290 TraceCheckUtils]: 156: Hoare triple {7995#(<= 0 (+ 30 g_~x))} assume ~x - 1 <= 2147483647; {7995#(<= 0 (+ 30 g_~x))} is VALID [2022-02-21 03:02:58,349 INFO L290 TraceCheckUtils]: 157: Hoare triple {7995#(<= 0 (+ 30 g_~x))} assume ~x - 1 >= -2147483648; {7995#(<= 0 (+ 30 g_~x))} is VALID [2022-02-21 03:02:58,350 INFO L272 TraceCheckUtils]: 158: Hoare triple {7995#(<= 0 (+ 30 g_~x))} call #t~ret0 := g(~x - 1); {7996#(<= 0 (+ |g_#in~x| 31))} is VALID [2022-02-21 03:02:58,350 INFO L290 TraceCheckUtils]: 159: Hoare triple {7996#(<= 0 (+ |g_#in~x| 31))} ~x := #in~x; {7997#(<= 0 (+ g_~x 31))} is VALID [2022-02-21 03:02:58,350 INFO L290 TraceCheckUtils]: 160: Hoare triple {7997#(<= 0 (+ g_~x 31))} assume !(0 == ~x); {7997#(<= 0 (+ g_~x 31))} is VALID [2022-02-21 03:02:58,350 INFO L290 TraceCheckUtils]: 161: Hoare triple {7997#(<= 0 (+ g_~x 31))} assume ~x - 1 <= 2147483647; {7997#(<= 0 (+ g_~x 31))} is VALID [2022-02-21 03:02:58,351 INFO L290 TraceCheckUtils]: 162: Hoare triple {7997#(<= 0 (+ g_~x 31))} assume ~x - 1 >= -2147483648; {7997#(<= 0 (+ g_~x 31))} is VALID [2022-02-21 03:02:58,351 INFO L272 TraceCheckUtils]: 163: Hoare triple {7997#(<= 0 (+ g_~x 31))} call #t~ret0 := g(~x - 1); {7998#(<= 0 (+ 32 |g_#in~x|))} is VALID [2022-02-21 03:02:58,351 INFO L290 TraceCheckUtils]: 164: Hoare triple {7998#(<= 0 (+ 32 |g_#in~x|))} ~x := #in~x; {7999#(<= 0 (+ 32 g_~x))} is VALID [2022-02-21 03:02:58,352 INFO L290 TraceCheckUtils]: 165: Hoare triple {7999#(<= 0 (+ 32 g_~x))} assume !(0 == ~x); {7999#(<= 0 (+ 32 g_~x))} is VALID [2022-02-21 03:02:58,357 INFO L290 TraceCheckUtils]: 166: Hoare triple {7999#(<= 0 (+ 32 g_~x))} assume ~x - 1 <= 2147483647; {7999#(<= 0 (+ 32 g_~x))} is VALID [2022-02-21 03:02:58,358 INFO L290 TraceCheckUtils]: 167: Hoare triple {7999#(<= 0 (+ 32 g_~x))} assume ~x - 1 >= -2147483648; {7999#(<= 0 (+ 32 g_~x))} is VALID [2022-02-21 03:02:58,359 INFO L272 TraceCheckUtils]: 168: Hoare triple {7999#(<= 0 (+ 32 g_~x))} call #t~ret0 := g(~x - 1); {8000#(<= 0 (+ |g_#in~x| 33))} is VALID [2022-02-21 03:02:58,359 INFO L290 TraceCheckUtils]: 169: Hoare triple {8000#(<= 0 (+ |g_#in~x| 33))} ~x := #in~x; {8001#(<= 0 (+ g_~x 33))} is VALID [2022-02-21 03:02:58,359 INFO L290 TraceCheckUtils]: 170: Hoare triple {8001#(<= 0 (+ g_~x 33))} assume !(0 == ~x); {8001#(<= 0 (+ g_~x 33))} is VALID [2022-02-21 03:02:58,360 INFO L290 TraceCheckUtils]: 171: Hoare triple {8001#(<= 0 (+ g_~x 33))} assume ~x - 1 <= 2147483647; {8001#(<= 0 (+ g_~x 33))} is VALID [2022-02-21 03:02:58,360 INFO L290 TraceCheckUtils]: 172: Hoare triple {8001#(<= 0 (+ g_~x 33))} assume ~x - 1 >= -2147483648; {8001#(<= 0 (+ g_~x 33))} is VALID [2022-02-21 03:02:58,361 INFO L272 TraceCheckUtils]: 173: Hoare triple {8001#(<= 0 (+ g_~x 33))} call #t~ret0 := g(~x - 1); {8002#(<= 0 (+ |g_#in~x| 34))} is VALID [2022-02-21 03:02:58,361 INFO L290 TraceCheckUtils]: 174: Hoare triple {8002#(<= 0 (+ |g_#in~x| 34))} ~x := #in~x; {8003#(<= 0 (+ g_~x 34))} is VALID [2022-02-21 03:02:58,361 INFO L290 TraceCheckUtils]: 175: Hoare triple {8003#(<= 0 (+ g_~x 34))} assume !(0 == ~x); {8003#(<= 0 (+ g_~x 34))} is VALID [2022-02-21 03:02:58,362 INFO L290 TraceCheckUtils]: 176: Hoare triple {8003#(<= 0 (+ g_~x 34))} assume ~x - 1 <= 2147483647; {8003#(<= 0 (+ g_~x 34))} is VALID [2022-02-21 03:02:58,362 INFO L290 TraceCheckUtils]: 177: Hoare triple {8003#(<= 0 (+ g_~x 34))} assume ~x - 1 >= -2147483648; {8003#(<= 0 (+ g_~x 34))} is VALID [2022-02-21 03:02:58,363 INFO L272 TraceCheckUtils]: 178: Hoare triple {8003#(<= 0 (+ g_~x 34))} call #t~ret0 := g(~x - 1); {8004#(<= 0 (+ 35 |g_#in~x|))} is VALID [2022-02-21 03:02:58,363 INFO L290 TraceCheckUtils]: 179: Hoare triple {8004#(<= 0 (+ 35 |g_#in~x|))} ~x := #in~x; {8005#(<= 0 (+ 35 g_~x))} is VALID [2022-02-21 03:02:58,364 INFO L290 TraceCheckUtils]: 180: Hoare triple {8005#(<= 0 (+ 35 g_~x))} assume !(0 == ~x); {8005#(<= 0 (+ 35 g_~x))} is VALID [2022-02-21 03:02:58,364 INFO L290 TraceCheckUtils]: 181: Hoare triple {8005#(<= 0 (+ 35 g_~x))} assume ~x - 1 <= 2147483647; {8005#(<= 0 (+ 35 g_~x))} is VALID [2022-02-21 03:02:58,364 INFO L290 TraceCheckUtils]: 182: Hoare triple {8005#(<= 0 (+ 35 g_~x))} assume ~x - 1 >= -2147483648; {8005#(<= 0 (+ 35 g_~x))} is VALID [2022-02-21 03:02:58,365 INFO L272 TraceCheckUtils]: 183: Hoare triple {8005#(<= 0 (+ 35 g_~x))} call #t~ret0 := g(~x - 1); {8006#(<= 0 (+ |g_#in~x| 36))} is VALID [2022-02-21 03:02:58,365 INFO L290 TraceCheckUtils]: 184: Hoare triple {8006#(<= 0 (+ |g_#in~x| 36))} ~x := #in~x; {8007#(<= 0 (+ g_~x 36))} is VALID [2022-02-21 03:02:58,366 INFO L290 TraceCheckUtils]: 185: Hoare triple {8007#(<= 0 (+ g_~x 36))} assume !(0 == ~x); {8007#(<= 0 (+ g_~x 36))} is VALID [2022-02-21 03:02:58,366 INFO L290 TraceCheckUtils]: 186: Hoare triple {8007#(<= 0 (+ g_~x 36))} assume ~x - 1 <= 2147483647; {8007#(<= 0 (+ g_~x 36))} is VALID [2022-02-21 03:02:58,366 INFO L290 TraceCheckUtils]: 187: Hoare triple {8007#(<= 0 (+ g_~x 36))} assume ~x - 1 >= -2147483648; {8007#(<= 0 (+ g_~x 36))} is VALID [2022-02-21 03:02:58,367 INFO L272 TraceCheckUtils]: 188: Hoare triple {8007#(<= 0 (+ g_~x 36))} call #t~ret0 := g(~x - 1); {8008#(<= 0 (+ |g_#in~x| 37))} is VALID [2022-02-21 03:02:58,367 INFO L290 TraceCheckUtils]: 189: Hoare triple {8008#(<= 0 (+ |g_#in~x| 37))} ~x := #in~x; {8009#(<= 0 (+ g_~x 37))} is VALID [2022-02-21 03:02:58,368 INFO L290 TraceCheckUtils]: 190: Hoare triple {8009#(<= 0 (+ g_~x 37))} assume !(0 == ~x); {8009#(<= 0 (+ g_~x 37))} is VALID [2022-02-21 03:02:58,368 INFO L290 TraceCheckUtils]: 191: Hoare triple {8009#(<= 0 (+ g_~x 37))} assume ~x - 1 <= 2147483647; {8009#(<= 0 (+ g_~x 37))} is VALID [2022-02-21 03:02:58,369 INFO L290 TraceCheckUtils]: 192: Hoare triple {8009#(<= 0 (+ g_~x 37))} assume ~x - 1 >= -2147483648; {8009#(<= 0 (+ g_~x 37))} is VALID [2022-02-21 03:02:58,369 INFO L272 TraceCheckUtils]: 193: Hoare triple {8009#(<= 0 (+ g_~x 37))} call #t~ret0 := g(~x - 1); {8010#(<= 0 (+ |g_#in~x| 38))} is VALID [2022-02-21 03:02:58,370 INFO L290 TraceCheckUtils]: 194: Hoare triple {8010#(<= 0 (+ |g_#in~x| 38))} ~x := #in~x; {8011#(<= 0 (+ g_~x 38))} is VALID [2022-02-21 03:02:58,370 INFO L290 TraceCheckUtils]: 195: Hoare triple {8011#(<= 0 (+ g_~x 38))} assume !(0 == ~x); {8011#(<= 0 (+ g_~x 38))} is VALID [2022-02-21 03:02:58,370 INFO L290 TraceCheckUtils]: 196: Hoare triple {8011#(<= 0 (+ g_~x 38))} assume ~x - 1 <= 2147483647; {8011#(<= 0 (+ g_~x 38))} is VALID [2022-02-21 03:02:58,371 INFO L290 TraceCheckUtils]: 197: Hoare triple {8011#(<= 0 (+ g_~x 38))} assume ~x - 1 >= -2147483648; {8011#(<= 0 (+ g_~x 38))} is VALID [2022-02-21 03:02:58,371 INFO L272 TraceCheckUtils]: 198: Hoare triple {8011#(<= 0 (+ g_~x 38))} call #t~ret0 := g(~x - 1); {8012#(<= 0 (+ |g_#in~x| 39))} is VALID [2022-02-21 03:02:58,372 INFO L290 TraceCheckUtils]: 199: Hoare triple {8012#(<= 0 (+ |g_#in~x| 39))} ~x := #in~x; {8013#(<= 0 (+ g_~x 39))} is VALID [2022-02-21 03:02:58,372 INFO L290 TraceCheckUtils]: 200: Hoare triple {8013#(<= 0 (+ g_~x 39))} assume !(0 == ~x); {8013#(<= 0 (+ g_~x 39))} is VALID [2022-02-21 03:02:58,372 INFO L290 TraceCheckUtils]: 201: Hoare triple {8013#(<= 0 (+ g_~x 39))} assume ~x - 1 <= 2147483647; {8013#(<= 0 (+ g_~x 39))} is VALID [2022-02-21 03:02:58,373 INFO L290 TraceCheckUtils]: 202: Hoare triple {8013#(<= 0 (+ g_~x 39))} assume ~x - 1 >= -2147483648; {8013#(<= 0 (+ g_~x 39))} is VALID [2022-02-21 03:02:58,373 INFO L272 TraceCheckUtils]: 203: Hoare triple {8013#(<= 0 (+ g_~x 39))} call #t~ret0 := g(~x - 1); {8014#(<= 0 (+ 40 |g_#in~x|))} is VALID [2022-02-21 03:02:58,374 INFO L290 TraceCheckUtils]: 204: Hoare triple {8014#(<= 0 (+ 40 |g_#in~x|))} ~x := #in~x; {8015#(<= 0 (+ 40 g_~x))} is VALID [2022-02-21 03:02:58,374 INFO L290 TraceCheckUtils]: 205: Hoare triple {8015#(<= 0 (+ 40 g_~x))} assume !(0 == ~x); {8015#(<= 0 (+ 40 g_~x))} is VALID [2022-02-21 03:02:58,374 INFO L290 TraceCheckUtils]: 206: Hoare triple {8015#(<= 0 (+ 40 g_~x))} assume ~x - 1 <= 2147483647; {8015#(<= 0 (+ 40 g_~x))} is VALID [2022-02-21 03:02:58,375 INFO L290 TraceCheckUtils]: 207: Hoare triple {8015#(<= 0 (+ 40 g_~x))} assume ~x - 1 >= -2147483648; {8015#(<= 0 (+ 40 g_~x))} is VALID [2022-02-21 03:02:58,375 INFO L272 TraceCheckUtils]: 208: Hoare triple {8015#(<= 0 (+ 40 g_~x))} call #t~ret0 := g(~x - 1); {8016#(<= 0 (+ 41 |g_#in~x|))} is VALID [2022-02-21 03:02:58,376 INFO L290 TraceCheckUtils]: 209: Hoare triple {8016#(<= 0 (+ 41 |g_#in~x|))} ~x := #in~x; {8017#(<= 0 (+ 41 g_~x))} is VALID [2022-02-21 03:02:58,376 INFO L290 TraceCheckUtils]: 210: Hoare triple {8017#(<= 0 (+ 41 g_~x))} assume !(0 == ~x); {8017#(<= 0 (+ 41 g_~x))} is VALID [2022-02-21 03:02:58,377 INFO L290 TraceCheckUtils]: 211: Hoare triple {8017#(<= 0 (+ 41 g_~x))} assume ~x - 1 <= 2147483647; {8017#(<= 0 (+ 41 g_~x))} is VALID [2022-02-21 03:02:58,377 INFO L290 TraceCheckUtils]: 212: Hoare triple {8017#(<= 0 (+ 41 g_~x))} assume ~x - 1 >= -2147483648; {8017#(<= 0 (+ 41 g_~x))} is VALID [2022-02-21 03:02:58,378 INFO L272 TraceCheckUtils]: 213: Hoare triple {8017#(<= 0 (+ 41 g_~x))} call #t~ret0 := g(~x - 1); {8018#(<= 0 (+ 42 |g_#in~x|))} is VALID [2022-02-21 03:02:58,378 INFO L290 TraceCheckUtils]: 214: Hoare triple {8018#(<= 0 (+ 42 |g_#in~x|))} ~x := #in~x; {8019#(<= 0 (+ 42 g_~x))} is VALID [2022-02-21 03:02:58,378 INFO L290 TraceCheckUtils]: 215: Hoare triple {8019#(<= 0 (+ 42 g_~x))} assume !(0 == ~x); {8019#(<= 0 (+ 42 g_~x))} is VALID [2022-02-21 03:02:58,379 INFO L290 TraceCheckUtils]: 216: Hoare triple {8019#(<= 0 (+ 42 g_~x))} assume ~x - 1 <= 2147483647; {8019#(<= 0 (+ 42 g_~x))} is VALID [2022-02-21 03:02:58,379 INFO L290 TraceCheckUtils]: 217: Hoare triple {8019#(<= 0 (+ 42 g_~x))} assume ~x - 1 >= -2147483648; {8019#(<= 0 (+ 42 g_~x))} is VALID [2022-02-21 03:02:58,380 INFO L272 TraceCheckUtils]: 218: Hoare triple {8019#(<= 0 (+ 42 g_~x))} call #t~ret0 := g(~x - 1); {8020#(<= 0 (+ |g_#in~x| 43))} is VALID [2022-02-21 03:02:58,380 INFO L290 TraceCheckUtils]: 219: Hoare triple {8020#(<= 0 (+ |g_#in~x| 43))} ~x := #in~x; {8021#(<= 0 (+ g_~x 43))} is VALID [2022-02-21 03:02:58,381 INFO L290 TraceCheckUtils]: 220: Hoare triple {8021#(<= 0 (+ g_~x 43))} assume !(0 == ~x); {8021#(<= 0 (+ g_~x 43))} is VALID [2022-02-21 03:02:58,381 INFO L290 TraceCheckUtils]: 221: Hoare triple {8021#(<= 0 (+ g_~x 43))} assume ~x - 1 <= 2147483647; {8021#(<= 0 (+ g_~x 43))} is VALID [2022-02-21 03:02:58,381 INFO L290 TraceCheckUtils]: 222: Hoare triple {8021#(<= 0 (+ g_~x 43))} assume ~x - 1 >= -2147483648; {8021#(<= 0 (+ g_~x 43))} is VALID [2022-02-21 03:02:58,382 INFO L272 TraceCheckUtils]: 223: Hoare triple {8021#(<= 0 (+ g_~x 43))} call #t~ret0 := g(~x - 1); {8022#(<= 0 (+ 44 |g_#in~x|))} is VALID [2022-02-21 03:02:58,382 INFO L290 TraceCheckUtils]: 224: Hoare triple {8022#(<= 0 (+ 44 |g_#in~x|))} ~x := #in~x; {8023#(<= 0 (+ 44 g_~x))} is VALID [2022-02-21 03:02:58,383 INFO L290 TraceCheckUtils]: 225: Hoare triple {8023#(<= 0 (+ 44 g_~x))} assume !(0 == ~x); {8023#(<= 0 (+ 44 g_~x))} is VALID [2022-02-21 03:02:58,383 INFO L290 TraceCheckUtils]: 226: Hoare triple {8023#(<= 0 (+ 44 g_~x))} assume ~x - 1 <= 2147483647; {8023#(<= 0 (+ 44 g_~x))} is VALID [2022-02-21 03:02:58,383 INFO L290 TraceCheckUtils]: 227: Hoare triple {8023#(<= 0 (+ 44 g_~x))} assume ~x - 1 >= -2147483648; {8023#(<= 0 (+ 44 g_~x))} is VALID [2022-02-21 03:02:58,384 INFO L272 TraceCheckUtils]: 228: Hoare triple {8023#(<= 0 (+ 44 g_~x))} call #t~ret0 := g(~x - 1); {8024#(<= 0 (+ |g_#in~x| 45))} is VALID [2022-02-21 03:02:58,384 INFO L290 TraceCheckUtils]: 229: Hoare triple {8024#(<= 0 (+ |g_#in~x| 45))} ~x := #in~x; {8025#(<= 0 (+ g_~x 45))} is VALID [2022-02-21 03:02:58,385 INFO L290 TraceCheckUtils]: 230: Hoare triple {8025#(<= 0 (+ g_~x 45))} assume !(0 == ~x); {8025#(<= 0 (+ g_~x 45))} is VALID [2022-02-21 03:02:58,385 INFO L290 TraceCheckUtils]: 231: Hoare triple {8025#(<= 0 (+ g_~x 45))} assume ~x - 1 <= 2147483647; {8025#(<= 0 (+ g_~x 45))} is VALID [2022-02-21 03:02:58,385 INFO L290 TraceCheckUtils]: 232: Hoare triple {8025#(<= 0 (+ g_~x 45))} assume ~x - 1 >= -2147483648; {8025#(<= 0 (+ g_~x 45))} is VALID [2022-02-21 03:02:58,386 INFO L272 TraceCheckUtils]: 233: Hoare triple {8025#(<= 0 (+ g_~x 45))} call #t~ret0 := g(~x - 1); {8026#(<= 0 (+ |g_#in~x| 46))} is VALID [2022-02-21 03:02:58,386 INFO L290 TraceCheckUtils]: 234: Hoare triple {8026#(<= 0 (+ |g_#in~x| 46))} ~x := #in~x; {8027#(<= 0 (+ g_~x 46))} is VALID [2022-02-21 03:02:58,387 INFO L290 TraceCheckUtils]: 235: Hoare triple {8027#(<= 0 (+ g_~x 46))} assume !(0 == ~x); {8027#(<= 0 (+ g_~x 46))} is VALID [2022-02-21 03:02:58,387 INFO L290 TraceCheckUtils]: 236: Hoare triple {8027#(<= 0 (+ g_~x 46))} assume ~x - 1 <= 2147483647; {8027#(<= 0 (+ g_~x 46))} is VALID [2022-02-21 03:02:58,387 INFO L290 TraceCheckUtils]: 237: Hoare triple {8027#(<= 0 (+ g_~x 46))} assume !(~x - 1 >= -2147483648); {7932#false} is VALID [2022-02-21 03:02:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:02:58,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:02:58,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276443828] [2022-02-21 03:02:58,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276443828] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:02:58,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34976853] [2022-02-21 03:02:58,390 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:02:58,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:02:58,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:02:58,409 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:02:58,410 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:02:58,552 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-02-21 03:02:58,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:02:58,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 96 conjunts are in the unsatisfiable core [2022-02-21 03:02:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:02:58,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:00,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {7931#true} assume { :begin_inline_ULTIMATE.init } true; {7931#true} is VALID [2022-02-21 03:03:00,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {7931#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {7931#true} is VALID [2022-02-21 03:03:00,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {7931#true} assume !(main_~x~0#1 < 0); {7933#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:03:00,154 INFO L272 TraceCheckUtils]: 3: Hoare triple {7933#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {7934#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:03:00,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {7934#(<= 0 |g_#in~x|)} ~x := #in~x; {7935#(<= 0 g_~x)} is VALID [2022-02-21 03:03:00,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {7935#(<= 0 g_~x)} assume !(0 == ~x); {7935#(<= 0 g_~x)} is VALID [2022-02-21 03:03:00,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {7935#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {7935#(<= 0 g_~x)} is VALID [2022-02-21 03:03:00,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {7935#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {7935#(<= 0 g_~x)} is VALID [2022-02-21 03:03:00,156 INFO L272 TraceCheckUtils]: 8: Hoare triple {7935#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {7936#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:03:00,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {7936#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {7937#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:00,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {7937#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {7937#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:00,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {7937#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {7937#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:00,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {7937#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {7937#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:00,158 INFO L272 TraceCheckUtils]: 13: Hoare triple {7937#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {7938#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:03:00,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {7938#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {7939#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:00,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {7939#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {7939#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:00,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {7939#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {7939#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:00,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {7939#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {7939#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:00,160 INFO L272 TraceCheckUtils]: 18: Hoare triple {7939#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {7940#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:03:00,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {7940#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {7941#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:00,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {7941#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {7941#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:00,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {7941#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {7941#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:00,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {7941#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {7941#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:00,162 INFO L272 TraceCheckUtils]: 23: Hoare triple {7941#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {7942#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:03:00,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {7942#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {7943#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:00,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {7943#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {7943#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:00,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {7943#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {7943#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:00,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {7943#(<= 0 (+ g_~x 4))} assume ~x - 1 >= -2147483648; {7943#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:00,164 INFO L272 TraceCheckUtils]: 28: Hoare triple {7943#(<= 0 (+ g_~x 4))} call #t~ret0 := g(~x - 1); {7944#(<= 0 (+ 5 |g_#in~x|))} is VALID [2022-02-21 03:03:00,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {7944#(<= 0 (+ 5 |g_#in~x|))} ~x := #in~x; {7945#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:00,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {7945#(<= 0 (+ 5 g_~x))} assume !(0 == ~x); {7945#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:00,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {7945#(<= 0 (+ 5 g_~x))} assume ~x - 1 <= 2147483647; {7945#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:00,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {7945#(<= 0 (+ 5 g_~x))} assume ~x - 1 >= -2147483648; {7945#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:00,166 INFO L272 TraceCheckUtils]: 33: Hoare triple {7945#(<= 0 (+ 5 g_~x))} call #t~ret0 := g(~x - 1); {7946#(<= 0 (+ |g_#in~x| 6))} is VALID [2022-02-21 03:03:00,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {7946#(<= 0 (+ |g_#in~x| 6))} ~x := #in~x; {7947#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:00,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {7947#(<= 0 (+ 6 g_~x))} assume !(0 == ~x); {7947#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:00,167 INFO L290 TraceCheckUtils]: 36: Hoare triple {7947#(<= 0 (+ 6 g_~x))} assume ~x - 1 <= 2147483647; {7947#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:00,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {7947#(<= 0 (+ 6 g_~x))} assume ~x - 1 >= -2147483648; {7947#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:00,168 INFO L272 TraceCheckUtils]: 38: Hoare triple {7947#(<= 0 (+ 6 g_~x))} call #t~ret0 := g(~x - 1); {7948#(<= 0 (+ 7 |g_#in~x|))} is VALID [2022-02-21 03:03:00,168 INFO L290 TraceCheckUtils]: 39: Hoare triple {7948#(<= 0 (+ 7 |g_#in~x|))} ~x := #in~x; {7949#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:00,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {7949#(<= 0 (+ 7 g_~x))} assume !(0 == ~x); {7949#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:00,169 INFO L290 TraceCheckUtils]: 41: Hoare triple {7949#(<= 0 (+ 7 g_~x))} assume ~x - 1 <= 2147483647; {7949#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:00,169 INFO L290 TraceCheckUtils]: 42: Hoare triple {7949#(<= 0 (+ 7 g_~x))} assume ~x - 1 >= -2147483648; {7949#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:00,170 INFO L272 TraceCheckUtils]: 43: Hoare triple {7949#(<= 0 (+ 7 g_~x))} call #t~ret0 := g(~x - 1); {7950#(<= 0 (+ |g_#in~x| 8))} is VALID [2022-02-21 03:03:00,170 INFO L290 TraceCheckUtils]: 44: Hoare triple {7950#(<= 0 (+ |g_#in~x| 8))} ~x := #in~x; {7951#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:00,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {7951#(<= 0 (+ g_~x 8))} assume !(0 == ~x); {7951#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:00,171 INFO L290 TraceCheckUtils]: 46: Hoare triple {7951#(<= 0 (+ g_~x 8))} assume ~x - 1 <= 2147483647; {7951#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:00,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {7951#(<= 0 (+ g_~x 8))} assume ~x - 1 >= -2147483648; {7951#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:00,171 INFO L272 TraceCheckUtils]: 48: Hoare triple {7951#(<= 0 (+ g_~x 8))} call #t~ret0 := g(~x - 1); {7952#(<= 0 (+ |g_#in~x| 9))} is VALID [2022-02-21 03:03:00,172 INFO L290 TraceCheckUtils]: 49: Hoare triple {7952#(<= 0 (+ |g_#in~x| 9))} ~x := #in~x; {7953#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:00,172 INFO L290 TraceCheckUtils]: 50: Hoare triple {7953#(<= 0 (+ 9 g_~x))} assume !(0 == ~x); {7953#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:00,173 INFO L290 TraceCheckUtils]: 51: Hoare triple {7953#(<= 0 (+ 9 g_~x))} assume ~x - 1 <= 2147483647; {7953#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:00,173 INFO L290 TraceCheckUtils]: 52: Hoare triple {7953#(<= 0 (+ 9 g_~x))} assume ~x - 1 >= -2147483648; {7953#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:00,173 INFO L272 TraceCheckUtils]: 53: Hoare triple {7953#(<= 0 (+ 9 g_~x))} call #t~ret0 := g(~x - 1); {7954#(<= 0 (+ |g_#in~x| 10))} is VALID [2022-02-21 03:03:00,174 INFO L290 TraceCheckUtils]: 54: Hoare triple {7954#(<= 0 (+ |g_#in~x| 10))} ~x := #in~x; {7955#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:00,174 INFO L290 TraceCheckUtils]: 55: Hoare triple {7955#(<= 0 (+ g_~x 10))} assume !(0 == ~x); {7955#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:00,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {7955#(<= 0 (+ g_~x 10))} assume ~x - 1 <= 2147483647; {7955#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:00,175 INFO L290 TraceCheckUtils]: 57: Hoare triple {7955#(<= 0 (+ g_~x 10))} assume ~x - 1 >= -2147483648; {7955#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:00,175 INFO L272 TraceCheckUtils]: 58: Hoare triple {7955#(<= 0 (+ g_~x 10))} call #t~ret0 := g(~x - 1); {7956#(<= 0 (+ |g_#in~x| 11))} is VALID [2022-02-21 03:03:00,176 INFO L290 TraceCheckUtils]: 59: Hoare triple {7956#(<= 0 (+ |g_#in~x| 11))} ~x := #in~x; {7957#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:00,176 INFO L290 TraceCheckUtils]: 60: Hoare triple {7957#(<= 0 (+ g_~x 11))} assume !(0 == ~x); {7957#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:00,176 INFO L290 TraceCheckUtils]: 61: Hoare triple {7957#(<= 0 (+ g_~x 11))} assume ~x - 1 <= 2147483647; {7957#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:00,177 INFO L290 TraceCheckUtils]: 62: Hoare triple {7957#(<= 0 (+ g_~x 11))} assume ~x - 1 >= -2147483648; {7957#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:00,177 INFO L272 TraceCheckUtils]: 63: Hoare triple {7957#(<= 0 (+ g_~x 11))} call #t~ret0 := g(~x - 1); {7958#(<= 0 (+ |g_#in~x| 12))} is VALID [2022-02-21 03:03:00,178 INFO L290 TraceCheckUtils]: 64: Hoare triple {7958#(<= 0 (+ |g_#in~x| 12))} ~x := #in~x; {7959#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:00,178 INFO L290 TraceCheckUtils]: 65: Hoare triple {7959#(<= 0 (+ g_~x 12))} assume !(0 == ~x); {7959#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:00,178 INFO L290 TraceCheckUtils]: 66: Hoare triple {7959#(<= 0 (+ g_~x 12))} assume ~x - 1 <= 2147483647; {7959#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:00,179 INFO L290 TraceCheckUtils]: 67: Hoare triple {7959#(<= 0 (+ g_~x 12))} assume ~x - 1 >= -2147483648; {7959#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:00,179 INFO L272 TraceCheckUtils]: 68: Hoare triple {7959#(<= 0 (+ g_~x 12))} call #t~ret0 := g(~x - 1); {7960#(<= 0 (+ |g_#in~x| 13))} is VALID [2022-02-21 03:03:00,180 INFO L290 TraceCheckUtils]: 69: Hoare triple {7960#(<= 0 (+ |g_#in~x| 13))} ~x := #in~x; {7961#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:00,180 INFO L290 TraceCheckUtils]: 70: Hoare triple {7961#(<= 0 (+ g_~x 13))} assume !(0 == ~x); {7961#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:00,180 INFO L290 TraceCheckUtils]: 71: Hoare triple {7961#(<= 0 (+ g_~x 13))} assume ~x - 1 <= 2147483647; {7961#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:00,180 INFO L290 TraceCheckUtils]: 72: Hoare triple {7961#(<= 0 (+ g_~x 13))} assume ~x - 1 >= -2147483648; {7961#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:00,181 INFO L272 TraceCheckUtils]: 73: Hoare triple {7961#(<= 0 (+ g_~x 13))} call #t~ret0 := g(~x - 1); {7962#(<= 0 (+ |g_#in~x| 14))} is VALID [2022-02-21 03:03:00,181 INFO L290 TraceCheckUtils]: 74: Hoare triple {7962#(<= 0 (+ |g_#in~x| 14))} ~x := #in~x; {7963#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:00,182 INFO L290 TraceCheckUtils]: 75: Hoare triple {7963#(<= 0 (+ 14 g_~x))} assume !(0 == ~x); {7963#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:00,182 INFO L290 TraceCheckUtils]: 76: Hoare triple {7963#(<= 0 (+ 14 g_~x))} assume ~x - 1 <= 2147483647; {7963#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:00,182 INFO L290 TraceCheckUtils]: 77: Hoare triple {7963#(<= 0 (+ 14 g_~x))} assume ~x - 1 >= -2147483648; {7963#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:00,183 INFO L272 TraceCheckUtils]: 78: Hoare triple {7963#(<= 0 (+ 14 g_~x))} call #t~ret0 := g(~x - 1); {7964#(<= 0 (+ |g_#in~x| 15))} is VALID [2022-02-21 03:03:00,183 INFO L290 TraceCheckUtils]: 79: Hoare triple {7964#(<= 0 (+ |g_#in~x| 15))} ~x := #in~x; {7965#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:00,184 INFO L290 TraceCheckUtils]: 80: Hoare triple {7965#(<= 0 (+ g_~x 15))} assume !(0 == ~x); {7965#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:00,184 INFO L290 TraceCheckUtils]: 81: Hoare triple {7965#(<= 0 (+ g_~x 15))} assume ~x - 1 <= 2147483647; {7965#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:00,184 INFO L290 TraceCheckUtils]: 82: Hoare triple {7965#(<= 0 (+ g_~x 15))} assume ~x - 1 >= -2147483648; {7965#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:00,185 INFO L272 TraceCheckUtils]: 83: Hoare triple {7965#(<= 0 (+ g_~x 15))} call #t~ret0 := g(~x - 1); {7966#(<= 0 (+ |g_#in~x| 16))} is VALID [2022-02-21 03:03:00,185 INFO L290 TraceCheckUtils]: 84: Hoare triple {7966#(<= 0 (+ |g_#in~x| 16))} ~x := #in~x; {7967#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:00,186 INFO L290 TraceCheckUtils]: 85: Hoare triple {7967#(<= 0 (+ 16 g_~x))} assume !(0 == ~x); {7967#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:00,186 INFO L290 TraceCheckUtils]: 86: Hoare triple {7967#(<= 0 (+ 16 g_~x))} assume ~x - 1 <= 2147483647; {7967#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:00,186 INFO L290 TraceCheckUtils]: 87: Hoare triple {7967#(<= 0 (+ 16 g_~x))} assume ~x - 1 >= -2147483648; {7967#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:00,187 INFO L272 TraceCheckUtils]: 88: Hoare triple {7967#(<= 0 (+ 16 g_~x))} call #t~ret0 := g(~x - 1); {7968#(<= 0 (+ |g_#in~x| 17))} is VALID [2022-02-21 03:03:00,187 INFO L290 TraceCheckUtils]: 89: Hoare triple {7968#(<= 0 (+ |g_#in~x| 17))} ~x := #in~x; {7969#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:00,188 INFO L290 TraceCheckUtils]: 90: Hoare triple {7969#(<= 0 (+ g_~x 17))} assume !(0 == ~x); {7969#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:00,188 INFO L290 TraceCheckUtils]: 91: Hoare triple {7969#(<= 0 (+ g_~x 17))} assume ~x - 1 <= 2147483647; {7969#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:00,188 INFO L290 TraceCheckUtils]: 92: Hoare triple {7969#(<= 0 (+ g_~x 17))} assume ~x - 1 >= -2147483648; {7969#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:00,189 INFO L272 TraceCheckUtils]: 93: Hoare triple {7969#(<= 0 (+ g_~x 17))} call #t~ret0 := g(~x - 1); {7970#(<= 0 (+ |g_#in~x| 18))} is VALID [2022-02-21 03:03:00,189 INFO L290 TraceCheckUtils]: 94: Hoare triple {7970#(<= 0 (+ |g_#in~x| 18))} ~x := #in~x; {7971#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:00,189 INFO L290 TraceCheckUtils]: 95: Hoare triple {7971#(<= 0 (+ g_~x 18))} assume !(0 == ~x); {7971#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:00,190 INFO L290 TraceCheckUtils]: 96: Hoare triple {7971#(<= 0 (+ g_~x 18))} assume ~x - 1 <= 2147483647; {7971#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:00,190 INFO L290 TraceCheckUtils]: 97: Hoare triple {7971#(<= 0 (+ g_~x 18))} assume ~x - 1 >= -2147483648; {7971#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:00,191 INFO L272 TraceCheckUtils]: 98: Hoare triple {7971#(<= 0 (+ g_~x 18))} call #t~ret0 := g(~x - 1); {7972#(<= 0 (+ 19 |g_#in~x|))} is VALID [2022-02-21 03:03:00,191 INFO L290 TraceCheckUtils]: 99: Hoare triple {7972#(<= 0 (+ 19 |g_#in~x|))} ~x := #in~x; {7973#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:00,191 INFO L290 TraceCheckUtils]: 100: Hoare triple {7973#(<= 0 (+ 19 g_~x))} assume !(0 == ~x); {7973#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:00,192 INFO L290 TraceCheckUtils]: 101: Hoare triple {7973#(<= 0 (+ 19 g_~x))} assume ~x - 1 <= 2147483647; {7973#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:00,192 INFO L290 TraceCheckUtils]: 102: Hoare triple {7973#(<= 0 (+ 19 g_~x))} assume ~x - 1 >= -2147483648; {7973#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:00,192 INFO L272 TraceCheckUtils]: 103: Hoare triple {7973#(<= 0 (+ 19 g_~x))} call #t~ret0 := g(~x - 1); {7974#(<= 0 (+ |g_#in~x| 20))} is VALID [2022-02-21 03:03:00,193 INFO L290 TraceCheckUtils]: 104: Hoare triple {7974#(<= 0 (+ |g_#in~x| 20))} ~x := #in~x; {7975#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:00,193 INFO L290 TraceCheckUtils]: 105: Hoare triple {7975#(<= 0 (+ g_~x 20))} assume !(0 == ~x); {7975#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:00,193 INFO L290 TraceCheckUtils]: 106: Hoare triple {7975#(<= 0 (+ g_~x 20))} assume ~x - 1 <= 2147483647; {7975#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:00,193 INFO L290 TraceCheckUtils]: 107: Hoare triple {7975#(<= 0 (+ g_~x 20))} assume ~x - 1 >= -2147483648; {7975#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:00,194 INFO L272 TraceCheckUtils]: 108: Hoare triple {7975#(<= 0 (+ g_~x 20))} call #t~ret0 := g(~x - 1); {7976#(<= 0 (+ |g_#in~x| 21))} is VALID [2022-02-21 03:03:00,194 INFO L290 TraceCheckUtils]: 109: Hoare triple {7976#(<= 0 (+ |g_#in~x| 21))} ~x := #in~x; {7977#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:00,195 INFO L290 TraceCheckUtils]: 110: Hoare triple {7977#(<= 0 (+ 21 g_~x))} assume !(0 == ~x); {7977#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:00,195 INFO L290 TraceCheckUtils]: 111: Hoare triple {7977#(<= 0 (+ 21 g_~x))} assume ~x - 1 <= 2147483647; {7977#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:00,195 INFO L290 TraceCheckUtils]: 112: Hoare triple {7977#(<= 0 (+ 21 g_~x))} assume ~x - 1 >= -2147483648; {7977#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:00,196 INFO L272 TraceCheckUtils]: 113: Hoare triple {7977#(<= 0 (+ 21 g_~x))} call #t~ret0 := g(~x - 1); {7978#(<= 0 (+ |g_#in~x| 22))} is VALID [2022-02-21 03:03:00,196 INFO L290 TraceCheckUtils]: 114: Hoare triple {7978#(<= 0 (+ |g_#in~x| 22))} ~x := #in~x; {7979#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:00,197 INFO L290 TraceCheckUtils]: 115: Hoare triple {7979#(<= 0 (+ 22 g_~x))} assume !(0 == ~x); {7979#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:00,197 INFO L290 TraceCheckUtils]: 116: Hoare triple {7979#(<= 0 (+ 22 g_~x))} assume ~x - 1 <= 2147483647; {7979#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:00,197 INFO L290 TraceCheckUtils]: 117: Hoare triple {7979#(<= 0 (+ 22 g_~x))} assume ~x - 1 >= -2147483648; {7979#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:00,198 INFO L272 TraceCheckUtils]: 118: Hoare triple {7979#(<= 0 (+ 22 g_~x))} call #t~ret0 := g(~x - 1); {7980#(<= 0 (+ 23 |g_#in~x|))} is VALID [2022-02-21 03:03:00,198 INFO L290 TraceCheckUtils]: 119: Hoare triple {7980#(<= 0 (+ 23 |g_#in~x|))} ~x := #in~x; {7981#(<= 0 (+ 23 g_~x))} is VALID [2022-02-21 03:03:00,198 INFO L290 TraceCheckUtils]: 120: Hoare triple {7981#(<= 0 (+ 23 g_~x))} assume !(0 == ~x); {7981#(<= 0 (+ 23 g_~x))} is VALID [2022-02-21 03:03:00,199 INFO L290 TraceCheckUtils]: 121: Hoare triple {7981#(<= 0 (+ 23 g_~x))} assume ~x - 1 <= 2147483647; {7981#(<= 0 (+ 23 g_~x))} is VALID [2022-02-21 03:03:00,199 INFO L290 TraceCheckUtils]: 122: Hoare triple {7981#(<= 0 (+ 23 g_~x))} assume ~x - 1 >= -2147483648; {7981#(<= 0 (+ 23 g_~x))} is VALID [2022-02-21 03:03:00,199 INFO L272 TraceCheckUtils]: 123: Hoare triple {7981#(<= 0 (+ 23 g_~x))} call #t~ret0 := g(~x - 1); {7982#(<= 0 (+ |g_#in~x| 24))} is VALID [2022-02-21 03:03:00,200 INFO L290 TraceCheckUtils]: 124: Hoare triple {7982#(<= 0 (+ |g_#in~x| 24))} ~x := #in~x; {7983#(<= 0 (+ g_~x 24))} is VALID [2022-02-21 03:03:00,200 INFO L290 TraceCheckUtils]: 125: Hoare triple {7983#(<= 0 (+ g_~x 24))} assume !(0 == ~x); {7983#(<= 0 (+ g_~x 24))} is VALID [2022-02-21 03:03:00,200 INFO L290 TraceCheckUtils]: 126: Hoare triple {7983#(<= 0 (+ g_~x 24))} assume ~x - 1 <= 2147483647; {7983#(<= 0 (+ g_~x 24))} is VALID [2022-02-21 03:03:00,200 INFO L290 TraceCheckUtils]: 127: Hoare triple {7983#(<= 0 (+ g_~x 24))} assume ~x - 1 >= -2147483648; {7983#(<= 0 (+ g_~x 24))} is VALID [2022-02-21 03:03:00,201 INFO L272 TraceCheckUtils]: 128: Hoare triple {7983#(<= 0 (+ g_~x 24))} call #t~ret0 := g(~x - 1); {7984#(<= 0 (+ |g_#in~x| 25))} is VALID [2022-02-21 03:03:00,201 INFO L290 TraceCheckUtils]: 129: Hoare triple {7984#(<= 0 (+ |g_#in~x| 25))} ~x := #in~x; {7985#(<= 0 (+ g_~x 25))} is VALID [2022-02-21 03:03:00,202 INFO L290 TraceCheckUtils]: 130: Hoare triple {7985#(<= 0 (+ g_~x 25))} assume !(0 == ~x); {7985#(<= 0 (+ g_~x 25))} is VALID [2022-02-21 03:03:00,202 INFO L290 TraceCheckUtils]: 131: Hoare triple {7985#(<= 0 (+ g_~x 25))} assume ~x - 1 <= 2147483647; {7985#(<= 0 (+ g_~x 25))} is VALID [2022-02-21 03:03:00,202 INFO L290 TraceCheckUtils]: 132: Hoare triple {7985#(<= 0 (+ g_~x 25))} assume ~x - 1 >= -2147483648; {7985#(<= 0 (+ g_~x 25))} is VALID [2022-02-21 03:03:00,203 INFO L272 TraceCheckUtils]: 133: Hoare triple {7985#(<= 0 (+ g_~x 25))} call #t~ret0 := g(~x - 1); {7986#(<= 0 (+ |g_#in~x| 26))} is VALID [2022-02-21 03:03:00,203 INFO L290 TraceCheckUtils]: 134: Hoare triple {7986#(<= 0 (+ |g_#in~x| 26))} ~x := #in~x; {7987#(<= 0 (+ g_~x 26))} is VALID [2022-02-21 03:03:00,203 INFO L290 TraceCheckUtils]: 135: Hoare triple {7987#(<= 0 (+ g_~x 26))} assume !(0 == ~x); {7987#(<= 0 (+ g_~x 26))} is VALID [2022-02-21 03:03:00,204 INFO L290 TraceCheckUtils]: 136: Hoare triple {7987#(<= 0 (+ g_~x 26))} assume ~x - 1 <= 2147483647; {7987#(<= 0 (+ g_~x 26))} is VALID [2022-02-21 03:03:00,204 INFO L290 TraceCheckUtils]: 137: Hoare triple {7987#(<= 0 (+ g_~x 26))} assume ~x - 1 >= -2147483648; {7987#(<= 0 (+ g_~x 26))} is VALID [2022-02-21 03:03:00,204 INFO L272 TraceCheckUtils]: 138: Hoare triple {7987#(<= 0 (+ g_~x 26))} call #t~ret0 := g(~x - 1); {7988#(<= 0 (+ |g_#in~x| 27))} is VALID [2022-02-21 03:03:00,205 INFO L290 TraceCheckUtils]: 139: Hoare triple {7988#(<= 0 (+ |g_#in~x| 27))} ~x := #in~x; {7989#(<= 0 (+ g_~x 27))} is VALID [2022-02-21 03:03:00,205 INFO L290 TraceCheckUtils]: 140: Hoare triple {7989#(<= 0 (+ g_~x 27))} assume !(0 == ~x); {7989#(<= 0 (+ g_~x 27))} is VALID [2022-02-21 03:03:00,205 INFO L290 TraceCheckUtils]: 141: Hoare triple {7989#(<= 0 (+ g_~x 27))} assume ~x - 1 <= 2147483647; {7989#(<= 0 (+ g_~x 27))} is VALID [2022-02-21 03:03:00,205 INFO L290 TraceCheckUtils]: 142: Hoare triple {7989#(<= 0 (+ g_~x 27))} assume ~x - 1 >= -2147483648; {7989#(<= 0 (+ g_~x 27))} is VALID [2022-02-21 03:03:00,206 INFO L272 TraceCheckUtils]: 143: Hoare triple {7989#(<= 0 (+ g_~x 27))} call #t~ret0 := g(~x - 1); {7990#(<= 0 (+ |g_#in~x| 28))} is VALID [2022-02-21 03:03:00,206 INFO L290 TraceCheckUtils]: 144: Hoare triple {7990#(<= 0 (+ |g_#in~x| 28))} ~x := #in~x; {7991#(<= 0 (+ g_~x 28))} is VALID [2022-02-21 03:03:00,207 INFO L290 TraceCheckUtils]: 145: Hoare triple {7991#(<= 0 (+ g_~x 28))} assume !(0 == ~x); {7991#(<= 0 (+ g_~x 28))} is VALID [2022-02-21 03:03:00,207 INFO L290 TraceCheckUtils]: 146: Hoare triple {7991#(<= 0 (+ g_~x 28))} assume ~x - 1 <= 2147483647; {7991#(<= 0 (+ g_~x 28))} is VALID [2022-02-21 03:03:00,207 INFO L290 TraceCheckUtils]: 147: Hoare triple {7991#(<= 0 (+ g_~x 28))} assume ~x - 1 >= -2147483648; {7991#(<= 0 (+ g_~x 28))} is VALID [2022-02-21 03:03:00,208 INFO L272 TraceCheckUtils]: 148: Hoare triple {7991#(<= 0 (+ g_~x 28))} call #t~ret0 := g(~x - 1); {7992#(<= 0 (+ 29 |g_#in~x|))} is VALID [2022-02-21 03:03:00,208 INFO L290 TraceCheckUtils]: 149: Hoare triple {7992#(<= 0 (+ 29 |g_#in~x|))} ~x := #in~x; {7993#(<= 0 (+ 29 g_~x))} is VALID [2022-02-21 03:03:00,208 INFO L290 TraceCheckUtils]: 150: Hoare triple {7993#(<= 0 (+ 29 g_~x))} assume !(0 == ~x); {7993#(<= 0 (+ 29 g_~x))} is VALID [2022-02-21 03:03:00,209 INFO L290 TraceCheckUtils]: 151: Hoare triple {7993#(<= 0 (+ 29 g_~x))} assume ~x - 1 <= 2147483647; {7993#(<= 0 (+ 29 g_~x))} is VALID [2022-02-21 03:03:00,209 INFO L290 TraceCheckUtils]: 152: Hoare triple {7993#(<= 0 (+ 29 g_~x))} assume ~x - 1 >= -2147483648; {7993#(<= 0 (+ 29 g_~x))} is VALID [2022-02-21 03:03:00,209 INFO L272 TraceCheckUtils]: 153: Hoare triple {7993#(<= 0 (+ 29 g_~x))} call #t~ret0 := g(~x - 1); {7994#(<= 0 (+ 30 |g_#in~x|))} is VALID [2022-02-21 03:03:00,210 INFO L290 TraceCheckUtils]: 154: Hoare triple {7994#(<= 0 (+ 30 |g_#in~x|))} ~x := #in~x; {7995#(<= 0 (+ 30 g_~x))} is VALID [2022-02-21 03:03:00,210 INFO L290 TraceCheckUtils]: 155: Hoare triple {7995#(<= 0 (+ 30 g_~x))} assume !(0 == ~x); {7995#(<= 0 (+ 30 g_~x))} is VALID [2022-02-21 03:03:00,210 INFO L290 TraceCheckUtils]: 156: Hoare triple {7995#(<= 0 (+ 30 g_~x))} assume ~x - 1 <= 2147483647; {7995#(<= 0 (+ 30 g_~x))} is VALID [2022-02-21 03:03:00,211 INFO L290 TraceCheckUtils]: 157: Hoare triple {7995#(<= 0 (+ 30 g_~x))} assume ~x - 1 >= -2147483648; {7995#(<= 0 (+ 30 g_~x))} is VALID [2022-02-21 03:03:00,211 INFO L272 TraceCheckUtils]: 158: Hoare triple {7995#(<= 0 (+ 30 g_~x))} call #t~ret0 := g(~x - 1); {7996#(<= 0 (+ |g_#in~x| 31))} is VALID [2022-02-21 03:03:00,211 INFO L290 TraceCheckUtils]: 159: Hoare triple {7996#(<= 0 (+ |g_#in~x| 31))} ~x := #in~x; {7997#(<= 0 (+ g_~x 31))} is VALID [2022-02-21 03:03:00,212 INFO L290 TraceCheckUtils]: 160: Hoare triple {7997#(<= 0 (+ g_~x 31))} assume !(0 == ~x); {7997#(<= 0 (+ g_~x 31))} is VALID [2022-02-21 03:03:00,212 INFO L290 TraceCheckUtils]: 161: Hoare triple {7997#(<= 0 (+ g_~x 31))} assume ~x - 1 <= 2147483647; {7997#(<= 0 (+ g_~x 31))} is VALID [2022-02-21 03:03:00,212 INFO L290 TraceCheckUtils]: 162: Hoare triple {7997#(<= 0 (+ g_~x 31))} assume ~x - 1 >= -2147483648; {7997#(<= 0 (+ g_~x 31))} is VALID [2022-02-21 03:03:00,213 INFO L272 TraceCheckUtils]: 163: Hoare triple {7997#(<= 0 (+ g_~x 31))} call #t~ret0 := g(~x - 1); {7998#(<= 0 (+ 32 |g_#in~x|))} is VALID [2022-02-21 03:03:00,213 INFO L290 TraceCheckUtils]: 164: Hoare triple {7998#(<= 0 (+ 32 |g_#in~x|))} ~x := #in~x; {7999#(<= 0 (+ 32 g_~x))} is VALID [2022-02-21 03:03:00,214 INFO L290 TraceCheckUtils]: 165: Hoare triple {7999#(<= 0 (+ 32 g_~x))} assume !(0 == ~x); {7999#(<= 0 (+ 32 g_~x))} is VALID [2022-02-21 03:03:00,214 INFO L290 TraceCheckUtils]: 166: Hoare triple {7999#(<= 0 (+ 32 g_~x))} assume ~x - 1 <= 2147483647; {7999#(<= 0 (+ 32 g_~x))} is VALID [2022-02-21 03:03:00,214 INFO L290 TraceCheckUtils]: 167: Hoare triple {7999#(<= 0 (+ 32 g_~x))} assume ~x - 1 >= -2147483648; {7999#(<= 0 (+ 32 g_~x))} is VALID [2022-02-21 03:03:00,215 INFO L272 TraceCheckUtils]: 168: Hoare triple {7999#(<= 0 (+ 32 g_~x))} call #t~ret0 := g(~x - 1); {8000#(<= 0 (+ |g_#in~x| 33))} is VALID [2022-02-21 03:03:00,215 INFO L290 TraceCheckUtils]: 169: Hoare triple {8000#(<= 0 (+ |g_#in~x| 33))} ~x := #in~x; {8001#(<= 0 (+ g_~x 33))} is VALID [2022-02-21 03:03:00,215 INFO L290 TraceCheckUtils]: 170: Hoare triple {8001#(<= 0 (+ g_~x 33))} assume !(0 == ~x); {8001#(<= 0 (+ g_~x 33))} is VALID [2022-02-21 03:03:00,216 INFO L290 TraceCheckUtils]: 171: Hoare triple {8001#(<= 0 (+ g_~x 33))} assume ~x - 1 <= 2147483647; {8001#(<= 0 (+ g_~x 33))} is VALID [2022-02-21 03:03:00,216 INFO L290 TraceCheckUtils]: 172: Hoare triple {8001#(<= 0 (+ g_~x 33))} assume ~x - 1 >= -2147483648; {8001#(<= 0 (+ g_~x 33))} is VALID [2022-02-21 03:03:00,216 INFO L272 TraceCheckUtils]: 173: Hoare triple {8001#(<= 0 (+ g_~x 33))} call #t~ret0 := g(~x - 1); {8002#(<= 0 (+ |g_#in~x| 34))} is VALID [2022-02-21 03:03:00,217 INFO L290 TraceCheckUtils]: 174: Hoare triple {8002#(<= 0 (+ |g_#in~x| 34))} ~x := #in~x; {8003#(<= 0 (+ g_~x 34))} is VALID [2022-02-21 03:03:00,217 INFO L290 TraceCheckUtils]: 175: Hoare triple {8003#(<= 0 (+ g_~x 34))} assume !(0 == ~x); {8003#(<= 0 (+ g_~x 34))} is VALID [2022-02-21 03:03:00,217 INFO L290 TraceCheckUtils]: 176: Hoare triple {8003#(<= 0 (+ g_~x 34))} assume ~x - 1 <= 2147483647; {8003#(<= 0 (+ g_~x 34))} is VALID [2022-02-21 03:03:00,218 INFO L290 TraceCheckUtils]: 177: Hoare triple {8003#(<= 0 (+ g_~x 34))} assume ~x - 1 >= -2147483648; {8003#(<= 0 (+ g_~x 34))} is VALID [2022-02-21 03:03:00,218 INFO L272 TraceCheckUtils]: 178: Hoare triple {8003#(<= 0 (+ g_~x 34))} call #t~ret0 := g(~x - 1); {8004#(<= 0 (+ 35 |g_#in~x|))} is VALID [2022-02-21 03:03:00,218 INFO L290 TraceCheckUtils]: 179: Hoare triple {8004#(<= 0 (+ 35 |g_#in~x|))} ~x := #in~x; {8005#(<= 0 (+ 35 g_~x))} is VALID [2022-02-21 03:03:00,219 INFO L290 TraceCheckUtils]: 180: Hoare triple {8005#(<= 0 (+ 35 g_~x))} assume !(0 == ~x); {8005#(<= 0 (+ 35 g_~x))} is VALID [2022-02-21 03:03:00,219 INFO L290 TraceCheckUtils]: 181: Hoare triple {8005#(<= 0 (+ 35 g_~x))} assume ~x - 1 <= 2147483647; {8005#(<= 0 (+ 35 g_~x))} is VALID [2022-02-21 03:03:00,219 INFO L290 TraceCheckUtils]: 182: Hoare triple {8005#(<= 0 (+ 35 g_~x))} assume ~x - 1 >= -2147483648; {8005#(<= 0 (+ 35 g_~x))} is VALID [2022-02-21 03:03:00,220 INFO L272 TraceCheckUtils]: 183: Hoare triple {8005#(<= 0 (+ 35 g_~x))} call #t~ret0 := g(~x - 1); {8006#(<= 0 (+ |g_#in~x| 36))} is VALID [2022-02-21 03:03:00,220 INFO L290 TraceCheckUtils]: 184: Hoare triple {8006#(<= 0 (+ |g_#in~x| 36))} ~x := #in~x; {8007#(<= 0 (+ g_~x 36))} is VALID [2022-02-21 03:03:00,220 INFO L290 TraceCheckUtils]: 185: Hoare triple {8007#(<= 0 (+ g_~x 36))} assume !(0 == ~x); {8007#(<= 0 (+ g_~x 36))} is VALID [2022-02-21 03:03:00,221 INFO L290 TraceCheckUtils]: 186: Hoare triple {8007#(<= 0 (+ g_~x 36))} assume ~x - 1 <= 2147483647; {8007#(<= 0 (+ g_~x 36))} is VALID [2022-02-21 03:03:00,221 INFO L290 TraceCheckUtils]: 187: Hoare triple {8007#(<= 0 (+ g_~x 36))} assume ~x - 1 >= -2147483648; {8007#(<= 0 (+ g_~x 36))} is VALID [2022-02-21 03:03:00,222 INFO L272 TraceCheckUtils]: 188: Hoare triple {8007#(<= 0 (+ g_~x 36))} call #t~ret0 := g(~x - 1); {8008#(<= 0 (+ |g_#in~x| 37))} is VALID [2022-02-21 03:03:00,222 INFO L290 TraceCheckUtils]: 189: Hoare triple {8008#(<= 0 (+ |g_#in~x| 37))} ~x := #in~x; {8009#(<= 0 (+ g_~x 37))} is VALID [2022-02-21 03:03:00,222 INFO L290 TraceCheckUtils]: 190: Hoare triple {8009#(<= 0 (+ g_~x 37))} assume !(0 == ~x); {8009#(<= 0 (+ g_~x 37))} is VALID [2022-02-21 03:03:00,222 INFO L290 TraceCheckUtils]: 191: Hoare triple {8009#(<= 0 (+ g_~x 37))} assume ~x - 1 <= 2147483647; {8009#(<= 0 (+ g_~x 37))} is VALID [2022-02-21 03:03:00,223 INFO L290 TraceCheckUtils]: 192: Hoare triple {8009#(<= 0 (+ g_~x 37))} assume ~x - 1 >= -2147483648; {8009#(<= 0 (+ g_~x 37))} is VALID [2022-02-21 03:03:00,223 INFO L272 TraceCheckUtils]: 193: Hoare triple {8009#(<= 0 (+ g_~x 37))} call #t~ret0 := g(~x - 1); {8010#(<= 0 (+ |g_#in~x| 38))} is VALID [2022-02-21 03:03:00,224 INFO L290 TraceCheckUtils]: 194: Hoare triple {8010#(<= 0 (+ |g_#in~x| 38))} ~x := #in~x; {8011#(<= 0 (+ g_~x 38))} is VALID [2022-02-21 03:03:00,224 INFO L290 TraceCheckUtils]: 195: Hoare triple {8011#(<= 0 (+ g_~x 38))} assume !(0 == ~x); {8011#(<= 0 (+ g_~x 38))} is VALID [2022-02-21 03:03:00,224 INFO L290 TraceCheckUtils]: 196: Hoare triple {8011#(<= 0 (+ g_~x 38))} assume ~x - 1 <= 2147483647; {8011#(<= 0 (+ g_~x 38))} is VALID [2022-02-21 03:03:00,224 INFO L290 TraceCheckUtils]: 197: Hoare triple {8011#(<= 0 (+ g_~x 38))} assume ~x - 1 >= -2147483648; {8011#(<= 0 (+ g_~x 38))} is VALID [2022-02-21 03:03:00,225 INFO L272 TraceCheckUtils]: 198: Hoare triple {8011#(<= 0 (+ g_~x 38))} call #t~ret0 := g(~x - 1); {8012#(<= 0 (+ |g_#in~x| 39))} is VALID [2022-02-21 03:03:00,225 INFO L290 TraceCheckUtils]: 199: Hoare triple {8012#(<= 0 (+ |g_#in~x| 39))} ~x := #in~x; {8013#(<= 0 (+ g_~x 39))} is VALID [2022-02-21 03:03:00,225 INFO L290 TraceCheckUtils]: 200: Hoare triple {8013#(<= 0 (+ g_~x 39))} assume !(0 == ~x); {8013#(<= 0 (+ g_~x 39))} is VALID [2022-02-21 03:03:00,226 INFO L290 TraceCheckUtils]: 201: Hoare triple {8013#(<= 0 (+ g_~x 39))} assume ~x - 1 <= 2147483647; {8013#(<= 0 (+ g_~x 39))} is VALID [2022-02-21 03:03:00,226 INFO L290 TraceCheckUtils]: 202: Hoare triple {8013#(<= 0 (+ g_~x 39))} assume ~x - 1 >= -2147483648; {8013#(<= 0 (+ g_~x 39))} is VALID [2022-02-21 03:03:00,227 INFO L272 TraceCheckUtils]: 203: Hoare triple {8013#(<= 0 (+ g_~x 39))} call #t~ret0 := g(~x - 1); {8014#(<= 0 (+ 40 |g_#in~x|))} is VALID [2022-02-21 03:03:00,227 INFO L290 TraceCheckUtils]: 204: Hoare triple {8014#(<= 0 (+ 40 |g_#in~x|))} ~x := #in~x; {8015#(<= 0 (+ 40 g_~x))} is VALID [2022-02-21 03:03:00,227 INFO L290 TraceCheckUtils]: 205: Hoare triple {8015#(<= 0 (+ 40 g_~x))} assume !(0 == ~x); {8015#(<= 0 (+ 40 g_~x))} is VALID [2022-02-21 03:03:00,227 INFO L290 TraceCheckUtils]: 206: Hoare triple {8015#(<= 0 (+ 40 g_~x))} assume ~x - 1 <= 2147483647; {8015#(<= 0 (+ 40 g_~x))} is VALID [2022-02-21 03:03:00,228 INFO L290 TraceCheckUtils]: 207: Hoare triple {8015#(<= 0 (+ 40 g_~x))} assume ~x - 1 >= -2147483648; {8015#(<= 0 (+ 40 g_~x))} is VALID [2022-02-21 03:03:00,228 INFO L272 TraceCheckUtils]: 208: Hoare triple {8015#(<= 0 (+ 40 g_~x))} call #t~ret0 := g(~x - 1); {8016#(<= 0 (+ 41 |g_#in~x|))} is VALID [2022-02-21 03:03:00,229 INFO L290 TraceCheckUtils]: 209: Hoare triple {8016#(<= 0 (+ 41 |g_#in~x|))} ~x := #in~x; {8017#(<= 0 (+ 41 g_~x))} is VALID [2022-02-21 03:03:00,229 INFO L290 TraceCheckUtils]: 210: Hoare triple {8017#(<= 0 (+ 41 g_~x))} assume !(0 == ~x); {8017#(<= 0 (+ 41 g_~x))} is VALID [2022-02-21 03:03:00,229 INFO L290 TraceCheckUtils]: 211: Hoare triple {8017#(<= 0 (+ 41 g_~x))} assume ~x - 1 <= 2147483647; {8017#(<= 0 (+ 41 g_~x))} is VALID [2022-02-21 03:03:00,229 INFO L290 TraceCheckUtils]: 212: Hoare triple {8017#(<= 0 (+ 41 g_~x))} assume ~x - 1 >= -2147483648; {8017#(<= 0 (+ 41 g_~x))} is VALID [2022-02-21 03:03:00,230 INFO L272 TraceCheckUtils]: 213: Hoare triple {8017#(<= 0 (+ 41 g_~x))} call #t~ret0 := g(~x - 1); {8018#(<= 0 (+ 42 |g_#in~x|))} is VALID [2022-02-21 03:03:00,230 INFO L290 TraceCheckUtils]: 214: Hoare triple {8018#(<= 0 (+ 42 |g_#in~x|))} ~x := #in~x; {8019#(<= 0 (+ 42 g_~x))} is VALID [2022-02-21 03:03:00,231 INFO L290 TraceCheckUtils]: 215: Hoare triple {8019#(<= 0 (+ 42 g_~x))} assume !(0 == ~x); {8019#(<= 0 (+ 42 g_~x))} is VALID [2022-02-21 03:03:00,231 INFO L290 TraceCheckUtils]: 216: Hoare triple {8019#(<= 0 (+ 42 g_~x))} assume ~x - 1 <= 2147483647; {8019#(<= 0 (+ 42 g_~x))} is VALID [2022-02-21 03:03:00,231 INFO L290 TraceCheckUtils]: 217: Hoare triple {8019#(<= 0 (+ 42 g_~x))} assume ~x - 1 >= -2147483648; {8019#(<= 0 (+ 42 g_~x))} is VALID [2022-02-21 03:03:00,232 INFO L272 TraceCheckUtils]: 218: Hoare triple {8019#(<= 0 (+ 42 g_~x))} call #t~ret0 := g(~x - 1); {8020#(<= 0 (+ |g_#in~x| 43))} is VALID [2022-02-21 03:03:00,232 INFO L290 TraceCheckUtils]: 219: Hoare triple {8020#(<= 0 (+ |g_#in~x| 43))} ~x := #in~x; {8021#(<= 0 (+ g_~x 43))} is VALID [2022-02-21 03:03:00,232 INFO L290 TraceCheckUtils]: 220: Hoare triple {8021#(<= 0 (+ g_~x 43))} assume !(0 == ~x); {8021#(<= 0 (+ g_~x 43))} is VALID [2022-02-21 03:03:00,233 INFO L290 TraceCheckUtils]: 221: Hoare triple {8021#(<= 0 (+ g_~x 43))} assume ~x - 1 <= 2147483647; {8021#(<= 0 (+ g_~x 43))} is VALID [2022-02-21 03:03:00,233 INFO L290 TraceCheckUtils]: 222: Hoare triple {8021#(<= 0 (+ g_~x 43))} assume ~x - 1 >= -2147483648; {8021#(<= 0 (+ g_~x 43))} is VALID [2022-02-21 03:03:00,233 INFO L272 TraceCheckUtils]: 223: Hoare triple {8021#(<= 0 (+ g_~x 43))} call #t~ret0 := g(~x - 1); {8022#(<= 0 (+ 44 |g_#in~x|))} is VALID [2022-02-21 03:03:00,234 INFO L290 TraceCheckUtils]: 224: Hoare triple {8022#(<= 0 (+ 44 |g_#in~x|))} ~x := #in~x; {8023#(<= 0 (+ 44 g_~x))} is VALID [2022-02-21 03:03:00,234 INFO L290 TraceCheckUtils]: 225: Hoare triple {8023#(<= 0 (+ 44 g_~x))} assume !(0 == ~x); {8023#(<= 0 (+ 44 g_~x))} is VALID [2022-02-21 03:03:00,234 INFO L290 TraceCheckUtils]: 226: Hoare triple {8023#(<= 0 (+ 44 g_~x))} assume ~x - 1 <= 2147483647; {8023#(<= 0 (+ 44 g_~x))} is VALID [2022-02-21 03:03:00,235 INFO L290 TraceCheckUtils]: 227: Hoare triple {8023#(<= 0 (+ 44 g_~x))} assume ~x - 1 >= -2147483648; {8023#(<= 0 (+ 44 g_~x))} is VALID [2022-02-21 03:03:00,235 INFO L272 TraceCheckUtils]: 228: Hoare triple {8023#(<= 0 (+ 44 g_~x))} call #t~ret0 := g(~x - 1); {8024#(<= 0 (+ |g_#in~x| 45))} is VALID [2022-02-21 03:03:00,235 INFO L290 TraceCheckUtils]: 229: Hoare triple {8024#(<= 0 (+ |g_#in~x| 45))} ~x := #in~x; {8025#(<= 0 (+ g_~x 45))} is VALID [2022-02-21 03:03:00,236 INFO L290 TraceCheckUtils]: 230: Hoare triple {8025#(<= 0 (+ g_~x 45))} assume !(0 == ~x); {8025#(<= 0 (+ g_~x 45))} is VALID [2022-02-21 03:03:00,236 INFO L290 TraceCheckUtils]: 231: Hoare triple {8025#(<= 0 (+ g_~x 45))} assume ~x - 1 <= 2147483647; {8025#(<= 0 (+ g_~x 45))} is VALID [2022-02-21 03:03:00,236 INFO L290 TraceCheckUtils]: 232: Hoare triple {8025#(<= 0 (+ g_~x 45))} assume ~x - 1 >= -2147483648; {8025#(<= 0 (+ g_~x 45))} is VALID [2022-02-21 03:03:00,237 INFO L272 TraceCheckUtils]: 233: Hoare triple {8025#(<= 0 (+ g_~x 45))} call #t~ret0 := g(~x - 1); {8026#(<= 0 (+ |g_#in~x| 46))} is VALID [2022-02-21 03:03:00,237 INFO L290 TraceCheckUtils]: 234: Hoare triple {8026#(<= 0 (+ |g_#in~x| 46))} ~x := #in~x; {8027#(<= 0 (+ g_~x 46))} is VALID [2022-02-21 03:03:00,237 INFO L290 TraceCheckUtils]: 235: Hoare triple {8027#(<= 0 (+ g_~x 46))} assume !(0 == ~x); {8027#(<= 0 (+ g_~x 46))} is VALID [2022-02-21 03:03:00,238 INFO L290 TraceCheckUtils]: 236: Hoare triple {8027#(<= 0 (+ g_~x 46))} assume ~x - 1 <= 2147483647; {8027#(<= 0 (+ g_~x 46))} is VALID [2022-02-21 03:03:00,238 INFO L290 TraceCheckUtils]: 237: Hoare triple {8027#(<= 0 (+ g_~x 46))} assume !(~x - 1 >= -2147483648); {7932#false} is VALID [2022-02-21 03:03:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:00,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:06,679 INFO L290 TraceCheckUtils]: 237: Hoare triple {8742#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {7932#false} is VALID [2022-02-21 03:03:06,679 INFO L290 TraceCheckUtils]: 236: Hoare triple {8742#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {8742#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:03:06,680 INFO L290 TraceCheckUtils]: 235: Hoare triple {8742#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {8742#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:03:06,680 INFO L290 TraceCheckUtils]: 234: Hoare triple {8752#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {8742#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:03:06,681 INFO L272 TraceCheckUtils]: 233: Hoare triple {8756#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {8752#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:03:06,681 INFO L290 TraceCheckUtils]: 232: Hoare triple {8756#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {8756#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:06,681 INFO L290 TraceCheckUtils]: 231: Hoare triple {8756#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {8756#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:06,682 INFO L290 TraceCheckUtils]: 230: Hoare triple {8756#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {8756#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:06,682 INFO L290 TraceCheckUtils]: 229: Hoare triple {8769#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {8756#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:06,683 INFO L272 TraceCheckUtils]: 228: Hoare triple {8773#(<= 0 (+ 2147483645 g_~x))} call #t~ret0 := g(~x - 1); {8769#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:03:06,683 INFO L290 TraceCheckUtils]: 227: Hoare triple {8773#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 >= -2147483648; {8773#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:06,683 INFO L290 TraceCheckUtils]: 226: Hoare triple {8773#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 <= 2147483647; {8773#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:06,684 INFO L290 TraceCheckUtils]: 225: Hoare triple {8773#(<= 0 (+ 2147483645 g_~x))} assume !(0 == ~x); {8773#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:06,684 INFO L290 TraceCheckUtils]: 224: Hoare triple {8786#(<= 0 (+ 2147483645 |g_#in~x|))} ~x := #in~x; {8773#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:06,685 INFO L272 TraceCheckUtils]: 223: Hoare triple {8790#(<= 0 (+ g_~x 2147483644))} call #t~ret0 := g(~x - 1); {8786#(<= 0 (+ 2147483645 |g_#in~x|))} is VALID [2022-02-21 03:03:06,685 INFO L290 TraceCheckUtils]: 222: Hoare triple {8790#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 >= -2147483648; {8790#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:06,685 INFO L290 TraceCheckUtils]: 221: Hoare triple {8790#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 <= 2147483647; {8790#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:06,686 INFO L290 TraceCheckUtils]: 220: Hoare triple {8790#(<= 0 (+ g_~x 2147483644))} assume !(0 == ~x); {8790#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:06,686 INFO L290 TraceCheckUtils]: 219: Hoare triple {8803#(<= 0 (+ |g_#in~x| 2147483644))} ~x := #in~x; {8790#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:06,686 INFO L272 TraceCheckUtils]: 218: Hoare triple {8807#(<= 0 (+ 2147483643 g_~x))} call #t~ret0 := g(~x - 1); {8803#(<= 0 (+ |g_#in~x| 2147483644))} is VALID [2022-02-21 03:03:06,687 INFO L290 TraceCheckUtils]: 217: Hoare triple {8807#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 >= -2147483648; {8807#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:06,687 INFO L290 TraceCheckUtils]: 216: Hoare triple {8807#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 <= 2147483647; {8807#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:06,687 INFO L290 TraceCheckUtils]: 215: Hoare triple {8807#(<= 0 (+ 2147483643 g_~x))} assume !(0 == ~x); {8807#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:06,688 INFO L290 TraceCheckUtils]: 214: Hoare triple {8820#(<= 0 (+ 2147483643 |g_#in~x|))} ~x := #in~x; {8807#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:06,688 INFO L272 TraceCheckUtils]: 213: Hoare triple {8824#(<= 0 (+ g_~x 2147483642))} call #t~ret0 := g(~x - 1); {8820#(<= 0 (+ 2147483643 |g_#in~x|))} is VALID [2022-02-21 03:03:06,689 INFO L290 TraceCheckUtils]: 212: Hoare triple {8824#(<= 0 (+ g_~x 2147483642))} assume ~x - 1 >= -2147483648; {8824#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:03:06,689 INFO L290 TraceCheckUtils]: 211: Hoare triple {8824#(<= 0 (+ g_~x 2147483642))} assume ~x - 1 <= 2147483647; {8824#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:03:06,689 INFO L290 TraceCheckUtils]: 210: Hoare triple {8824#(<= 0 (+ g_~x 2147483642))} assume !(0 == ~x); {8824#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:03:06,690 INFO L290 TraceCheckUtils]: 209: Hoare triple {8837#(<= 0 (+ |g_#in~x| 2147483642))} ~x := #in~x; {8824#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:03:06,690 INFO L272 TraceCheckUtils]: 208: Hoare triple {8841#(<= 0 (+ g_~x 2147483641))} call #t~ret0 := g(~x - 1); {8837#(<= 0 (+ |g_#in~x| 2147483642))} is VALID [2022-02-21 03:03:06,691 INFO L290 TraceCheckUtils]: 207: Hoare triple {8841#(<= 0 (+ g_~x 2147483641))} assume ~x - 1 >= -2147483648; {8841#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:03:06,691 INFO L290 TraceCheckUtils]: 206: Hoare triple {8841#(<= 0 (+ g_~x 2147483641))} assume ~x - 1 <= 2147483647; {8841#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:03:06,691 INFO L290 TraceCheckUtils]: 205: Hoare triple {8841#(<= 0 (+ g_~x 2147483641))} assume !(0 == ~x); {8841#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:03:06,692 INFO L290 TraceCheckUtils]: 204: Hoare triple {8854#(<= 0 (+ |g_#in~x| 2147483641))} ~x := #in~x; {8841#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:03:06,692 INFO L272 TraceCheckUtils]: 203: Hoare triple {8858#(<= 0 (+ g_~x 2147483640))} call #t~ret0 := g(~x - 1); {8854#(<= 0 (+ |g_#in~x| 2147483641))} is VALID [2022-02-21 03:03:06,692 INFO L290 TraceCheckUtils]: 202: Hoare triple {8858#(<= 0 (+ g_~x 2147483640))} assume ~x - 1 >= -2147483648; {8858#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:03:06,693 INFO L290 TraceCheckUtils]: 201: Hoare triple {8858#(<= 0 (+ g_~x 2147483640))} assume ~x - 1 <= 2147483647; {8858#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:03:06,693 INFO L290 TraceCheckUtils]: 200: Hoare triple {8858#(<= 0 (+ g_~x 2147483640))} assume !(0 == ~x); {8858#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:03:06,693 INFO L290 TraceCheckUtils]: 199: Hoare triple {8871#(<= 0 (+ |g_#in~x| 2147483640))} ~x := #in~x; {8858#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:03:06,694 INFO L272 TraceCheckUtils]: 198: Hoare triple {8875#(<= 0 (+ g_~x 2147483639))} call #t~ret0 := g(~x - 1); {8871#(<= 0 (+ |g_#in~x| 2147483640))} is VALID [2022-02-21 03:03:06,694 INFO L290 TraceCheckUtils]: 197: Hoare triple {8875#(<= 0 (+ g_~x 2147483639))} assume ~x - 1 >= -2147483648; {8875#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:03:06,695 INFO L290 TraceCheckUtils]: 196: Hoare triple {8875#(<= 0 (+ g_~x 2147483639))} assume ~x - 1 <= 2147483647; {8875#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:03:06,695 INFO L290 TraceCheckUtils]: 195: Hoare triple {8875#(<= 0 (+ g_~x 2147483639))} assume !(0 == ~x); {8875#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:03:06,695 INFO L290 TraceCheckUtils]: 194: Hoare triple {8888#(<= 0 (+ |g_#in~x| 2147483639))} ~x := #in~x; {8875#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:03:06,696 INFO L272 TraceCheckUtils]: 193: Hoare triple {8892#(<= 0 (+ 2147483638 g_~x))} call #t~ret0 := g(~x - 1); {8888#(<= 0 (+ |g_#in~x| 2147483639))} is VALID [2022-02-21 03:03:06,696 INFO L290 TraceCheckUtils]: 192: Hoare triple {8892#(<= 0 (+ 2147483638 g_~x))} assume ~x - 1 >= -2147483648; {8892#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:03:06,697 INFO L290 TraceCheckUtils]: 191: Hoare triple {8892#(<= 0 (+ 2147483638 g_~x))} assume ~x - 1 <= 2147483647; {8892#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:03:06,697 INFO L290 TraceCheckUtils]: 190: Hoare triple {8892#(<= 0 (+ 2147483638 g_~x))} assume !(0 == ~x); {8892#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:03:06,697 INFO L290 TraceCheckUtils]: 189: Hoare triple {8905#(<= 0 (+ 2147483638 |g_#in~x|))} ~x := #in~x; {8892#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:03:06,698 INFO L272 TraceCheckUtils]: 188: Hoare triple {8909#(<= 0 (+ g_~x 2147483637))} call #t~ret0 := g(~x - 1); {8905#(<= 0 (+ 2147483638 |g_#in~x|))} is VALID [2022-02-21 03:03:06,698 INFO L290 TraceCheckUtils]: 187: Hoare triple {8909#(<= 0 (+ g_~x 2147483637))} assume ~x - 1 >= -2147483648; {8909#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:03:06,698 INFO L290 TraceCheckUtils]: 186: Hoare triple {8909#(<= 0 (+ g_~x 2147483637))} assume ~x - 1 <= 2147483647; {8909#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:03:06,699 INFO L290 TraceCheckUtils]: 185: Hoare triple {8909#(<= 0 (+ g_~x 2147483637))} assume !(0 == ~x); {8909#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:03:06,699 INFO L290 TraceCheckUtils]: 184: Hoare triple {8922#(<= 0 (+ |g_#in~x| 2147483637))} ~x := #in~x; {8909#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:03:06,699 INFO L272 TraceCheckUtils]: 183: Hoare triple {8926#(<= 0 (+ g_~x 2147483636))} call #t~ret0 := g(~x - 1); {8922#(<= 0 (+ |g_#in~x| 2147483637))} is VALID [2022-02-21 03:03:06,700 INFO L290 TraceCheckUtils]: 182: Hoare triple {8926#(<= 0 (+ g_~x 2147483636))} assume ~x - 1 >= -2147483648; {8926#(<= 0 (+ g_~x 2147483636))} is VALID [2022-02-21 03:03:06,700 INFO L290 TraceCheckUtils]: 181: Hoare triple {8926#(<= 0 (+ g_~x 2147483636))} assume ~x - 1 <= 2147483647; {8926#(<= 0 (+ g_~x 2147483636))} is VALID [2022-02-21 03:03:06,700 INFO L290 TraceCheckUtils]: 180: Hoare triple {8926#(<= 0 (+ g_~x 2147483636))} assume !(0 == ~x); {8926#(<= 0 (+ g_~x 2147483636))} is VALID [2022-02-21 03:03:06,701 INFO L290 TraceCheckUtils]: 179: Hoare triple {8939#(<= 0 (+ |g_#in~x| 2147483636))} ~x := #in~x; {8926#(<= 0 (+ g_~x 2147483636))} is VALID [2022-02-21 03:03:06,701 INFO L272 TraceCheckUtils]: 178: Hoare triple {8943#(<= 0 (+ g_~x 2147483635))} call #t~ret0 := g(~x - 1); {8939#(<= 0 (+ |g_#in~x| 2147483636))} is VALID [2022-02-21 03:03:06,701 INFO L290 TraceCheckUtils]: 177: Hoare triple {8943#(<= 0 (+ g_~x 2147483635))} assume ~x - 1 >= -2147483648; {8943#(<= 0 (+ g_~x 2147483635))} is VALID [2022-02-21 03:03:06,702 INFO L290 TraceCheckUtils]: 176: Hoare triple {8943#(<= 0 (+ g_~x 2147483635))} assume ~x - 1 <= 2147483647; {8943#(<= 0 (+ g_~x 2147483635))} is VALID [2022-02-21 03:03:06,702 INFO L290 TraceCheckUtils]: 175: Hoare triple {8943#(<= 0 (+ g_~x 2147483635))} assume !(0 == ~x); {8943#(<= 0 (+ g_~x 2147483635))} is VALID [2022-02-21 03:03:06,702 INFO L290 TraceCheckUtils]: 174: Hoare triple {8956#(<= 0 (+ |g_#in~x| 2147483635))} ~x := #in~x; {8943#(<= 0 (+ g_~x 2147483635))} is VALID [2022-02-21 03:03:06,703 INFO L272 TraceCheckUtils]: 173: Hoare triple {8960#(<= 0 (+ g_~x 2147483634))} call #t~ret0 := g(~x - 1); {8956#(<= 0 (+ |g_#in~x| 2147483635))} is VALID [2022-02-21 03:03:06,703 INFO L290 TraceCheckUtils]: 172: Hoare triple {8960#(<= 0 (+ g_~x 2147483634))} assume ~x - 1 >= -2147483648; {8960#(<= 0 (+ g_~x 2147483634))} is VALID [2022-02-21 03:03:06,703 INFO L290 TraceCheckUtils]: 171: Hoare triple {8960#(<= 0 (+ g_~x 2147483634))} assume ~x - 1 <= 2147483647; {8960#(<= 0 (+ g_~x 2147483634))} is VALID [2022-02-21 03:03:06,704 INFO L290 TraceCheckUtils]: 170: Hoare triple {8960#(<= 0 (+ g_~x 2147483634))} assume !(0 == ~x); {8960#(<= 0 (+ g_~x 2147483634))} is VALID [2022-02-21 03:03:06,704 INFO L290 TraceCheckUtils]: 169: Hoare triple {8973#(<= 0 (+ |g_#in~x| 2147483634))} ~x := #in~x; {8960#(<= 0 (+ g_~x 2147483634))} is VALID [2022-02-21 03:03:06,704 INFO L272 TraceCheckUtils]: 168: Hoare triple {8977#(<= 0 (+ g_~x 2147483633))} call #t~ret0 := g(~x - 1); {8973#(<= 0 (+ |g_#in~x| 2147483634))} is VALID [2022-02-21 03:03:06,705 INFO L290 TraceCheckUtils]: 167: Hoare triple {8977#(<= 0 (+ g_~x 2147483633))} assume ~x - 1 >= -2147483648; {8977#(<= 0 (+ g_~x 2147483633))} is VALID [2022-02-21 03:03:06,705 INFO L290 TraceCheckUtils]: 166: Hoare triple {8977#(<= 0 (+ g_~x 2147483633))} assume ~x - 1 <= 2147483647; {8977#(<= 0 (+ g_~x 2147483633))} is VALID [2022-02-21 03:03:06,705 INFO L290 TraceCheckUtils]: 165: Hoare triple {8977#(<= 0 (+ g_~x 2147483633))} assume !(0 == ~x); {8977#(<= 0 (+ g_~x 2147483633))} is VALID [2022-02-21 03:03:06,706 INFO L290 TraceCheckUtils]: 164: Hoare triple {8990#(<= 0 (+ |g_#in~x| 2147483633))} ~x := #in~x; {8977#(<= 0 (+ g_~x 2147483633))} is VALID [2022-02-21 03:03:06,706 INFO L272 TraceCheckUtils]: 163: Hoare triple {8994#(<= 0 (+ 2147483632 g_~x))} call #t~ret0 := g(~x - 1); {8990#(<= 0 (+ |g_#in~x| 2147483633))} is VALID [2022-02-21 03:03:06,706 INFO L290 TraceCheckUtils]: 162: Hoare triple {8994#(<= 0 (+ 2147483632 g_~x))} assume ~x - 1 >= -2147483648; {8994#(<= 0 (+ 2147483632 g_~x))} is VALID [2022-02-21 03:03:06,707 INFO L290 TraceCheckUtils]: 161: Hoare triple {8994#(<= 0 (+ 2147483632 g_~x))} assume ~x - 1 <= 2147483647; {8994#(<= 0 (+ 2147483632 g_~x))} is VALID [2022-02-21 03:03:06,707 INFO L290 TraceCheckUtils]: 160: Hoare triple {8994#(<= 0 (+ 2147483632 g_~x))} assume !(0 == ~x); {8994#(<= 0 (+ 2147483632 g_~x))} is VALID [2022-02-21 03:03:06,707 INFO L290 TraceCheckUtils]: 159: Hoare triple {9007#(<= 0 (+ 2147483632 |g_#in~x|))} ~x := #in~x; {8994#(<= 0 (+ 2147483632 g_~x))} is VALID [2022-02-21 03:03:06,708 INFO L272 TraceCheckUtils]: 158: Hoare triple {9011#(<= 0 (+ g_~x 2147483631))} call #t~ret0 := g(~x - 1); {9007#(<= 0 (+ 2147483632 |g_#in~x|))} is VALID [2022-02-21 03:03:06,708 INFO L290 TraceCheckUtils]: 157: Hoare triple {9011#(<= 0 (+ g_~x 2147483631))} assume ~x - 1 >= -2147483648; {9011#(<= 0 (+ g_~x 2147483631))} is VALID [2022-02-21 03:03:06,708 INFO L290 TraceCheckUtils]: 156: Hoare triple {9011#(<= 0 (+ g_~x 2147483631))} assume ~x - 1 <= 2147483647; {9011#(<= 0 (+ g_~x 2147483631))} is VALID [2022-02-21 03:03:06,709 INFO L290 TraceCheckUtils]: 155: Hoare triple {9011#(<= 0 (+ g_~x 2147483631))} assume !(0 == ~x); {9011#(<= 0 (+ g_~x 2147483631))} is VALID [2022-02-21 03:03:06,709 INFO L290 TraceCheckUtils]: 154: Hoare triple {9024#(<= 0 (+ |g_#in~x| 2147483631))} ~x := #in~x; {9011#(<= 0 (+ g_~x 2147483631))} is VALID [2022-02-21 03:03:06,709 INFO L272 TraceCheckUtils]: 153: Hoare triple {9028#(<= 0 (+ g_~x 2147483630))} call #t~ret0 := g(~x - 1); {9024#(<= 0 (+ |g_#in~x| 2147483631))} is VALID [2022-02-21 03:03:06,713 INFO L290 TraceCheckUtils]: 152: Hoare triple {9028#(<= 0 (+ g_~x 2147483630))} assume ~x - 1 >= -2147483648; {9028#(<= 0 (+ g_~x 2147483630))} is VALID [2022-02-21 03:03:06,714 INFO L290 TraceCheckUtils]: 151: Hoare triple {9028#(<= 0 (+ g_~x 2147483630))} assume ~x - 1 <= 2147483647; {9028#(<= 0 (+ g_~x 2147483630))} is VALID [2022-02-21 03:03:06,714 INFO L290 TraceCheckUtils]: 150: Hoare triple {9028#(<= 0 (+ g_~x 2147483630))} assume !(0 == ~x); {9028#(<= 0 (+ g_~x 2147483630))} is VALID [2022-02-21 03:03:06,714 INFO L290 TraceCheckUtils]: 149: Hoare triple {9041#(<= 0 (+ |g_#in~x| 2147483630))} ~x := #in~x; {9028#(<= 0 (+ g_~x 2147483630))} is VALID [2022-02-21 03:03:06,715 INFO L272 TraceCheckUtils]: 148: Hoare triple {9045#(<= 0 (+ g_~x 2147483629))} call #t~ret0 := g(~x - 1); {9041#(<= 0 (+ |g_#in~x| 2147483630))} is VALID [2022-02-21 03:03:06,715 INFO L290 TraceCheckUtils]: 147: Hoare triple {9045#(<= 0 (+ g_~x 2147483629))} assume ~x - 1 >= -2147483648; {9045#(<= 0 (+ g_~x 2147483629))} is VALID [2022-02-21 03:03:06,716 INFO L290 TraceCheckUtils]: 146: Hoare triple {9045#(<= 0 (+ g_~x 2147483629))} assume ~x - 1 <= 2147483647; {9045#(<= 0 (+ g_~x 2147483629))} is VALID [2022-02-21 03:03:06,718 INFO L290 TraceCheckUtils]: 145: Hoare triple {9045#(<= 0 (+ g_~x 2147483629))} assume !(0 == ~x); {9045#(<= 0 (+ g_~x 2147483629))} is VALID [2022-02-21 03:03:06,718 INFO L290 TraceCheckUtils]: 144: Hoare triple {9058#(<= 0 (+ |g_#in~x| 2147483629))} ~x := #in~x; {9045#(<= 0 (+ g_~x 2147483629))} is VALID [2022-02-21 03:03:06,719 INFO L272 TraceCheckUtils]: 143: Hoare triple {9062#(<= 0 (+ g_~x 2147483628))} call #t~ret0 := g(~x - 1); {9058#(<= 0 (+ |g_#in~x| 2147483629))} is VALID [2022-02-21 03:03:06,722 INFO L290 TraceCheckUtils]: 142: Hoare triple {9062#(<= 0 (+ g_~x 2147483628))} assume ~x - 1 >= -2147483648; {9062#(<= 0 (+ g_~x 2147483628))} is VALID [2022-02-21 03:03:06,723 INFO L290 TraceCheckUtils]: 141: Hoare triple {9062#(<= 0 (+ g_~x 2147483628))} assume ~x - 1 <= 2147483647; {9062#(<= 0 (+ g_~x 2147483628))} is VALID [2022-02-21 03:03:06,723 INFO L290 TraceCheckUtils]: 140: Hoare triple {9062#(<= 0 (+ g_~x 2147483628))} assume !(0 == ~x); {9062#(<= 0 (+ g_~x 2147483628))} is VALID [2022-02-21 03:03:06,724 INFO L290 TraceCheckUtils]: 139: Hoare triple {9075#(<= 0 (+ |g_#in~x| 2147483628))} ~x := #in~x; {9062#(<= 0 (+ g_~x 2147483628))} is VALID [2022-02-21 03:03:06,724 INFO L272 TraceCheckUtils]: 138: Hoare triple {9079#(<= 0 (+ g_~x 2147483627))} call #t~ret0 := g(~x - 1); {9075#(<= 0 (+ |g_#in~x| 2147483628))} is VALID [2022-02-21 03:03:06,724 INFO L290 TraceCheckUtils]: 137: Hoare triple {9079#(<= 0 (+ g_~x 2147483627))} assume ~x - 1 >= -2147483648; {9079#(<= 0 (+ g_~x 2147483627))} is VALID [2022-02-21 03:03:06,727 INFO L290 TraceCheckUtils]: 136: Hoare triple {9079#(<= 0 (+ g_~x 2147483627))} assume ~x - 1 <= 2147483647; {9079#(<= 0 (+ g_~x 2147483627))} is VALID [2022-02-21 03:03:06,727 INFO L290 TraceCheckUtils]: 135: Hoare triple {9079#(<= 0 (+ g_~x 2147483627))} assume !(0 == ~x); {9079#(<= 0 (+ g_~x 2147483627))} is VALID [2022-02-21 03:03:06,728 INFO L290 TraceCheckUtils]: 134: Hoare triple {9092#(<= 0 (+ |g_#in~x| 2147483627))} ~x := #in~x; {9079#(<= 0 (+ g_~x 2147483627))} is VALID [2022-02-21 03:03:06,728 INFO L272 TraceCheckUtils]: 133: Hoare triple {9096#(<= 0 (+ 2147483626 g_~x))} call #t~ret0 := g(~x - 1); {9092#(<= 0 (+ |g_#in~x| 2147483627))} is VALID [2022-02-21 03:03:06,729 INFO L290 TraceCheckUtils]: 132: Hoare triple {9096#(<= 0 (+ 2147483626 g_~x))} assume ~x - 1 >= -2147483648; {9096#(<= 0 (+ 2147483626 g_~x))} is VALID [2022-02-21 03:03:06,729 INFO L290 TraceCheckUtils]: 131: Hoare triple {9096#(<= 0 (+ 2147483626 g_~x))} assume ~x - 1 <= 2147483647; {9096#(<= 0 (+ 2147483626 g_~x))} is VALID [2022-02-21 03:03:06,729 INFO L290 TraceCheckUtils]: 130: Hoare triple {9096#(<= 0 (+ 2147483626 g_~x))} assume !(0 == ~x); {9096#(<= 0 (+ 2147483626 g_~x))} is VALID [2022-02-21 03:03:06,729 INFO L290 TraceCheckUtils]: 129: Hoare triple {9109#(<= 0 (+ 2147483626 |g_#in~x|))} ~x := #in~x; {9096#(<= 0 (+ 2147483626 g_~x))} is VALID [2022-02-21 03:03:06,730 INFO L272 TraceCheckUtils]: 128: Hoare triple {9113#(<= 0 (+ 2147483625 g_~x))} call #t~ret0 := g(~x - 1); {9109#(<= 0 (+ 2147483626 |g_#in~x|))} is VALID [2022-02-21 03:03:06,730 INFO L290 TraceCheckUtils]: 127: Hoare triple {9113#(<= 0 (+ 2147483625 g_~x))} assume ~x - 1 >= -2147483648; {9113#(<= 0 (+ 2147483625 g_~x))} is VALID [2022-02-21 03:03:06,731 INFO L290 TraceCheckUtils]: 126: Hoare triple {9113#(<= 0 (+ 2147483625 g_~x))} assume ~x - 1 <= 2147483647; {9113#(<= 0 (+ 2147483625 g_~x))} is VALID [2022-02-21 03:03:06,731 INFO L290 TraceCheckUtils]: 125: Hoare triple {9113#(<= 0 (+ 2147483625 g_~x))} assume !(0 == ~x); {9113#(<= 0 (+ 2147483625 g_~x))} is VALID [2022-02-21 03:03:06,731 INFO L290 TraceCheckUtils]: 124: Hoare triple {9126#(<= 0 (+ 2147483625 |g_#in~x|))} ~x := #in~x; {9113#(<= 0 (+ 2147483625 g_~x))} is VALID [2022-02-21 03:03:06,732 INFO L272 TraceCheckUtils]: 123: Hoare triple {9130#(<= 0 (+ 2147483624 g_~x))} call #t~ret0 := g(~x - 1); {9126#(<= 0 (+ 2147483625 |g_#in~x|))} is VALID [2022-02-21 03:03:06,732 INFO L290 TraceCheckUtils]: 122: Hoare triple {9130#(<= 0 (+ 2147483624 g_~x))} assume ~x - 1 >= -2147483648; {9130#(<= 0 (+ 2147483624 g_~x))} is VALID [2022-02-21 03:03:06,732 INFO L290 TraceCheckUtils]: 121: Hoare triple {9130#(<= 0 (+ 2147483624 g_~x))} assume ~x - 1 <= 2147483647; {9130#(<= 0 (+ 2147483624 g_~x))} is VALID [2022-02-21 03:03:06,732 INFO L290 TraceCheckUtils]: 120: Hoare triple {9130#(<= 0 (+ 2147483624 g_~x))} assume !(0 == ~x); {9130#(<= 0 (+ 2147483624 g_~x))} is VALID [2022-02-21 03:03:06,733 INFO L290 TraceCheckUtils]: 119: Hoare triple {9143#(<= 0 (+ 2147483624 |g_#in~x|))} ~x := #in~x; {9130#(<= 0 (+ 2147483624 g_~x))} is VALID [2022-02-21 03:03:06,733 INFO L272 TraceCheckUtils]: 118: Hoare triple {9147#(<= 0 (+ 2147483623 g_~x))} call #t~ret0 := g(~x - 1); {9143#(<= 0 (+ 2147483624 |g_#in~x|))} is VALID [2022-02-21 03:03:06,733 INFO L290 TraceCheckUtils]: 117: Hoare triple {9147#(<= 0 (+ 2147483623 g_~x))} assume ~x - 1 >= -2147483648; {9147#(<= 0 (+ 2147483623 g_~x))} is VALID [2022-02-21 03:03:06,734 INFO L290 TraceCheckUtils]: 116: Hoare triple {9147#(<= 0 (+ 2147483623 g_~x))} assume ~x - 1 <= 2147483647; {9147#(<= 0 (+ 2147483623 g_~x))} is VALID [2022-02-21 03:03:06,734 INFO L290 TraceCheckUtils]: 115: Hoare triple {9147#(<= 0 (+ 2147483623 g_~x))} assume !(0 == ~x); {9147#(<= 0 (+ 2147483623 g_~x))} is VALID [2022-02-21 03:03:06,734 INFO L290 TraceCheckUtils]: 114: Hoare triple {9160#(<= 0 (+ |g_#in~x| 2147483623))} ~x := #in~x; {9147#(<= 0 (+ 2147483623 g_~x))} is VALID [2022-02-21 03:03:06,735 INFO L272 TraceCheckUtils]: 113: Hoare triple {9164#(<= 0 (+ g_~x 2147483622))} call #t~ret0 := g(~x - 1); {9160#(<= 0 (+ |g_#in~x| 2147483623))} is VALID [2022-02-21 03:03:06,735 INFO L290 TraceCheckUtils]: 112: Hoare triple {9164#(<= 0 (+ g_~x 2147483622))} assume ~x - 1 >= -2147483648; {9164#(<= 0 (+ g_~x 2147483622))} is VALID [2022-02-21 03:03:06,735 INFO L290 TraceCheckUtils]: 111: Hoare triple {9164#(<= 0 (+ g_~x 2147483622))} assume ~x - 1 <= 2147483647; {9164#(<= 0 (+ g_~x 2147483622))} is VALID [2022-02-21 03:03:06,736 INFO L290 TraceCheckUtils]: 110: Hoare triple {9164#(<= 0 (+ g_~x 2147483622))} assume !(0 == ~x); {9164#(<= 0 (+ g_~x 2147483622))} is VALID [2022-02-21 03:03:06,736 INFO L290 TraceCheckUtils]: 109: Hoare triple {9177#(<= 0 (+ |g_#in~x| 2147483622))} ~x := #in~x; {9164#(<= 0 (+ g_~x 2147483622))} is VALID [2022-02-21 03:03:06,736 INFO L272 TraceCheckUtils]: 108: Hoare triple {9181#(<= 0 (+ 2147483621 g_~x))} call #t~ret0 := g(~x - 1); {9177#(<= 0 (+ |g_#in~x| 2147483622))} is VALID [2022-02-21 03:03:06,737 INFO L290 TraceCheckUtils]: 107: Hoare triple {9181#(<= 0 (+ 2147483621 g_~x))} assume ~x - 1 >= -2147483648; {9181#(<= 0 (+ 2147483621 g_~x))} is VALID [2022-02-21 03:03:06,737 INFO L290 TraceCheckUtils]: 106: Hoare triple {9181#(<= 0 (+ 2147483621 g_~x))} assume ~x - 1 <= 2147483647; {9181#(<= 0 (+ 2147483621 g_~x))} is VALID [2022-02-21 03:03:06,737 INFO L290 TraceCheckUtils]: 105: Hoare triple {9181#(<= 0 (+ 2147483621 g_~x))} assume !(0 == ~x); {9181#(<= 0 (+ 2147483621 g_~x))} is VALID [2022-02-21 03:03:06,737 INFO L290 TraceCheckUtils]: 104: Hoare triple {9194#(<= 0 (+ 2147483621 |g_#in~x|))} ~x := #in~x; {9181#(<= 0 (+ 2147483621 g_~x))} is VALID [2022-02-21 03:03:06,738 INFO L272 TraceCheckUtils]: 103: Hoare triple {9198#(<= 0 (+ g_~x 2147483620))} call #t~ret0 := g(~x - 1); {9194#(<= 0 (+ 2147483621 |g_#in~x|))} is VALID [2022-02-21 03:03:06,738 INFO L290 TraceCheckUtils]: 102: Hoare triple {9198#(<= 0 (+ g_~x 2147483620))} assume ~x - 1 >= -2147483648; {9198#(<= 0 (+ g_~x 2147483620))} is VALID [2022-02-21 03:03:06,738 INFO L290 TraceCheckUtils]: 101: Hoare triple {9198#(<= 0 (+ g_~x 2147483620))} assume ~x - 1 <= 2147483647; {9198#(<= 0 (+ g_~x 2147483620))} is VALID [2022-02-21 03:03:06,739 INFO L290 TraceCheckUtils]: 100: Hoare triple {9198#(<= 0 (+ g_~x 2147483620))} assume !(0 == ~x); {9198#(<= 0 (+ g_~x 2147483620))} is VALID [2022-02-21 03:03:06,739 INFO L290 TraceCheckUtils]: 99: Hoare triple {9211#(<= 0 (+ |g_#in~x| 2147483620))} ~x := #in~x; {9198#(<= 0 (+ g_~x 2147483620))} is VALID [2022-02-21 03:03:06,739 INFO L272 TraceCheckUtils]: 98: Hoare triple {9215#(<= 0 (+ g_~x 2147483619))} call #t~ret0 := g(~x - 1); {9211#(<= 0 (+ |g_#in~x| 2147483620))} is VALID [2022-02-21 03:03:06,740 INFO L290 TraceCheckUtils]: 97: Hoare triple {9215#(<= 0 (+ g_~x 2147483619))} assume ~x - 1 >= -2147483648; {9215#(<= 0 (+ g_~x 2147483619))} is VALID [2022-02-21 03:03:06,740 INFO L290 TraceCheckUtils]: 96: Hoare triple {9215#(<= 0 (+ g_~x 2147483619))} assume ~x - 1 <= 2147483647; {9215#(<= 0 (+ g_~x 2147483619))} is VALID [2022-02-21 03:03:06,740 INFO L290 TraceCheckUtils]: 95: Hoare triple {9215#(<= 0 (+ g_~x 2147483619))} assume !(0 == ~x); {9215#(<= 0 (+ g_~x 2147483619))} is VALID [2022-02-21 03:03:06,741 INFO L290 TraceCheckUtils]: 94: Hoare triple {9228#(<= 0 (+ |g_#in~x| 2147483619))} ~x := #in~x; {9215#(<= 0 (+ g_~x 2147483619))} is VALID [2022-02-21 03:03:06,741 INFO L272 TraceCheckUtils]: 93: Hoare triple {9232#(<= 0 (+ 2147483618 g_~x))} call #t~ret0 := g(~x - 1); {9228#(<= 0 (+ |g_#in~x| 2147483619))} is VALID [2022-02-21 03:03:06,741 INFO L290 TraceCheckUtils]: 92: Hoare triple {9232#(<= 0 (+ 2147483618 g_~x))} assume ~x - 1 >= -2147483648; {9232#(<= 0 (+ 2147483618 g_~x))} is VALID [2022-02-21 03:03:06,742 INFO L290 TraceCheckUtils]: 91: Hoare triple {9232#(<= 0 (+ 2147483618 g_~x))} assume ~x - 1 <= 2147483647; {9232#(<= 0 (+ 2147483618 g_~x))} is VALID [2022-02-21 03:03:06,742 INFO L290 TraceCheckUtils]: 90: Hoare triple {9232#(<= 0 (+ 2147483618 g_~x))} assume !(0 == ~x); {9232#(<= 0 (+ 2147483618 g_~x))} is VALID [2022-02-21 03:03:06,742 INFO L290 TraceCheckUtils]: 89: Hoare triple {9245#(<= 0 (+ 2147483618 |g_#in~x|))} ~x := #in~x; {9232#(<= 0 (+ 2147483618 g_~x))} is VALID [2022-02-21 03:03:06,743 INFO L272 TraceCheckUtils]: 88: Hoare triple {9249#(<= 0 (+ 2147483617 g_~x))} call #t~ret0 := g(~x - 1); {9245#(<= 0 (+ 2147483618 |g_#in~x|))} is VALID [2022-02-21 03:03:06,743 INFO L290 TraceCheckUtils]: 87: Hoare triple {9249#(<= 0 (+ 2147483617 g_~x))} assume ~x - 1 >= -2147483648; {9249#(<= 0 (+ 2147483617 g_~x))} is VALID [2022-02-21 03:03:06,743 INFO L290 TraceCheckUtils]: 86: Hoare triple {9249#(<= 0 (+ 2147483617 g_~x))} assume ~x - 1 <= 2147483647; {9249#(<= 0 (+ 2147483617 g_~x))} is VALID [2022-02-21 03:03:06,743 INFO L290 TraceCheckUtils]: 85: Hoare triple {9249#(<= 0 (+ 2147483617 g_~x))} assume !(0 == ~x); {9249#(<= 0 (+ 2147483617 g_~x))} is VALID [2022-02-21 03:03:06,744 INFO L290 TraceCheckUtils]: 84: Hoare triple {9262#(<= 0 (+ 2147483617 |g_#in~x|))} ~x := #in~x; {9249#(<= 0 (+ 2147483617 g_~x))} is VALID [2022-02-21 03:03:06,744 INFO L272 TraceCheckUtils]: 83: Hoare triple {9266#(<= 0 (+ g_~x 2147483616))} call #t~ret0 := g(~x - 1); {9262#(<= 0 (+ 2147483617 |g_#in~x|))} is VALID [2022-02-21 03:03:06,744 INFO L290 TraceCheckUtils]: 82: Hoare triple {9266#(<= 0 (+ g_~x 2147483616))} assume ~x - 1 >= -2147483648; {9266#(<= 0 (+ g_~x 2147483616))} is VALID [2022-02-21 03:03:06,745 INFO L290 TraceCheckUtils]: 81: Hoare triple {9266#(<= 0 (+ g_~x 2147483616))} assume ~x - 1 <= 2147483647; {9266#(<= 0 (+ g_~x 2147483616))} is VALID [2022-02-21 03:03:06,745 INFO L290 TraceCheckUtils]: 80: Hoare triple {9266#(<= 0 (+ g_~x 2147483616))} assume !(0 == ~x); {9266#(<= 0 (+ g_~x 2147483616))} is VALID [2022-02-21 03:03:06,745 INFO L290 TraceCheckUtils]: 79: Hoare triple {9279#(<= 0 (+ |g_#in~x| 2147483616))} ~x := #in~x; {9266#(<= 0 (+ g_~x 2147483616))} is VALID [2022-02-21 03:03:06,746 INFO L272 TraceCheckUtils]: 78: Hoare triple {9283#(<= 0 (+ g_~x 2147483615))} call #t~ret0 := g(~x - 1); {9279#(<= 0 (+ |g_#in~x| 2147483616))} is VALID [2022-02-21 03:03:06,746 INFO L290 TraceCheckUtils]: 77: Hoare triple {9283#(<= 0 (+ g_~x 2147483615))} assume ~x - 1 >= -2147483648; {9283#(<= 0 (+ g_~x 2147483615))} is VALID [2022-02-21 03:03:06,746 INFO L290 TraceCheckUtils]: 76: Hoare triple {9283#(<= 0 (+ g_~x 2147483615))} assume ~x - 1 <= 2147483647; {9283#(<= 0 (+ g_~x 2147483615))} is VALID [2022-02-21 03:03:06,747 INFO L290 TraceCheckUtils]: 75: Hoare triple {9283#(<= 0 (+ g_~x 2147483615))} assume !(0 == ~x); {9283#(<= 0 (+ g_~x 2147483615))} is VALID [2022-02-21 03:03:06,747 INFO L290 TraceCheckUtils]: 74: Hoare triple {9296#(<= 0 (+ |g_#in~x| 2147483615))} ~x := #in~x; {9283#(<= 0 (+ g_~x 2147483615))} is VALID [2022-02-21 03:03:06,747 INFO L272 TraceCheckUtils]: 73: Hoare triple {9300#(<= 0 (+ g_~x 2147483614))} call #t~ret0 := g(~x - 1); {9296#(<= 0 (+ |g_#in~x| 2147483615))} is VALID [2022-02-21 03:03:06,748 INFO L290 TraceCheckUtils]: 72: Hoare triple {9300#(<= 0 (+ g_~x 2147483614))} assume ~x - 1 >= -2147483648; {9300#(<= 0 (+ g_~x 2147483614))} is VALID [2022-02-21 03:03:06,748 INFO L290 TraceCheckUtils]: 71: Hoare triple {9300#(<= 0 (+ g_~x 2147483614))} assume ~x - 1 <= 2147483647; {9300#(<= 0 (+ g_~x 2147483614))} is VALID [2022-02-21 03:03:06,748 INFO L290 TraceCheckUtils]: 70: Hoare triple {9300#(<= 0 (+ g_~x 2147483614))} assume !(0 == ~x); {9300#(<= 0 (+ g_~x 2147483614))} is VALID [2022-02-21 03:03:06,748 INFO L290 TraceCheckUtils]: 69: Hoare triple {9313#(<= 0 (+ |g_#in~x| 2147483614))} ~x := #in~x; {9300#(<= 0 (+ g_~x 2147483614))} is VALID [2022-02-21 03:03:06,749 INFO L272 TraceCheckUtils]: 68: Hoare triple {9317#(<= 0 (+ 2147483613 g_~x))} call #t~ret0 := g(~x - 1); {9313#(<= 0 (+ |g_#in~x| 2147483614))} is VALID [2022-02-21 03:03:06,749 INFO L290 TraceCheckUtils]: 67: Hoare triple {9317#(<= 0 (+ 2147483613 g_~x))} assume ~x - 1 >= -2147483648; {9317#(<= 0 (+ 2147483613 g_~x))} is VALID [2022-02-21 03:03:06,750 INFO L290 TraceCheckUtils]: 66: Hoare triple {9317#(<= 0 (+ 2147483613 g_~x))} assume ~x - 1 <= 2147483647; {9317#(<= 0 (+ 2147483613 g_~x))} is VALID [2022-02-21 03:03:06,750 INFO L290 TraceCheckUtils]: 65: Hoare triple {9317#(<= 0 (+ 2147483613 g_~x))} assume !(0 == ~x); {9317#(<= 0 (+ 2147483613 g_~x))} is VALID [2022-02-21 03:03:06,750 INFO L290 TraceCheckUtils]: 64: Hoare triple {9330#(<= 0 (+ |g_#in~x| 2147483613))} ~x := #in~x; {9317#(<= 0 (+ 2147483613 g_~x))} is VALID [2022-02-21 03:03:06,751 INFO L272 TraceCheckUtils]: 63: Hoare triple {9334#(<= 0 (+ 2147483612 g_~x))} call #t~ret0 := g(~x - 1); {9330#(<= 0 (+ |g_#in~x| 2147483613))} is VALID [2022-02-21 03:03:06,751 INFO L290 TraceCheckUtils]: 62: Hoare triple {9334#(<= 0 (+ 2147483612 g_~x))} assume ~x - 1 >= -2147483648; {9334#(<= 0 (+ 2147483612 g_~x))} is VALID [2022-02-21 03:03:06,751 INFO L290 TraceCheckUtils]: 61: Hoare triple {9334#(<= 0 (+ 2147483612 g_~x))} assume ~x - 1 <= 2147483647; {9334#(<= 0 (+ 2147483612 g_~x))} is VALID [2022-02-21 03:03:06,752 INFO L290 TraceCheckUtils]: 60: Hoare triple {9334#(<= 0 (+ 2147483612 g_~x))} assume !(0 == ~x); {9334#(<= 0 (+ 2147483612 g_~x))} is VALID [2022-02-21 03:03:06,752 INFO L290 TraceCheckUtils]: 59: Hoare triple {9347#(<= 0 (+ 2147483612 |g_#in~x|))} ~x := #in~x; {9334#(<= 0 (+ 2147483612 g_~x))} is VALID [2022-02-21 03:03:06,752 INFO L272 TraceCheckUtils]: 58: Hoare triple {9351#(<= 0 (+ 2147483611 g_~x))} call #t~ret0 := g(~x - 1); {9347#(<= 0 (+ 2147483612 |g_#in~x|))} is VALID [2022-02-21 03:03:06,753 INFO L290 TraceCheckUtils]: 57: Hoare triple {9351#(<= 0 (+ 2147483611 g_~x))} assume ~x - 1 >= -2147483648; {9351#(<= 0 (+ 2147483611 g_~x))} is VALID [2022-02-21 03:03:06,753 INFO L290 TraceCheckUtils]: 56: Hoare triple {9351#(<= 0 (+ 2147483611 g_~x))} assume ~x - 1 <= 2147483647; {9351#(<= 0 (+ 2147483611 g_~x))} is VALID [2022-02-21 03:03:06,753 INFO L290 TraceCheckUtils]: 55: Hoare triple {9351#(<= 0 (+ 2147483611 g_~x))} assume !(0 == ~x); {9351#(<= 0 (+ 2147483611 g_~x))} is VALID [2022-02-21 03:03:06,754 INFO L290 TraceCheckUtils]: 54: Hoare triple {9364#(<= 0 (+ 2147483611 |g_#in~x|))} ~x := #in~x; {9351#(<= 0 (+ 2147483611 g_~x))} is VALID [2022-02-21 03:03:06,754 INFO L272 TraceCheckUtils]: 53: Hoare triple {9368#(<= 0 (+ g_~x 2147483610))} call #t~ret0 := g(~x - 1); {9364#(<= 0 (+ 2147483611 |g_#in~x|))} is VALID [2022-02-21 03:03:06,755 INFO L290 TraceCheckUtils]: 52: Hoare triple {9368#(<= 0 (+ g_~x 2147483610))} assume ~x - 1 >= -2147483648; {9368#(<= 0 (+ g_~x 2147483610))} is VALID [2022-02-21 03:03:06,755 INFO L290 TraceCheckUtils]: 51: Hoare triple {9368#(<= 0 (+ g_~x 2147483610))} assume ~x - 1 <= 2147483647; {9368#(<= 0 (+ g_~x 2147483610))} is VALID [2022-02-21 03:03:06,755 INFO L290 TraceCheckUtils]: 50: Hoare triple {9368#(<= 0 (+ g_~x 2147483610))} assume !(0 == ~x); {9368#(<= 0 (+ g_~x 2147483610))} is VALID [2022-02-21 03:03:06,755 INFO L290 TraceCheckUtils]: 49: Hoare triple {9381#(<= 0 (+ |g_#in~x| 2147483610))} ~x := #in~x; {9368#(<= 0 (+ g_~x 2147483610))} is VALID [2022-02-21 03:03:06,756 INFO L272 TraceCheckUtils]: 48: Hoare triple {9385#(<= 0 (+ g_~x 2147483609))} call #t~ret0 := g(~x - 1); {9381#(<= 0 (+ |g_#in~x| 2147483610))} is VALID [2022-02-21 03:03:06,756 INFO L290 TraceCheckUtils]: 47: Hoare triple {9385#(<= 0 (+ g_~x 2147483609))} assume ~x - 1 >= -2147483648; {9385#(<= 0 (+ g_~x 2147483609))} is VALID [2022-02-21 03:03:06,756 INFO L290 TraceCheckUtils]: 46: Hoare triple {9385#(<= 0 (+ g_~x 2147483609))} assume ~x - 1 <= 2147483647; {9385#(<= 0 (+ g_~x 2147483609))} is VALID [2022-02-21 03:03:06,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {9385#(<= 0 (+ g_~x 2147483609))} assume !(0 == ~x); {9385#(<= 0 (+ g_~x 2147483609))} is VALID [2022-02-21 03:03:06,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {9398#(<= 0 (+ |g_#in~x| 2147483609))} ~x := #in~x; {9385#(<= 0 (+ g_~x 2147483609))} is VALID [2022-02-21 03:03:06,757 INFO L272 TraceCheckUtils]: 43: Hoare triple {9402#(<= 0 (+ g_~x 2147483608))} call #t~ret0 := g(~x - 1); {9398#(<= 0 (+ |g_#in~x| 2147483609))} is VALID [2022-02-21 03:03:06,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {9402#(<= 0 (+ g_~x 2147483608))} assume ~x - 1 >= -2147483648; {9402#(<= 0 (+ g_~x 2147483608))} is VALID [2022-02-21 03:03:06,758 INFO L290 TraceCheckUtils]: 41: Hoare triple {9402#(<= 0 (+ g_~x 2147483608))} assume ~x - 1 <= 2147483647; {9402#(<= 0 (+ g_~x 2147483608))} is VALID [2022-02-21 03:03:06,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {9402#(<= 0 (+ g_~x 2147483608))} assume !(0 == ~x); {9402#(<= 0 (+ g_~x 2147483608))} is VALID [2022-02-21 03:03:06,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {9415#(<= 0 (+ |g_#in~x| 2147483608))} ~x := #in~x; {9402#(<= 0 (+ g_~x 2147483608))} is VALID [2022-02-21 03:03:06,759 INFO L272 TraceCheckUtils]: 38: Hoare triple {9419#(<= 0 (+ g_~x 2147483607))} call #t~ret0 := g(~x - 1); {9415#(<= 0 (+ |g_#in~x| 2147483608))} is VALID [2022-02-21 03:03:06,759 INFO L290 TraceCheckUtils]: 37: Hoare triple {9419#(<= 0 (+ g_~x 2147483607))} assume ~x - 1 >= -2147483648; {9419#(<= 0 (+ g_~x 2147483607))} is VALID [2022-02-21 03:03:06,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {9419#(<= 0 (+ g_~x 2147483607))} assume ~x - 1 <= 2147483647; {9419#(<= 0 (+ g_~x 2147483607))} is VALID [2022-02-21 03:03:06,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {9419#(<= 0 (+ g_~x 2147483607))} assume !(0 == ~x); {9419#(<= 0 (+ g_~x 2147483607))} is VALID [2022-02-21 03:03:06,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {9432#(<= 0 (+ |g_#in~x| 2147483607))} ~x := #in~x; {9419#(<= 0 (+ g_~x 2147483607))} is VALID [2022-02-21 03:03:06,761 INFO L272 TraceCheckUtils]: 33: Hoare triple {9436#(<= 0 (+ 2147483606 g_~x))} call #t~ret0 := g(~x - 1); {9432#(<= 0 (+ |g_#in~x| 2147483607))} is VALID [2022-02-21 03:03:06,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {9436#(<= 0 (+ 2147483606 g_~x))} assume ~x - 1 >= -2147483648; {9436#(<= 0 (+ 2147483606 g_~x))} is VALID [2022-02-21 03:03:06,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {9436#(<= 0 (+ 2147483606 g_~x))} assume ~x - 1 <= 2147483647; {9436#(<= 0 (+ 2147483606 g_~x))} is VALID [2022-02-21 03:03:06,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {9436#(<= 0 (+ 2147483606 g_~x))} assume !(0 == ~x); {9436#(<= 0 (+ 2147483606 g_~x))} is VALID [2022-02-21 03:03:06,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {9449#(<= 0 (+ 2147483606 |g_#in~x|))} ~x := #in~x; {9436#(<= 0 (+ 2147483606 g_~x))} is VALID [2022-02-21 03:03:06,762 INFO L272 TraceCheckUtils]: 28: Hoare triple {9453#(<= 0 (+ g_~x 2147483605))} call #t~ret0 := g(~x - 1); {9449#(<= 0 (+ 2147483606 |g_#in~x|))} is VALID [2022-02-21 03:03:06,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {9453#(<= 0 (+ g_~x 2147483605))} assume ~x - 1 >= -2147483648; {9453#(<= 0 (+ g_~x 2147483605))} is VALID [2022-02-21 03:03:06,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {9453#(<= 0 (+ g_~x 2147483605))} assume ~x - 1 <= 2147483647; {9453#(<= 0 (+ g_~x 2147483605))} is VALID [2022-02-21 03:03:06,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {9453#(<= 0 (+ g_~x 2147483605))} assume !(0 == ~x); {9453#(<= 0 (+ g_~x 2147483605))} is VALID [2022-02-21 03:03:06,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {9466#(<= 0 (+ |g_#in~x| 2147483605))} ~x := #in~x; {9453#(<= 0 (+ g_~x 2147483605))} is VALID [2022-02-21 03:03:06,764 INFO L272 TraceCheckUtils]: 23: Hoare triple {9470#(<= 0 (+ 2147483604 g_~x))} call #t~ret0 := g(~x - 1); {9466#(<= 0 (+ |g_#in~x| 2147483605))} is VALID [2022-02-21 03:03:06,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {9470#(<= 0 (+ 2147483604 g_~x))} assume ~x - 1 >= -2147483648; {9470#(<= 0 (+ 2147483604 g_~x))} is VALID [2022-02-21 03:03:06,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {9470#(<= 0 (+ 2147483604 g_~x))} assume ~x - 1 <= 2147483647; {9470#(<= 0 (+ 2147483604 g_~x))} is VALID [2022-02-21 03:03:06,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {9470#(<= 0 (+ 2147483604 g_~x))} assume !(0 == ~x); {9470#(<= 0 (+ 2147483604 g_~x))} is VALID [2022-02-21 03:03:06,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {9483#(<= 0 (+ |g_#in~x| 2147483604))} ~x := #in~x; {9470#(<= 0 (+ 2147483604 g_~x))} is VALID [2022-02-21 03:03:06,765 INFO L272 TraceCheckUtils]: 18: Hoare triple {9487#(<= 0 (+ 2147483603 g_~x))} call #t~ret0 := g(~x - 1); {9483#(<= 0 (+ |g_#in~x| 2147483604))} is VALID [2022-02-21 03:03:06,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {9487#(<= 0 (+ 2147483603 g_~x))} assume ~x - 1 >= -2147483648; {9487#(<= 0 (+ 2147483603 g_~x))} is VALID [2022-02-21 03:03:06,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {9487#(<= 0 (+ 2147483603 g_~x))} assume ~x - 1 <= 2147483647; {9487#(<= 0 (+ 2147483603 g_~x))} is VALID [2022-02-21 03:03:06,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {9487#(<= 0 (+ 2147483603 g_~x))} assume !(0 == ~x); {9487#(<= 0 (+ 2147483603 g_~x))} is VALID [2022-02-21 03:03:06,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {9500#(<= 0 (+ 2147483603 |g_#in~x|))} ~x := #in~x; {9487#(<= 0 (+ 2147483603 g_~x))} is VALID [2022-02-21 03:03:06,767 INFO L272 TraceCheckUtils]: 13: Hoare triple {9504#(<= 0 (+ 2147483602 g_~x))} call #t~ret0 := g(~x - 1); {9500#(<= 0 (+ 2147483603 |g_#in~x|))} is VALID [2022-02-21 03:03:06,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {9504#(<= 0 (+ 2147483602 g_~x))} assume ~x - 1 >= -2147483648; {9504#(<= 0 (+ 2147483602 g_~x))} is VALID [2022-02-21 03:03:06,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {9504#(<= 0 (+ 2147483602 g_~x))} assume ~x - 1 <= 2147483647; {9504#(<= 0 (+ 2147483602 g_~x))} is VALID [2022-02-21 03:03:06,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {9504#(<= 0 (+ 2147483602 g_~x))} assume !(0 == ~x); {9504#(<= 0 (+ 2147483602 g_~x))} is VALID [2022-02-21 03:03:06,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {9517#(<= 0 (+ |g_#in~x| 2147483602))} ~x := #in~x; {9504#(<= 0 (+ 2147483602 g_~x))} is VALID [2022-02-21 03:03:06,769 INFO L272 TraceCheckUtils]: 8: Hoare triple {9521#(<= 0 (+ g_~x 2147483601))} call #t~ret0 := g(~x - 1); {9517#(<= 0 (+ |g_#in~x| 2147483602))} is VALID [2022-02-21 03:03:06,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {9521#(<= 0 (+ g_~x 2147483601))} assume ~x - 1 >= -2147483648; {9521#(<= 0 (+ g_~x 2147483601))} is VALID [2022-02-21 03:03:06,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {9521#(<= 0 (+ g_~x 2147483601))} assume ~x - 1 <= 2147483647; {9521#(<= 0 (+ g_~x 2147483601))} is VALID [2022-02-21 03:03:06,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {9521#(<= 0 (+ g_~x 2147483601))} assume !(0 == ~x); {9521#(<= 0 (+ g_~x 2147483601))} is VALID [2022-02-21 03:03:06,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {9534#(<= 0 (+ |g_#in~x| 2147483601))} ~x := #in~x; {9521#(<= 0 (+ g_~x 2147483601))} is VALID [2022-02-21 03:03:06,770 INFO L272 TraceCheckUtils]: 3: Hoare triple {9538#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483601))} call main_#t~ret3#1 := g(main_~x~0#1); {9534#(<= 0 (+ |g_#in~x| 2147483601))} is VALID [2022-02-21 03:03:06,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {7931#true} assume !(main_~x~0#1 < 0); {9538#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483601))} is VALID [2022-02-21 03:03:06,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {7931#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {7931#true} is VALID [2022-02-21 03:03:06,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {7931#true} assume { :begin_inline_ULTIMATE.init } true; {7931#true} is VALID [2022-02-21 03:03:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:06,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34976853] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:06,773 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:06,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2022-02-21 03:03:06,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388499807] [2022-02-21 03:03:06,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:06,775 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 189 states have (on average 2.0105820105820107) internal successors, (380), 98 states have internal predecessors, (380), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2022-02-21 03:03:06,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:06,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 192 states, 189 states have (on average 2.0105820105820107) internal successors, (380), 98 states have internal predecessors, (380), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:07,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:07,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2022-02-21 03:03:07,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:07,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2022-02-21 03:03:07,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2022-02-21 03:03:07,086 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand has 192 states, 189 states have (on average 2.0105820105820107) internal successors, (380), 98 states have internal predecessors, (380), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:14,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:14,242 INFO L93 Difference]: Finished difference Result 481 states and 528 transitions. [2022-02-21 03:03:14,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2022-02-21 03:03:14,243 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 189 states have (on average 2.0105820105820107) internal successors, (380), 98 states have internal predecessors, (380), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2022-02-21 03:03:14,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 189 states have (on average 2.0105820105820107) internal successors, (380), 98 states have internal predecessors, (380), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 528 transitions. [2022-02-21 03:03:14,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 189 states have (on average 2.0105820105820107) internal successors, (380), 98 states have internal predecessors, (380), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 528 transitions. [2022-02-21 03:03:14,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 192 states and 528 transitions. [2022-02-21 03:03:14,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 528 edges. 528 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:14,605 INFO L225 Difference]: With dead ends: 481 [2022-02-21 03:03:14,605 INFO L226 Difference]: Without dead ends: 480 [2022-02-21 03:03:14,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 379 SyntacticMatches, 1 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=22613, Invalid=58897, Unknown=0, NotChecked=0, Total=81510 [2022-02-21 03:03:14,612 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 1709 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:14,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1709 Valid, 47 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 03:03:14,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-02-21 03:03:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 479. [2022-02-21 03:03:15,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:15,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 480 states. Second operand has 479 states, 383 states have (on average 1.0026109660574412) internal successors, (384), 383 states have internal predecessors, (384), 95 states have call successors, (95), 95 states have call predecessors, (95), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:15,081 INFO L74 IsIncluded]: Start isIncluded. First operand 480 states. Second operand has 479 states, 383 states have (on average 1.0026109660574412) internal successors, (384), 383 states have internal predecessors, (384), 95 states have call successors, (95), 95 states have call predecessors, (95), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:15,081 INFO L87 Difference]: Start difference. First operand 480 states. Second operand has 479 states, 383 states have (on average 1.0026109660574412) internal successors, (384), 383 states have internal predecessors, (384), 95 states have call successors, (95), 95 states have call predecessors, (95), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:15,091 INFO L93 Difference]: Finished difference Result 480 states and 480 transitions. [2022-02-21 03:03:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 480 transitions. [2022-02-21 03:03:15,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:15,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:15,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 479 states, 383 states have (on average 1.0026109660574412) internal successors, (384), 383 states have internal predecessors, (384), 95 states have call successors, (95), 95 states have call predecessors, (95), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 480 states. [2022-02-21 03:03:15,093 INFO L87 Difference]: Start difference. First operand has 479 states, 383 states have (on average 1.0026109660574412) internal successors, (384), 383 states have internal predecessors, (384), 95 states have call successors, (95), 95 states have call predecessors, (95), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 480 states. [2022-02-21 03:03:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:15,103 INFO L93 Difference]: Finished difference Result 480 states and 480 transitions. [2022-02-21 03:03:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 480 transitions. [2022-02-21 03:03:15,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:15,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:15,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:15,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 383 states have (on average 1.0026109660574412) internal successors, (384), 383 states have internal predecessors, (384), 95 states have call successors, (95), 95 states have call predecessors, (95), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 479 transitions. [2022-02-21 03:03:15,119 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 479 transitions. Word has length 238 [2022-02-21 03:03:15,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:15,119 INFO L470 AbstractCegarLoop]: Abstraction has 479 states and 479 transitions. [2022-02-21 03:03:15,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 189 states have (on average 2.0105820105820107) internal successors, (380), 98 states have internal predecessors, (380), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 479 transitions. [2022-02-21 03:03:15,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2022-02-21 03:03:15,140 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:15,140 INFO L514 BasicCegarLoop]: trace histogram [95, 95, 95, 94, 94, 1, 1, 1, 1, 1] [2022-02-21 03:03:15,160 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:15,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:15,362 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-02-21 03:03:15,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:15,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1782455378, now seen corresponding path program 6 times [2022-02-21 03:03:15,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:15,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785643800] [2022-02-21 03:03:15,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:15,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:22,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {12036#true} assume { :begin_inline_ULTIMATE.init } true; {12036#true} is VALID [2022-02-21 03:03:22,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {12036#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {12036#true} is VALID [2022-02-21 03:03:22,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {12036#true} assume !(main_~x~0#1 < 0); {12038#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:03:22,242 INFO L272 TraceCheckUtils]: 3: Hoare triple {12038#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {12039#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:03:22,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {12039#(<= 0 |g_#in~x|)} ~x := #in~x; {12040#(<= 0 g_~x)} is VALID [2022-02-21 03:03:22,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {12040#(<= 0 g_~x)} assume !(0 == ~x); {12040#(<= 0 g_~x)} is VALID [2022-02-21 03:03:22,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {12040#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {12040#(<= 0 g_~x)} is VALID [2022-02-21 03:03:22,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {12040#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {12040#(<= 0 g_~x)} is VALID [2022-02-21 03:03:22,243 INFO L272 TraceCheckUtils]: 8: Hoare triple {12040#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {12041#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:03:22,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {12041#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {12042#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:22,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {12042#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {12042#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:22,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {12042#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {12042#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:22,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {12042#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {12042#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:22,245 INFO L272 TraceCheckUtils]: 13: Hoare triple {12042#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {12043#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:03:22,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {12043#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {12044#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:22,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {12044#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {12044#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:22,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {12044#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {12044#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:22,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {12044#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {12044#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:22,246 INFO L272 TraceCheckUtils]: 18: Hoare triple {12044#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {12045#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:03:22,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {12045#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {12046#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:22,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {12046#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {12046#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:22,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {12046#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {12046#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:22,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {12046#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {12046#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:22,247 INFO L272 TraceCheckUtils]: 23: Hoare triple {12046#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {12047#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:03:22,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {12047#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {12048#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:22,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {12048#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {12048#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:22,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {12048#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {12048#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:22,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {12048#(<= 0 (+ g_~x 4))} assume ~x - 1 >= -2147483648; {12048#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:22,249 INFO L272 TraceCheckUtils]: 28: Hoare triple {12048#(<= 0 (+ g_~x 4))} call #t~ret0 := g(~x - 1); {12049#(<= 0 (+ 5 |g_#in~x|))} is VALID [2022-02-21 03:03:22,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {12049#(<= 0 (+ 5 |g_#in~x|))} ~x := #in~x; {12050#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:22,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {12050#(<= 0 (+ 5 g_~x))} assume !(0 == ~x); {12050#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:22,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {12050#(<= 0 (+ 5 g_~x))} assume ~x - 1 <= 2147483647; {12050#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:22,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {12050#(<= 0 (+ 5 g_~x))} assume ~x - 1 >= -2147483648; {12050#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:22,250 INFO L272 TraceCheckUtils]: 33: Hoare triple {12050#(<= 0 (+ 5 g_~x))} call #t~ret0 := g(~x - 1); {12051#(<= 0 (+ |g_#in~x| 6))} is VALID [2022-02-21 03:03:22,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {12051#(<= 0 (+ |g_#in~x| 6))} ~x := #in~x; {12052#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:22,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {12052#(<= 0 (+ 6 g_~x))} assume !(0 == ~x); {12052#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:22,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {12052#(<= 0 (+ 6 g_~x))} assume ~x - 1 <= 2147483647; {12052#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:22,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {12052#(<= 0 (+ 6 g_~x))} assume ~x - 1 >= -2147483648; {12052#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:22,252 INFO L272 TraceCheckUtils]: 38: Hoare triple {12052#(<= 0 (+ 6 g_~x))} call #t~ret0 := g(~x - 1); {12053#(<= 0 (+ 7 |g_#in~x|))} is VALID [2022-02-21 03:03:22,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {12053#(<= 0 (+ 7 |g_#in~x|))} ~x := #in~x; {12054#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:22,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {12054#(<= 0 (+ 7 g_~x))} assume !(0 == ~x); {12054#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:22,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {12054#(<= 0 (+ 7 g_~x))} assume ~x - 1 <= 2147483647; {12054#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:22,253 INFO L290 TraceCheckUtils]: 42: Hoare triple {12054#(<= 0 (+ 7 g_~x))} assume ~x - 1 >= -2147483648; {12054#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:22,253 INFO L272 TraceCheckUtils]: 43: Hoare triple {12054#(<= 0 (+ 7 g_~x))} call #t~ret0 := g(~x - 1); {12055#(<= 0 (+ |g_#in~x| 8))} is VALID [2022-02-21 03:03:22,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {12055#(<= 0 (+ |g_#in~x| 8))} ~x := #in~x; {12056#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:22,256 INFO L290 TraceCheckUtils]: 45: Hoare triple {12056#(<= 0 (+ g_~x 8))} assume !(0 == ~x); {12056#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:22,257 INFO L290 TraceCheckUtils]: 46: Hoare triple {12056#(<= 0 (+ g_~x 8))} assume ~x - 1 <= 2147483647; {12056#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:22,257 INFO L290 TraceCheckUtils]: 47: Hoare triple {12056#(<= 0 (+ g_~x 8))} assume ~x - 1 >= -2147483648; {12056#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:22,257 INFO L272 TraceCheckUtils]: 48: Hoare triple {12056#(<= 0 (+ g_~x 8))} call #t~ret0 := g(~x - 1); {12057#(<= 0 (+ |g_#in~x| 9))} is VALID [2022-02-21 03:03:22,258 INFO L290 TraceCheckUtils]: 49: Hoare triple {12057#(<= 0 (+ |g_#in~x| 9))} ~x := #in~x; {12058#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:22,258 INFO L290 TraceCheckUtils]: 50: Hoare triple {12058#(<= 0 (+ 9 g_~x))} assume !(0 == ~x); {12058#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:22,258 INFO L290 TraceCheckUtils]: 51: Hoare triple {12058#(<= 0 (+ 9 g_~x))} assume ~x - 1 <= 2147483647; {12058#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:22,258 INFO L290 TraceCheckUtils]: 52: Hoare triple {12058#(<= 0 (+ 9 g_~x))} assume ~x - 1 >= -2147483648; {12058#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:22,259 INFO L272 TraceCheckUtils]: 53: Hoare triple {12058#(<= 0 (+ 9 g_~x))} call #t~ret0 := g(~x - 1); {12059#(<= 0 (+ |g_#in~x| 10))} is VALID [2022-02-21 03:03:22,259 INFO L290 TraceCheckUtils]: 54: Hoare triple {12059#(<= 0 (+ |g_#in~x| 10))} ~x := #in~x; {12060#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:22,259 INFO L290 TraceCheckUtils]: 55: Hoare triple {12060#(<= 0 (+ g_~x 10))} assume !(0 == ~x); {12060#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:22,259 INFO L290 TraceCheckUtils]: 56: Hoare triple {12060#(<= 0 (+ g_~x 10))} assume ~x - 1 <= 2147483647; {12060#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:22,260 INFO L290 TraceCheckUtils]: 57: Hoare triple {12060#(<= 0 (+ g_~x 10))} assume ~x - 1 >= -2147483648; {12060#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:22,260 INFO L272 TraceCheckUtils]: 58: Hoare triple {12060#(<= 0 (+ g_~x 10))} call #t~ret0 := g(~x - 1); {12061#(<= 0 (+ |g_#in~x| 11))} is VALID [2022-02-21 03:03:22,260 INFO L290 TraceCheckUtils]: 59: Hoare triple {12061#(<= 0 (+ |g_#in~x| 11))} ~x := #in~x; {12062#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:22,261 INFO L290 TraceCheckUtils]: 60: Hoare triple {12062#(<= 0 (+ g_~x 11))} assume !(0 == ~x); {12062#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:22,261 INFO L290 TraceCheckUtils]: 61: Hoare triple {12062#(<= 0 (+ g_~x 11))} assume ~x - 1 <= 2147483647; {12062#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:22,261 INFO L290 TraceCheckUtils]: 62: Hoare triple {12062#(<= 0 (+ g_~x 11))} assume ~x - 1 >= -2147483648; {12062#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:22,261 INFO L272 TraceCheckUtils]: 63: Hoare triple {12062#(<= 0 (+ g_~x 11))} call #t~ret0 := g(~x - 1); {12063#(<= 0 (+ |g_#in~x| 12))} is VALID [2022-02-21 03:03:22,262 INFO L290 TraceCheckUtils]: 64: Hoare triple {12063#(<= 0 (+ |g_#in~x| 12))} ~x := #in~x; {12064#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:22,262 INFO L290 TraceCheckUtils]: 65: Hoare triple {12064#(<= 0 (+ g_~x 12))} assume !(0 == ~x); {12064#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:22,262 INFO L290 TraceCheckUtils]: 66: Hoare triple {12064#(<= 0 (+ g_~x 12))} assume ~x - 1 <= 2147483647; {12064#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:22,262 INFO L290 TraceCheckUtils]: 67: Hoare triple {12064#(<= 0 (+ g_~x 12))} assume ~x - 1 >= -2147483648; {12064#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:22,263 INFO L272 TraceCheckUtils]: 68: Hoare triple {12064#(<= 0 (+ g_~x 12))} call #t~ret0 := g(~x - 1); {12065#(<= 0 (+ |g_#in~x| 13))} is VALID [2022-02-21 03:03:22,263 INFO L290 TraceCheckUtils]: 69: Hoare triple {12065#(<= 0 (+ |g_#in~x| 13))} ~x := #in~x; {12066#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:22,263 INFO L290 TraceCheckUtils]: 70: Hoare triple {12066#(<= 0 (+ g_~x 13))} assume !(0 == ~x); {12066#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:22,264 INFO L290 TraceCheckUtils]: 71: Hoare triple {12066#(<= 0 (+ g_~x 13))} assume ~x - 1 <= 2147483647; {12066#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:22,264 INFO L290 TraceCheckUtils]: 72: Hoare triple {12066#(<= 0 (+ g_~x 13))} assume ~x - 1 >= -2147483648; {12066#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:22,264 INFO L272 TraceCheckUtils]: 73: Hoare triple {12066#(<= 0 (+ g_~x 13))} call #t~ret0 := g(~x - 1); {12067#(<= 0 (+ |g_#in~x| 14))} is VALID [2022-02-21 03:03:22,264 INFO L290 TraceCheckUtils]: 74: Hoare triple {12067#(<= 0 (+ |g_#in~x| 14))} ~x := #in~x; {12068#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:22,265 INFO L290 TraceCheckUtils]: 75: Hoare triple {12068#(<= 0 (+ 14 g_~x))} assume !(0 == ~x); {12068#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:22,265 INFO L290 TraceCheckUtils]: 76: Hoare triple {12068#(<= 0 (+ 14 g_~x))} assume ~x - 1 <= 2147483647; {12068#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:22,265 INFO L290 TraceCheckUtils]: 77: Hoare triple {12068#(<= 0 (+ 14 g_~x))} assume ~x - 1 >= -2147483648; {12068#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:22,266 INFO L272 TraceCheckUtils]: 78: Hoare triple {12068#(<= 0 (+ 14 g_~x))} call #t~ret0 := g(~x - 1); {12069#(<= 0 (+ |g_#in~x| 15))} is VALID [2022-02-21 03:03:22,266 INFO L290 TraceCheckUtils]: 79: Hoare triple {12069#(<= 0 (+ |g_#in~x| 15))} ~x := #in~x; {12070#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:22,275 INFO L290 TraceCheckUtils]: 80: Hoare triple {12070#(<= 0 (+ g_~x 15))} assume !(0 == ~x); {12070#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:22,276 INFO L290 TraceCheckUtils]: 81: Hoare triple {12070#(<= 0 (+ g_~x 15))} assume ~x - 1 <= 2147483647; {12070#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:22,276 INFO L290 TraceCheckUtils]: 82: Hoare triple {12070#(<= 0 (+ g_~x 15))} assume ~x - 1 >= -2147483648; {12070#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:22,277 INFO L272 TraceCheckUtils]: 83: Hoare triple {12070#(<= 0 (+ g_~x 15))} call #t~ret0 := g(~x - 1); {12071#(<= 0 (+ |g_#in~x| 16))} is VALID [2022-02-21 03:03:22,277 INFO L290 TraceCheckUtils]: 84: Hoare triple {12071#(<= 0 (+ |g_#in~x| 16))} ~x := #in~x; {12072#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:22,277 INFO L290 TraceCheckUtils]: 85: Hoare triple {12072#(<= 0 (+ 16 g_~x))} assume !(0 == ~x); {12072#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:22,278 INFO L290 TraceCheckUtils]: 86: Hoare triple {12072#(<= 0 (+ 16 g_~x))} assume ~x - 1 <= 2147483647; {12072#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:22,278 INFO L290 TraceCheckUtils]: 87: Hoare triple {12072#(<= 0 (+ 16 g_~x))} assume ~x - 1 >= -2147483648; {12072#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:22,278 INFO L272 TraceCheckUtils]: 88: Hoare triple {12072#(<= 0 (+ 16 g_~x))} call #t~ret0 := g(~x - 1); {12073#(<= 0 (+ |g_#in~x| 17))} is VALID [2022-02-21 03:03:22,278 INFO L290 TraceCheckUtils]: 89: Hoare triple {12073#(<= 0 (+ |g_#in~x| 17))} ~x := #in~x; {12074#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:22,279 INFO L290 TraceCheckUtils]: 90: Hoare triple {12074#(<= 0 (+ g_~x 17))} assume !(0 == ~x); {12074#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:22,279 INFO L290 TraceCheckUtils]: 91: Hoare triple {12074#(<= 0 (+ g_~x 17))} assume ~x - 1 <= 2147483647; {12074#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:22,279 INFO L290 TraceCheckUtils]: 92: Hoare triple {12074#(<= 0 (+ g_~x 17))} assume ~x - 1 >= -2147483648; {12074#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:22,280 INFO L272 TraceCheckUtils]: 93: Hoare triple {12074#(<= 0 (+ g_~x 17))} call #t~ret0 := g(~x - 1); {12075#(<= 0 (+ |g_#in~x| 18))} is VALID [2022-02-21 03:03:22,280 INFO L290 TraceCheckUtils]: 94: Hoare triple {12075#(<= 0 (+ |g_#in~x| 18))} ~x := #in~x; {12076#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:22,280 INFO L290 TraceCheckUtils]: 95: Hoare triple {12076#(<= 0 (+ g_~x 18))} assume !(0 == ~x); {12076#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:22,280 INFO L290 TraceCheckUtils]: 96: Hoare triple {12076#(<= 0 (+ g_~x 18))} assume ~x - 1 <= 2147483647; {12076#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:22,281 INFO L290 TraceCheckUtils]: 97: Hoare triple {12076#(<= 0 (+ g_~x 18))} assume ~x - 1 >= -2147483648; {12076#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:22,281 INFO L272 TraceCheckUtils]: 98: Hoare triple {12076#(<= 0 (+ g_~x 18))} call #t~ret0 := g(~x - 1); {12077#(<= 0 (+ 19 |g_#in~x|))} is VALID [2022-02-21 03:03:22,281 INFO L290 TraceCheckUtils]: 99: Hoare triple {12077#(<= 0 (+ 19 |g_#in~x|))} ~x := #in~x; {12078#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:22,281 INFO L290 TraceCheckUtils]: 100: Hoare triple {12078#(<= 0 (+ 19 g_~x))} assume !(0 == ~x); {12078#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:22,282 INFO L290 TraceCheckUtils]: 101: Hoare triple {12078#(<= 0 (+ 19 g_~x))} assume ~x - 1 <= 2147483647; {12078#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:22,282 INFO L290 TraceCheckUtils]: 102: Hoare triple {12078#(<= 0 (+ 19 g_~x))} assume ~x - 1 >= -2147483648; {12078#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:22,282 INFO L272 TraceCheckUtils]: 103: Hoare triple {12078#(<= 0 (+ 19 g_~x))} call #t~ret0 := g(~x - 1); {12079#(<= 0 (+ |g_#in~x| 20))} is VALID [2022-02-21 03:03:22,283 INFO L290 TraceCheckUtils]: 104: Hoare triple {12079#(<= 0 (+ |g_#in~x| 20))} ~x := #in~x; {12080#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:22,283 INFO L290 TraceCheckUtils]: 105: Hoare triple {12080#(<= 0 (+ g_~x 20))} assume !(0 == ~x); {12080#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:22,283 INFO L290 TraceCheckUtils]: 106: Hoare triple {12080#(<= 0 (+ g_~x 20))} assume ~x - 1 <= 2147483647; {12080#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:22,283 INFO L290 TraceCheckUtils]: 107: Hoare triple {12080#(<= 0 (+ g_~x 20))} assume ~x - 1 >= -2147483648; {12080#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:22,284 INFO L272 TraceCheckUtils]: 108: Hoare triple {12080#(<= 0 (+ g_~x 20))} call #t~ret0 := g(~x - 1); {12081#(<= 0 (+ |g_#in~x| 21))} is VALID [2022-02-21 03:03:22,284 INFO L290 TraceCheckUtils]: 109: Hoare triple {12081#(<= 0 (+ |g_#in~x| 21))} ~x := #in~x; {12082#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:22,284 INFO L290 TraceCheckUtils]: 110: Hoare triple {12082#(<= 0 (+ 21 g_~x))} assume !(0 == ~x); {12082#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:22,284 INFO L290 TraceCheckUtils]: 111: Hoare triple {12082#(<= 0 (+ 21 g_~x))} assume ~x - 1 <= 2147483647; {12082#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:22,285 INFO L290 TraceCheckUtils]: 112: Hoare triple {12082#(<= 0 (+ 21 g_~x))} assume ~x - 1 >= -2147483648; {12082#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:22,285 INFO L272 TraceCheckUtils]: 113: Hoare triple {12082#(<= 0 (+ 21 g_~x))} call #t~ret0 := g(~x - 1); {12083#(<= 0 (+ |g_#in~x| 22))} is VALID [2022-02-21 03:03:22,285 INFO L290 TraceCheckUtils]: 114: Hoare triple {12083#(<= 0 (+ |g_#in~x| 22))} ~x := #in~x; {12084#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:22,286 INFO L290 TraceCheckUtils]: 115: Hoare triple {12084#(<= 0 (+ 22 g_~x))} assume !(0 == ~x); {12084#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:22,286 INFO L290 TraceCheckUtils]: 116: Hoare triple {12084#(<= 0 (+ 22 g_~x))} assume ~x - 1 <= 2147483647; {12084#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:22,286 INFO L290 TraceCheckUtils]: 117: Hoare triple {12084#(<= 0 (+ 22 g_~x))} assume ~x - 1 >= -2147483648; {12084#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:22,286 INFO L272 TraceCheckUtils]: 118: Hoare triple {12084#(<= 0 (+ 22 g_~x))} call #t~ret0 := g(~x - 1); {12085#(<= 0 (+ 23 |g_#in~x|))} is VALID [2022-02-21 03:03:22,287 INFO L290 TraceCheckUtils]: 119: Hoare triple {12085#(<= 0 (+ 23 |g_#in~x|))} ~x := #in~x; {12086#(<= 0 (+ 23 g_~x))} is VALID [2022-02-21 03:03:22,287 INFO L290 TraceCheckUtils]: 120: Hoare triple {12086#(<= 0 (+ 23 g_~x))} assume !(0 == ~x); {12086#(<= 0 (+ 23 g_~x))} is VALID [2022-02-21 03:03:22,287 INFO L290 TraceCheckUtils]: 121: Hoare triple {12086#(<= 0 (+ 23 g_~x))} assume ~x - 1 <= 2147483647; {12086#(<= 0 (+ 23 g_~x))} is VALID [2022-02-21 03:03:22,287 INFO L290 TraceCheckUtils]: 122: Hoare triple {12086#(<= 0 (+ 23 g_~x))} assume ~x - 1 >= -2147483648; {12086#(<= 0 (+ 23 g_~x))} is VALID [2022-02-21 03:03:22,288 INFO L272 TraceCheckUtils]: 123: Hoare triple {12086#(<= 0 (+ 23 g_~x))} call #t~ret0 := g(~x - 1); {12087#(<= 0 (+ |g_#in~x| 24))} is VALID [2022-02-21 03:03:22,288 INFO L290 TraceCheckUtils]: 124: Hoare triple {12087#(<= 0 (+ |g_#in~x| 24))} ~x := #in~x; {12088#(<= 0 (+ g_~x 24))} is VALID [2022-02-21 03:03:22,288 INFO L290 TraceCheckUtils]: 125: Hoare triple {12088#(<= 0 (+ g_~x 24))} assume !(0 == ~x); {12088#(<= 0 (+ g_~x 24))} is VALID [2022-02-21 03:03:22,289 INFO L290 TraceCheckUtils]: 126: Hoare triple {12088#(<= 0 (+ g_~x 24))} assume ~x - 1 <= 2147483647; {12088#(<= 0 (+ g_~x 24))} is VALID [2022-02-21 03:03:22,289 INFO L290 TraceCheckUtils]: 127: Hoare triple {12088#(<= 0 (+ g_~x 24))} assume ~x - 1 >= -2147483648; {12088#(<= 0 (+ g_~x 24))} is VALID [2022-02-21 03:03:22,289 INFO L272 TraceCheckUtils]: 128: Hoare triple {12088#(<= 0 (+ g_~x 24))} call #t~ret0 := g(~x - 1); {12089#(<= 0 (+ |g_#in~x| 25))} is VALID [2022-02-21 03:03:22,289 INFO L290 TraceCheckUtils]: 129: Hoare triple {12089#(<= 0 (+ |g_#in~x| 25))} ~x := #in~x; {12090#(<= 0 (+ g_~x 25))} is VALID [2022-02-21 03:03:22,290 INFO L290 TraceCheckUtils]: 130: Hoare triple {12090#(<= 0 (+ g_~x 25))} assume !(0 == ~x); {12090#(<= 0 (+ g_~x 25))} is VALID [2022-02-21 03:03:22,290 INFO L290 TraceCheckUtils]: 131: Hoare triple {12090#(<= 0 (+ g_~x 25))} assume ~x - 1 <= 2147483647; {12090#(<= 0 (+ g_~x 25))} is VALID [2022-02-21 03:03:22,290 INFO L290 TraceCheckUtils]: 132: Hoare triple {12090#(<= 0 (+ g_~x 25))} assume ~x - 1 >= -2147483648; {12090#(<= 0 (+ g_~x 25))} is VALID [2022-02-21 03:03:22,291 INFO L272 TraceCheckUtils]: 133: Hoare triple {12090#(<= 0 (+ g_~x 25))} call #t~ret0 := g(~x - 1); {12091#(<= 0 (+ |g_#in~x| 26))} is VALID [2022-02-21 03:03:22,291 INFO L290 TraceCheckUtils]: 134: Hoare triple {12091#(<= 0 (+ |g_#in~x| 26))} ~x := #in~x; {12092#(<= 0 (+ g_~x 26))} is VALID [2022-02-21 03:03:22,291 INFO L290 TraceCheckUtils]: 135: Hoare triple {12092#(<= 0 (+ g_~x 26))} assume !(0 == ~x); {12092#(<= 0 (+ g_~x 26))} is VALID [2022-02-21 03:03:22,291 INFO L290 TraceCheckUtils]: 136: Hoare triple {12092#(<= 0 (+ g_~x 26))} assume ~x - 1 <= 2147483647; {12092#(<= 0 (+ g_~x 26))} is VALID [2022-02-21 03:03:22,291 INFO L290 TraceCheckUtils]: 137: Hoare triple {12092#(<= 0 (+ g_~x 26))} assume ~x - 1 >= -2147483648; {12092#(<= 0 (+ g_~x 26))} is VALID [2022-02-21 03:03:22,292 INFO L272 TraceCheckUtils]: 138: Hoare triple {12092#(<= 0 (+ g_~x 26))} call #t~ret0 := g(~x - 1); {12093#(<= 0 (+ |g_#in~x| 27))} is VALID [2022-02-21 03:03:22,292 INFO L290 TraceCheckUtils]: 139: Hoare triple {12093#(<= 0 (+ |g_#in~x| 27))} ~x := #in~x; {12094#(<= 0 (+ g_~x 27))} is VALID [2022-02-21 03:03:22,292 INFO L290 TraceCheckUtils]: 140: Hoare triple {12094#(<= 0 (+ g_~x 27))} assume !(0 == ~x); {12094#(<= 0 (+ g_~x 27))} is VALID [2022-02-21 03:03:22,293 INFO L290 TraceCheckUtils]: 141: Hoare triple {12094#(<= 0 (+ g_~x 27))} assume ~x - 1 <= 2147483647; {12094#(<= 0 (+ g_~x 27))} is VALID [2022-02-21 03:03:22,293 INFO L290 TraceCheckUtils]: 142: Hoare triple {12094#(<= 0 (+ g_~x 27))} assume ~x - 1 >= -2147483648; {12094#(<= 0 (+ g_~x 27))} is VALID [2022-02-21 03:03:22,293 INFO L272 TraceCheckUtils]: 143: Hoare triple {12094#(<= 0 (+ g_~x 27))} call #t~ret0 := g(~x - 1); {12095#(<= 0 (+ |g_#in~x| 28))} is VALID [2022-02-21 03:03:22,293 INFO L290 TraceCheckUtils]: 144: Hoare triple {12095#(<= 0 (+ |g_#in~x| 28))} ~x := #in~x; {12096#(<= 0 (+ g_~x 28))} is VALID [2022-02-21 03:03:22,294 INFO L290 TraceCheckUtils]: 145: Hoare triple {12096#(<= 0 (+ g_~x 28))} assume !(0 == ~x); {12096#(<= 0 (+ g_~x 28))} is VALID [2022-02-21 03:03:22,294 INFO L290 TraceCheckUtils]: 146: Hoare triple {12096#(<= 0 (+ g_~x 28))} assume ~x - 1 <= 2147483647; {12096#(<= 0 (+ g_~x 28))} is VALID [2022-02-21 03:03:22,294 INFO L290 TraceCheckUtils]: 147: Hoare triple {12096#(<= 0 (+ g_~x 28))} assume ~x - 1 >= -2147483648; {12096#(<= 0 (+ g_~x 28))} is VALID [2022-02-21 03:03:22,295 INFO L272 TraceCheckUtils]: 148: Hoare triple {12096#(<= 0 (+ g_~x 28))} call #t~ret0 := g(~x - 1); {12097#(<= 0 (+ 29 |g_#in~x|))} is VALID [2022-02-21 03:03:22,295 INFO L290 TraceCheckUtils]: 149: Hoare triple {12097#(<= 0 (+ 29 |g_#in~x|))} ~x := #in~x; {12098#(<= 0 (+ 29 g_~x))} is VALID [2022-02-21 03:03:22,295 INFO L290 TraceCheckUtils]: 150: Hoare triple {12098#(<= 0 (+ 29 g_~x))} assume !(0 == ~x); {12098#(<= 0 (+ 29 g_~x))} is VALID [2022-02-21 03:03:22,295 INFO L290 TraceCheckUtils]: 151: Hoare triple {12098#(<= 0 (+ 29 g_~x))} assume ~x - 1 <= 2147483647; {12098#(<= 0 (+ 29 g_~x))} is VALID [2022-02-21 03:03:22,296 INFO L290 TraceCheckUtils]: 152: Hoare triple {12098#(<= 0 (+ 29 g_~x))} assume ~x - 1 >= -2147483648; {12098#(<= 0 (+ 29 g_~x))} is VALID [2022-02-21 03:03:22,296 INFO L272 TraceCheckUtils]: 153: Hoare triple {12098#(<= 0 (+ 29 g_~x))} call #t~ret0 := g(~x - 1); {12099#(<= 0 (+ 30 |g_#in~x|))} is VALID [2022-02-21 03:03:22,296 INFO L290 TraceCheckUtils]: 154: Hoare triple {12099#(<= 0 (+ 30 |g_#in~x|))} ~x := #in~x; {12100#(<= 0 (+ 30 g_~x))} is VALID [2022-02-21 03:03:22,297 INFO L290 TraceCheckUtils]: 155: Hoare triple {12100#(<= 0 (+ 30 g_~x))} assume !(0 == ~x); {12100#(<= 0 (+ 30 g_~x))} is VALID [2022-02-21 03:03:22,297 INFO L290 TraceCheckUtils]: 156: Hoare triple {12100#(<= 0 (+ 30 g_~x))} assume ~x - 1 <= 2147483647; {12100#(<= 0 (+ 30 g_~x))} is VALID [2022-02-21 03:03:22,297 INFO L290 TraceCheckUtils]: 157: Hoare triple {12100#(<= 0 (+ 30 g_~x))} assume ~x - 1 >= -2147483648; {12100#(<= 0 (+ 30 g_~x))} is VALID [2022-02-21 03:03:22,297 INFO L272 TraceCheckUtils]: 158: Hoare triple {12100#(<= 0 (+ 30 g_~x))} call #t~ret0 := g(~x - 1); {12101#(<= 0 (+ |g_#in~x| 31))} is VALID [2022-02-21 03:03:22,298 INFO L290 TraceCheckUtils]: 159: Hoare triple {12101#(<= 0 (+ |g_#in~x| 31))} ~x := #in~x; {12102#(<= 0 (+ g_~x 31))} is VALID [2022-02-21 03:03:22,298 INFO L290 TraceCheckUtils]: 160: Hoare triple {12102#(<= 0 (+ g_~x 31))} assume !(0 == ~x); {12102#(<= 0 (+ g_~x 31))} is VALID [2022-02-21 03:03:22,298 INFO L290 TraceCheckUtils]: 161: Hoare triple {12102#(<= 0 (+ g_~x 31))} assume ~x - 1 <= 2147483647; {12102#(<= 0 (+ g_~x 31))} is VALID [2022-02-21 03:03:22,298 INFO L290 TraceCheckUtils]: 162: Hoare triple {12102#(<= 0 (+ g_~x 31))} assume ~x - 1 >= -2147483648; {12102#(<= 0 (+ g_~x 31))} is VALID [2022-02-21 03:03:22,299 INFO L272 TraceCheckUtils]: 163: Hoare triple {12102#(<= 0 (+ g_~x 31))} call #t~ret0 := g(~x - 1); {12103#(<= 0 (+ 32 |g_#in~x|))} is VALID [2022-02-21 03:03:22,299 INFO L290 TraceCheckUtils]: 164: Hoare triple {12103#(<= 0 (+ 32 |g_#in~x|))} ~x := #in~x; {12104#(<= 0 (+ 32 g_~x))} is VALID [2022-02-21 03:03:22,299 INFO L290 TraceCheckUtils]: 165: Hoare triple {12104#(<= 0 (+ 32 g_~x))} assume !(0 == ~x); {12104#(<= 0 (+ 32 g_~x))} is VALID [2022-02-21 03:03:22,300 INFO L290 TraceCheckUtils]: 166: Hoare triple {12104#(<= 0 (+ 32 g_~x))} assume ~x - 1 <= 2147483647; {12104#(<= 0 (+ 32 g_~x))} is VALID [2022-02-21 03:03:22,300 INFO L290 TraceCheckUtils]: 167: Hoare triple {12104#(<= 0 (+ 32 g_~x))} assume ~x - 1 >= -2147483648; {12104#(<= 0 (+ 32 g_~x))} is VALID [2022-02-21 03:03:22,300 INFO L272 TraceCheckUtils]: 168: Hoare triple {12104#(<= 0 (+ 32 g_~x))} call #t~ret0 := g(~x - 1); {12105#(<= 0 (+ |g_#in~x| 33))} is VALID [2022-02-21 03:03:22,301 INFO L290 TraceCheckUtils]: 169: Hoare triple {12105#(<= 0 (+ |g_#in~x| 33))} ~x := #in~x; {12106#(<= 0 (+ g_~x 33))} is VALID [2022-02-21 03:03:22,301 INFO L290 TraceCheckUtils]: 170: Hoare triple {12106#(<= 0 (+ g_~x 33))} assume !(0 == ~x); {12106#(<= 0 (+ g_~x 33))} is VALID [2022-02-21 03:03:22,301 INFO L290 TraceCheckUtils]: 171: Hoare triple {12106#(<= 0 (+ g_~x 33))} assume ~x - 1 <= 2147483647; {12106#(<= 0 (+ g_~x 33))} is VALID [2022-02-21 03:03:22,301 INFO L290 TraceCheckUtils]: 172: Hoare triple {12106#(<= 0 (+ g_~x 33))} assume ~x - 1 >= -2147483648; {12106#(<= 0 (+ g_~x 33))} is VALID [2022-02-21 03:03:22,302 INFO L272 TraceCheckUtils]: 173: Hoare triple {12106#(<= 0 (+ g_~x 33))} call #t~ret0 := g(~x - 1); {12107#(<= 0 (+ |g_#in~x| 34))} is VALID [2022-02-21 03:03:22,302 INFO L290 TraceCheckUtils]: 174: Hoare triple {12107#(<= 0 (+ |g_#in~x| 34))} ~x := #in~x; {12108#(<= 0 (+ g_~x 34))} is VALID [2022-02-21 03:03:22,302 INFO L290 TraceCheckUtils]: 175: Hoare triple {12108#(<= 0 (+ g_~x 34))} assume !(0 == ~x); {12108#(<= 0 (+ g_~x 34))} is VALID [2022-02-21 03:03:22,302 INFO L290 TraceCheckUtils]: 176: Hoare triple {12108#(<= 0 (+ g_~x 34))} assume ~x - 1 <= 2147483647; {12108#(<= 0 (+ g_~x 34))} is VALID [2022-02-21 03:03:22,303 INFO L290 TraceCheckUtils]: 177: Hoare triple {12108#(<= 0 (+ g_~x 34))} assume ~x - 1 >= -2147483648; {12108#(<= 0 (+ g_~x 34))} is VALID [2022-02-21 03:03:22,303 INFO L272 TraceCheckUtils]: 178: Hoare triple {12108#(<= 0 (+ g_~x 34))} call #t~ret0 := g(~x - 1); {12109#(<= 0 (+ 35 |g_#in~x|))} is VALID [2022-02-21 03:03:22,303 INFO L290 TraceCheckUtils]: 179: Hoare triple {12109#(<= 0 (+ 35 |g_#in~x|))} ~x := #in~x; {12110#(<= 0 (+ 35 g_~x))} is VALID [2022-02-21 03:03:22,303 INFO L290 TraceCheckUtils]: 180: Hoare triple {12110#(<= 0 (+ 35 g_~x))} assume !(0 == ~x); {12110#(<= 0 (+ 35 g_~x))} is VALID [2022-02-21 03:03:22,304 INFO L290 TraceCheckUtils]: 181: Hoare triple {12110#(<= 0 (+ 35 g_~x))} assume ~x - 1 <= 2147483647; {12110#(<= 0 (+ 35 g_~x))} is VALID [2022-02-21 03:03:22,304 INFO L290 TraceCheckUtils]: 182: Hoare triple {12110#(<= 0 (+ 35 g_~x))} assume ~x - 1 >= -2147483648; {12110#(<= 0 (+ 35 g_~x))} is VALID [2022-02-21 03:03:22,304 INFO L272 TraceCheckUtils]: 183: Hoare triple {12110#(<= 0 (+ 35 g_~x))} call #t~ret0 := g(~x - 1); {12111#(<= 0 (+ |g_#in~x| 36))} is VALID [2022-02-21 03:03:22,305 INFO L290 TraceCheckUtils]: 184: Hoare triple {12111#(<= 0 (+ |g_#in~x| 36))} ~x := #in~x; {12112#(<= 0 (+ g_~x 36))} is VALID [2022-02-21 03:03:22,305 INFO L290 TraceCheckUtils]: 185: Hoare triple {12112#(<= 0 (+ g_~x 36))} assume !(0 == ~x); {12112#(<= 0 (+ g_~x 36))} is VALID [2022-02-21 03:03:22,305 INFO L290 TraceCheckUtils]: 186: Hoare triple {12112#(<= 0 (+ g_~x 36))} assume ~x - 1 <= 2147483647; {12112#(<= 0 (+ g_~x 36))} is VALID [2022-02-21 03:03:22,305 INFO L290 TraceCheckUtils]: 187: Hoare triple {12112#(<= 0 (+ g_~x 36))} assume ~x - 1 >= -2147483648; {12112#(<= 0 (+ g_~x 36))} is VALID [2022-02-21 03:03:22,306 INFO L272 TraceCheckUtils]: 188: Hoare triple {12112#(<= 0 (+ g_~x 36))} call #t~ret0 := g(~x - 1); {12113#(<= 0 (+ |g_#in~x| 37))} is VALID [2022-02-21 03:03:22,306 INFO L290 TraceCheckUtils]: 189: Hoare triple {12113#(<= 0 (+ |g_#in~x| 37))} ~x := #in~x; {12114#(<= 0 (+ g_~x 37))} is VALID [2022-02-21 03:03:22,306 INFO L290 TraceCheckUtils]: 190: Hoare triple {12114#(<= 0 (+ g_~x 37))} assume !(0 == ~x); {12114#(<= 0 (+ g_~x 37))} is VALID [2022-02-21 03:03:22,306 INFO L290 TraceCheckUtils]: 191: Hoare triple {12114#(<= 0 (+ g_~x 37))} assume ~x - 1 <= 2147483647; {12114#(<= 0 (+ g_~x 37))} is VALID [2022-02-21 03:03:22,307 INFO L290 TraceCheckUtils]: 192: Hoare triple {12114#(<= 0 (+ g_~x 37))} assume ~x - 1 >= -2147483648; {12114#(<= 0 (+ g_~x 37))} is VALID [2022-02-21 03:03:22,307 INFO L272 TraceCheckUtils]: 193: Hoare triple {12114#(<= 0 (+ g_~x 37))} call #t~ret0 := g(~x - 1); {12115#(<= 0 (+ |g_#in~x| 38))} is VALID [2022-02-21 03:03:22,307 INFO L290 TraceCheckUtils]: 194: Hoare triple {12115#(<= 0 (+ |g_#in~x| 38))} ~x := #in~x; {12116#(<= 0 (+ g_~x 38))} is VALID [2022-02-21 03:03:22,308 INFO L290 TraceCheckUtils]: 195: Hoare triple {12116#(<= 0 (+ g_~x 38))} assume !(0 == ~x); {12116#(<= 0 (+ g_~x 38))} is VALID [2022-02-21 03:03:22,308 INFO L290 TraceCheckUtils]: 196: Hoare triple {12116#(<= 0 (+ g_~x 38))} assume ~x - 1 <= 2147483647; {12116#(<= 0 (+ g_~x 38))} is VALID [2022-02-21 03:03:22,308 INFO L290 TraceCheckUtils]: 197: Hoare triple {12116#(<= 0 (+ g_~x 38))} assume ~x - 1 >= -2147483648; {12116#(<= 0 (+ g_~x 38))} is VALID [2022-02-21 03:03:22,308 INFO L272 TraceCheckUtils]: 198: Hoare triple {12116#(<= 0 (+ g_~x 38))} call #t~ret0 := g(~x - 1); {12117#(<= 0 (+ |g_#in~x| 39))} is VALID [2022-02-21 03:03:22,309 INFO L290 TraceCheckUtils]: 199: Hoare triple {12117#(<= 0 (+ |g_#in~x| 39))} ~x := #in~x; {12118#(<= 0 (+ g_~x 39))} is VALID [2022-02-21 03:03:22,309 INFO L290 TraceCheckUtils]: 200: Hoare triple {12118#(<= 0 (+ g_~x 39))} assume !(0 == ~x); {12118#(<= 0 (+ g_~x 39))} is VALID [2022-02-21 03:03:22,309 INFO L290 TraceCheckUtils]: 201: Hoare triple {12118#(<= 0 (+ g_~x 39))} assume ~x - 1 <= 2147483647; {12118#(<= 0 (+ g_~x 39))} is VALID [2022-02-21 03:03:22,309 INFO L290 TraceCheckUtils]: 202: Hoare triple {12118#(<= 0 (+ g_~x 39))} assume ~x - 1 >= -2147483648; {12118#(<= 0 (+ g_~x 39))} is VALID [2022-02-21 03:03:22,310 INFO L272 TraceCheckUtils]: 203: Hoare triple {12118#(<= 0 (+ g_~x 39))} call #t~ret0 := g(~x - 1); {12119#(<= 0 (+ 40 |g_#in~x|))} is VALID [2022-02-21 03:03:22,310 INFO L290 TraceCheckUtils]: 204: Hoare triple {12119#(<= 0 (+ 40 |g_#in~x|))} ~x := #in~x; {12120#(<= 0 (+ 40 g_~x))} is VALID [2022-02-21 03:03:22,310 INFO L290 TraceCheckUtils]: 205: Hoare triple {12120#(<= 0 (+ 40 g_~x))} assume !(0 == ~x); {12120#(<= 0 (+ 40 g_~x))} is VALID [2022-02-21 03:03:22,310 INFO L290 TraceCheckUtils]: 206: Hoare triple {12120#(<= 0 (+ 40 g_~x))} assume ~x - 1 <= 2147483647; {12120#(<= 0 (+ 40 g_~x))} is VALID [2022-02-21 03:03:22,311 INFO L290 TraceCheckUtils]: 207: Hoare triple {12120#(<= 0 (+ 40 g_~x))} assume ~x - 1 >= -2147483648; {12120#(<= 0 (+ 40 g_~x))} is VALID [2022-02-21 03:03:22,311 INFO L272 TraceCheckUtils]: 208: Hoare triple {12120#(<= 0 (+ 40 g_~x))} call #t~ret0 := g(~x - 1); {12121#(<= 0 (+ 41 |g_#in~x|))} is VALID [2022-02-21 03:03:22,311 INFO L290 TraceCheckUtils]: 209: Hoare triple {12121#(<= 0 (+ 41 |g_#in~x|))} ~x := #in~x; {12122#(<= 0 (+ 41 g_~x))} is VALID [2022-02-21 03:03:22,312 INFO L290 TraceCheckUtils]: 210: Hoare triple {12122#(<= 0 (+ 41 g_~x))} assume !(0 == ~x); {12122#(<= 0 (+ 41 g_~x))} is VALID [2022-02-21 03:03:22,312 INFO L290 TraceCheckUtils]: 211: Hoare triple {12122#(<= 0 (+ 41 g_~x))} assume ~x - 1 <= 2147483647; {12122#(<= 0 (+ 41 g_~x))} is VALID [2022-02-21 03:03:22,312 INFO L290 TraceCheckUtils]: 212: Hoare triple {12122#(<= 0 (+ 41 g_~x))} assume ~x - 1 >= -2147483648; {12122#(<= 0 (+ 41 g_~x))} is VALID [2022-02-21 03:03:22,312 INFO L272 TraceCheckUtils]: 213: Hoare triple {12122#(<= 0 (+ 41 g_~x))} call #t~ret0 := g(~x - 1); {12123#(<= 0 (+ 42 |g_#in~x|))} is VALID [2022-02-21 03:03:22,313 INFO L290 TraceCheckUtils]: 214: Hoare triple {12123#(<= 0 (+ 42 |g_#in~x|))} ~x := #in~x; {12124#(<= 0 (+ 42 g_~x))} is VALID [2022-02-21 03:03:22,313 INFO L290 TraceCheckUtils]: 215: Hoare triple {12124#(<= 0 (+ 42 g_~x))} assume !(0 == ~x); {12124#(<= 0 (+ 42 g_~x))} is VALID [2022-02-21 03:03:22,313 INFO L290 TraceCheckUtils]: 216: Hoare triple {12124#(<= 0 (+ 42 g_~x))} assume ~x - 1 <= 2147483647; {12124#(<= 0 (+ 42 g_~x))} is VALID [2022-02-21 03:03:22,313 INFO L290 TraceCheckUtils]: 217: Hoare triple {12124#(<= 0 (+ 42 g_~x))} assume ~x - 1 >= -2147483648; {12124#(<= 0 (+ 42 g_~x))} is VALID [2022-02-21 03:03:22,314 INFO L272 TraceCheckUtils]: 218: Hoare triple {12124#(<= 0 (+ 42 g_~x))} call #t~ret0 := g(~x - 1); {12125#(<= 0 (+ |g_#in~x| 43))} is VALID [2022-02-21 03:03:22,314 INFO L290 TraceCheckUtils]: 219: Hoare triple {12125#(<= 0 (+ |g_#in~x| 43))} ~x := #in~x; {12126#(<= 0 (+ g_~x 43))} is VALID [2022-02-21 03:03:22,314 INFO L290 TraceCheckUtils]: 220: Hoare triple {12126#(<= 0 (+ g_~x 43))} assume !(0 == ~x); {12126#(<= 0 (+ g_~x 43))} is VALID [2022-02-21 03:03:22,315 INFO L290 TraceCheckUtils]: 221: Hoare triple {12126#(<= 0 (+ g_~x 43))} assume ~x - 1 <= 2147483647; {12126#(<= 0 (+ g_~x 43))} is VALID [2022-02-21 03:03:22,315 INFO L290 TraceCheckUtils]: 222: Hoare triple {12126#(<= 0 (+ g_~x 43))} assume ~x - 1 >= -2147483648; {12126#(<= 0 (+ g_~x 43))} is VALID [2022-02-21 03:03:22,315 INFO L272 TraceCheckUtils]: 223: Hoare triple {12126#(<= 0 (+ g_~x 43))} call #t~ret0 := g(~x - 1); {12127#(<= 0 (+ 44 |g_#in~x|))} is VALID [2022-02-21 03:03:22,316 INFO L290 TraceCheckUtils]: 224: Hoare triple {12127#(<= 0 (+ 44 |g_#in~x|))} ~x := #in~x; {12128#(<= 0 (+ 44 g_~x))} is VALID [2022-02-21 03:03:22,316 INFO L290 TraceCheckUtils]: 225: Hoare triple {12128#(<= 0 (+ 44 g_~x))} assume !(0 == ~x); {12128#(<= 0 (+ 44 g_~x))} is VALID [2022-02-21 03:03:22,316 INFO L290 TraceCheckUtils]: 226: Hoare triple {12128#(<= 0 (+ 44 g_~x))} assume ~x - 1 <= 2147483647; {12128#(<= 0 (+ 44 g_~x))} is VALID [2022-02-21 03:03:22,316 INFO L290 TraceCheckUtils]: 227: Hoare triple {12128#(<= 0 (+ 44 g_~x))} assume ~x - 1 >= -2147483648; {12128#(<= 0 (+ 44 g_~x))} is VALID [2022-02-21 03:03:22,317 INFO L272 TraceCheckUtils]: 228: Hoare triple {12128#(<= 0 (+ 44 g_~x))} call #t~ret0 := g(~x - 1); {12129#(<= 0 (+ |g_#in~x| 45))} is VALID [2022-02-21 03:03:22,317 INFO L290 TraceCheckUtils]: 229: Hoare triple {12129#(<= 0 (+ |g_#in~x| 45))} ~x := #in~x; {12130#(<= 0 (+ g_~x 45))} is VALID [2022-02-21 03:03:22,317 INFO L290 TraceCheckUtils]: 230: Hoare triple {12130#(<= 0 (+ g_~x 45))} assume !(0 == ~x); {12130#(<= 0 (+ g_~x 45))} is VALID [2022-02-21 03:03:22,317 INFO L290 TraceCheckUtils]: 231: Hoare triple {12130#(<= 0 (+ g_~x 45))} assume ~x - 1 <= 2147483647; {12130#(<= 0 (+ g_~x 45))} is VALID [2022-02-21 03:03:22,318 INFO L290 TraceCheckUtils]: 232: Hoare triple {12130#(<= 0 (+ g_~x 45))} assume ~x - 1 >= -2147483648; {12130#(<= 0 (+ g_~x 45))} is VALID [2022-02-21 03:03:22,318 INFO L272 TraceCheckUtils]: 233: Hoare triple {12130#(<= 0 (+ g_~x 45))} call #t~ret0 := g(~x - 1); {12131#(<= 0 (+ |g_#in~x| 46))} is VALID [2022-02-21 03:03:22,318 INFO L290 TraceCheckUtils]: 234: Hoare triple {12131#(<= 0 (+ |g_#in~x| 46))} ~x := #in~x; {12132#(<= 0 (+ g_~x 46))} is VALID [2022-02-21 03:03:22,319 INFO L290 TraceCheckUtils]: 235: Hoare triple {12132#(<= 0 (+ g_~x 46))} assume !(0 == ~x); {12132#(<= 0 (+ g_~x 46))} is VALID [2022-02-21 03:03:22,319 INFO L290 TraceCheckUtils]: 236: Hoare triple {12132#(<= 0 (+ g_~x 46))} assume ~x - 1 <= 2147483647; {12132#(<= 0 (+ g_~x 46))} is VALID [2022-02-21 03:03:22,319 INFO L290 TraceCheckUtils]: 237: Hoare triple {12132#(<= 0 (+ g_~x 46))} assume ~x - 1 >= -2147483648; {12132#(<= 0 (+ g_~x 46))} is VALID [2022-02-21 03:03:22,319 INFO L272 TraceCheckUtils]: 238: Hoare triple {12132#(<= 0 (+ g_~x 46))} call #t~ret0 := g(~x - 1); {12133#(<= 0 (+ |g_#in~x| 47))} is VALID [2022-02-21 03:03:22,320 INFO L290 TraceCheckUtils]: 239: Hoare triple {12133#(<= 0 (+ |g_#in~x| 47))} ~x := #in~x; {12134#(<= 0 (+ 47 g_~x))} is VALID [2022-02-21 03:03:22,320 INFO L290 TraceCheckUtils]: 240: Hoare triple {12134#(<= 0 (+ 47 g_~x))} assume !(0 == ~x); {12134#(<= 0 (+ 47 g_~x))} is VALID [2022-02-21 03:03:22,320 INFO L290 TraceCheckUtils]: 241: Hoare triple {12134#(<= 0 (+ 47 g_~x))} assume ~x - 1 <= 2147483647; {12134#(<= 0 (+ 47 g_~x))} is VALID [2022-02-21 03:03:22,321 INFO L290 TraceCheckUtils]: 242: Hoare triple {12134#(<= 0 (+ 47 g_~x))} assume ~x - 1 >= -2147483648; {12134#(<= 0 (+ 47 g_~x))} is VALID [2022-02-21 03:03:22,321 INFO L272 TraceCheckUtils]: 243: Hoare triple {12134#(<= 0 (+ 47 g_~x))} call #t~ret0 := g(~x - 1); {12135#(<= 0 (+ |g_#in~x| 48))} is VALID [2022-02-21 03:03:22,321 INFO L290 TraceCheckUtils]: 244: Hoare triple {12135#(<= 0 (+ |g_#in~x| 48))} ~x := #in~x; {12136#(<= 0 (+ g_~x 48))} is VALID [2022-02-21 03:03:22,321 INFO L290 TraceCheckUtils]: 245: Hoare triple {12136#(<= 0 (+ g_~x 48))} assume !(0 == ~x); {12136#(<= 0 (+ g_~x 48))} is VALID [2022-02-21 03:03:22,322 INFO L290 TraceCheckUtils]: 246: Hoare triple {12136#(<= 0 (+ g_~x 48))} assume ~x - 1 <= 2147483647; {12136#(<= 0 (+ g_~x 48))} is VALID [2022-02-21 03:03:22,322 INFO L290 TraceCheckUtils]: 247: Hoare triple {12136#(<= 0 (+ g_~x 48))} assume ~x - 1 >= -2147483648; {12136#(<= 0 (+ g_~x 48))} is VALID [2022-02-21 03:03:22,322 INFO L272 TraceCheckUtils]: 248: Hoare triple {12136#(<= 0 (+ g_~x 48))} call #t~ret0 := g(~x - 1); {12137#(<= 0 (+ 49 |g_#in~x|))} is VALID [2022-02-21 03:03:22,322 INFO L290 TraceCheckUtils]: 249: Hoare triple {12137#(<= 0 (+ 49 |g_#in~x|))} ~x := #in~x; {12138#(<= 0 (+ 49 g_~x))} is VALID [2022-02-21 03:03:22,323 INFO L290 TraceCheckUtils]: 250: Hoare triple {12138#(<= 0 (+ 49 g_~x))} assume !(0 == ~x); {12138#(<= 0 (+ 49 g_~x))} is VALID [2022-02-21 03:03:22,323 INFO L290 TraceCheckUtils]: 251: Hoare triple {12138#(<= 0 (+ 49 g_~x))} assume ~x - 1 <= 2147483647; {12138#(<= 0 (+ 49 g_~x))} is VALID [2022-02-21 03:03:22,323 INFO L290 TraceCheckUtils]: 252: Hoare triple {12138#(<= 0 (+ 49 g_~x))} assume ~x - 1 >= -2147483648; {12138#(<= 0 (+ 49 g_~x))} is VALID [2022-02-21 03:03:22,324 INFO L272 TraceCheckUtils]: 253: Hoare triple {12138#(<= 0 (+ 49 g_~x))} call #t~ret0 := g(~x - 1); {12139#(<= 0 (+ |g_#in~x| 50))} is VALID [2022-02-21 03:03:22,324 INFO L290 TraceCheckUtils]: 254: Hoare triple {12139#(<= 0 (+ |g_#in~x| 50))} ~x := #in~x; {12140#(<= 0 (+ g_~x 50))} is VALID [2022-02-21 03:03:22,324 INFO L290 TraceCheckUtils]: 255: Hoare triple {12140#(<= 0 (+ g_~x 50))} assume !(0 == ~x); {12140#(<= 0 (+ g_~x 50))} is VALID [2022-02-21 03:03:22,324 INFO L290 TraceCheckUtils]: 256: Hoare triple {12140#(<= 0 (+ g_~x 50))} assume ~x - 1 <= 2147483647; {12140#(<= 0 (+ g_~x 50))} is VALID [2022-02-21 03:03:22,325 INFO L290 TraceCheckUtils]: 257: Hoare triple {12140#(<= 0 (+ g_~x 50))} assume ~x - 1 >= -2147483648; {12140#(<= 0 (+ g_~x 50))} is VALID [2022-02-21 03:03:22,325 INFO L272 TraceCheckUtils]: 258: Hoare triple {12140#(<= 0 (+ g_~x 50))} call #t~ret0 := g(~x - 1); {12141#(<= 0 (+ 51 |g_#in~x|))} is VALID [2022-02-21 03:03:22,325 INFO L290 TraceCheckUtils]: 259: Hoare triple {12141#(<= 0 (+ 51 |g_#in~x|))} ~x := #in~x; {12142#(<= 0 (+ 51 g_~x))} is VALID [2022-02-21 03:03:22,325 INFO L290 TraceCheckUtils]: 260: Hoare triple {12142#(<= 0 (+ 51 g_~x))} assume !(0 == ~x); {12142#(<= 0 (+ 51 g_~x))} is VALID [2022-02-21 03:03:22,326 INFO L290 TraceCheckUtils]: 261: Hoare triple {12142#(<= 0 (+ 51 g_~x))} assume ~x - 1 <= 2147483647; {12142#(<= 0 (+ 51 g_~x))} is VALID [2022-02-21 03:03:22,326 INFO L290 TraceCheckUtils]: 262: Hoare triple {12142#(<= 0 (+ 51 g_~x))} assume ~x - 1 >= -2147483648; {12142#(<= 0 (+ 51 g_~x))} is VALID [2022-02-21 03:03:22,326 INFO L272 TraceCheckUtils]: 263: Hoare triple {12142#(<= 0 (+ 51 g_~x))} call #t~ret0 := g(~x - 1); {12143#(<= 0 (+ |g_#in~x| 52))} is VALID [2022-02-21 03:03:22,327 INFO L290 TraceCheckUtils]: 264: Hoare triple {12143#(<= 0 (+ |g_#in~x| 52))} ~x := #in~x; {12144#(<= 0 (+ 52 g_~x))} is VALID [2022-02-21 03:03:22,327 INFO L290 TraceCheckUtils]: 265: Hoare triple {12144#(<= 0 (+ 52 g_~x))} assume !(0 == ~x); {12144#(<= 0 (+ 52 g_~x))} is VALID [2022-02-21 03:03:22,327 INFO L290 TraceCheckUtils]: 266: Hoare triple {12144#(<= 0 (+ 52 g_~x))} assume ~x - 1 <= 2147483647; {12144#(<= 0 (+ 52 g_~x))} is VALID [2022-02-21 03:03:22,327 INFO L290 TraceCheckUtils]: 267: Hoare triple {12144#(<= 0 (+ 52 g_~x))} assume ~x - 1 >= -2147483648; {12144#(<= 0 (+ 52 g_~x))} is VALID [2022-02-21 03:03:22,328 INFO L272 TraceCheckUtils]: 268: Hoare triple {12144#(<= 0 (+ 52 g_~x))} call #t~ret0 := g(~x - 1); {12145#(<= 0 (+ 53 |g_#in~x|))} is VALID [2022-02-21 03:03:22,328 INFO L290 TraceCheckUtils]: 269: Hoare triple {12145#(<= 0 (+ 53 |g_#in~x|))} ~x := #in~x; {12146#(<= 0 (+ 53 g_~x))} is VALID [2022-02-21 03:03:22,328 INFO L290 TraceCheckUtils]: 270: Hoare triple {12146#(<= 0 (+ 53 g_~x))} assume !(0 == ~x); {12146#(<= 0 (+ 53 g_~x))} is VALID [2022-02-21 03:03:22,329 INFO L290 TraceCheckUtils]: 271: Hoare triple {12146#(<= 0 (+ 53 g_~x))} assume ~x - 1 <= 2147483647; {12146#(<= 0 (+ 53 g_~x))} is VALID [2022-02-21 03:03:22,329 INFO L290 TraceCheckUtils]: 272: Hoare triple {12146#(<= 0 (+ 53 g_~x))} assume ~x - 1 >= -2147483648; {12146#(<= 0 (+ 53 g_~x))} is VALID [2022-02-21 03:03:22,329 INFO L272 TraceCheckUtils]: 273: Hoare triple {12146#(<= 0 (+ 53 g_~x))} call #t~ret0 := g(~x - 1); {12147#(<= 0 (+ |g_#in~x| 54))} is VALID [2022-02-21 03:03:22,329 INFO L290 TraceCheckUtils]: 274: Hoare triple {12147#(<= 0 (+ |g_#in~x| 54))} ~x := #in~x; {12148#(<= 0 (+ g_~x 54))} is VALID [2022-02-21 03:03:22,330 INFO L290 TraceCheckUtils]: 275: Hoare triple {12148#(<= 0 (+ g_~x 54))} assume !(0 == ~x); {12148#(<= 0 (+ g_~x 54))} is VALID [2022-02-21 03:03:22,330 INFO L290 TraceCheckUtils]: 276: Hoare triple {12148#(<= 0 (+ g_~x 54))} assume ~x - 1 <= 2147483647; {12148#(<= 0 (+ g_~x 54))} is VALID [2022-02-21 03:03:22,330 INFO L290 TraceCheckUtils]: 277: Hoare triple {12148#(<= 0 (+ g_~x 54))} assume ~x - 1 >= -2147483648; {12148#(<= 0 (+ g_~x 54))} is VALID [2022-02-21 03:03:22,330 INFO L272 TraceCheckUtils]: 278: Hoare triple {12148#(<= 0 (+ g_~x 54))} call #t~ret0 := g(~x - 1); {12149#(<= 0 (+ |g_#in~x| 55))} is VALID [2022-02-21 03:03:22,331 INFO L290 TraceCheckUtils]: 279: Hoare triple {12149#(<= 0 (+ |g_#in~x| 55))} ~x := #in~x; {12150#(<= 0 (+ g_~x 55))} is VALID [2022-02-21 03:03:22,331 INFO L290 TraceCheckUtils]: 280: Hoare triple {12150#(<= 0 (+ g_~x 55))} assume !(0 == ~x); {12150#(<= 0 (+ g_~x 55))} is VALID [2022-02-21 03:03:22,331 INFO L290 TraceCheckUtils]: 281: Hoare triple {12150#(<= 0 (+ g_~x 55))} assume ~x - 1 <= 2147483647; {12150#(<= 0 (+ g_~x 55))} is VALID [2022-02-21 03:03:22,331 INFO L290 TraceCheckUtils]: 282: Hoare triple {12150#(<= 0 (+ g_~x 55))} assume ~x - 1 >= -2147483648; {12150#(<= 0 (+ g_~x 55))} is VALID [2022-02-21 03:03:22,332 INFO L272 TraceCheckUtils]: 283: Hoare triple {12150#(<= 0 (+ g_~x 55))} call #t~ret0 := g(~x - 1); {12151#(<= 0 (+ 56 |g_#in~x|))} is VALID [2022-02-21 03:03:22,332 INFO L290 TraceCheckUtils]: 284: Hoare triple {12151#(<= 0 (+ 56 |g_#in~x|))} ~x := #in~x; {12152#(<= 0 (+ 56 g_~x))} is VALID [2022-02-21 03:03:22,332 INFO L290 TraceCheckUtils]: 285: Hoare triple {12152#(<= 0 (+ 56 g_~x))} assume !(0 == ~x); {12152#(<= 0 (+ 56 g_~x))} is VALID [2022-02-21 03:03:22,332 INFO L290 TraceCheckUtils]: 286: Hoare triple {12152#(<= 0 (+ 56 g_~x))} assume ~x - 1 <= 2147483647; {12152#(<= 0 (+ 56 g_~x))} is VALID [2022-02-21 03:03:22,333 INFO L290 TraceCheckUtils]: 287: Hoare triple {12152#(<= 0 (+ 56 g_~x))} assume ~x - 1 >= -2147483648; {12152#(<= 0 (+ 56 g_~x))} is VALID [2022-02-21 03:03:22,333 INFO L272 TraceCheckUtils]: 288: Hoare triple {12152#(<= 0 (+ 56 g_~x))} call #t~ret0 := g(~x - 1); {12153#(<= 0 (+ 57 |g_#in~x|))} is VALID [2022-02-21 03:03:22,333 INFO L290 TraceCheckUtils]: 289: Hoare triple {12153#(<= 0 (+ 57 |g_#in~x|))} ~x := #in~x; {12154#(<= 0 (+ 57 g_~x))} is VALID [2022-02-21 03:03:22,334 INFO L290 TraceCheckUtils]: 290: Hoare triple {12154#(<= 0 (+ 57 g_~x))} assume !(0 == ~x); {12154#(<= 0 (+ 57 g_~x))} is VALID [2022-02-21 03:03:22,334 INFO L290 TraceCheckUtils]: 291: Hoare triple {12154#(<= 0 (+ 57 g_~x))} assume ~x - 1 <= 2147483647; {12154#(<= 0 (+ 57 g_~x))} is VALID [2022-02-21 03:03:22,334 INFO L290 TraceCheckUtils]: 292: Hoare triple {12154#(<= 0 (+ 57 g_~x))} assume ~x - 1 >= -2147483648; {12154#(<= 0 (+ 57 g_~x))} is VALID [2022-02-21 03:03:22,334 INFO L272 TraceCheckUtils]: 293: Hoare triple {12154#(<= 0 (+ 57 g_~x))} call #t~ret0 := g(~x - 1); {12155#(<= 0 (+ |g_#in~x| 58))} is VALID [2022-02-21 03:03:22,335 INFO L290 TraceCheckUtils]: 294: Hoare triple {12155#(<= 0 (+ |g_#in~x| 58))} ~x := #in~x; {12156#(<= 0 (+ g_~x 58))} is VALID [2022-02-21 03:03:22,335 INFO L290 TraceCheckUtils]: 295: Hoare triple {12156#(<= 0 (+ g_~x 58))} assume !(0 == ~x); {12156#(<= 0 (+ g_~x 58))} is VALID [2022-02-21 03:03:22,335 INFO L290 TraceCheckUtils]: 296: Hoare triple {12156#(<= 0 (+ g_~x 58))} assume ~x - 1 <= 2147483647; {12156#(<= 0 (+ g_~x 58))} is VALID [2022-02-21 03:03:22,335 INFO L290 TraceCheckUtils]: 297: Hoare triple {12156#(<= 0 (+ g_~x 58))} assume ~x - 1 >= -2147483648; {12156#(<= 0 (+ g_~x 58))} is VALID [2022-02-21 03:03:22,336 INFO L272 TraceCheckUtils]: 298: Hoare triple {12156#(<= 0 (+ g_~x 58))} call #t~ret0 := g(~x - 1); {12157#(<= 0 (+ 59 |g_#in~x|))} is VALID [2022-02-21 03:03:22,336 INFO L290 TraceCheckUtils]: 299: Hoare triple {12157#(<= 0 (+ 59 |g_#in~x|))} ~x := #in~x; {12158#(<= 0 (+ 59 g_~x))} is VALID [2022-02-21 03:03:22,336 INFO L290 TraceCheckUtils]: 300: Hoare triple {12158#(<= 0 (+ 59 g_~x))} assume !(0 == ~x); {12158#(<= 0 (+ 59 g_~x))} is VALID [2022-02-21 03:03:22,337 INFO L290 TraceCheckUtils]: 301: Hoare triple {12158#(<= 0 (+ 59 g_~x))} assume ~x - 1 <= 2147483647; {12158#(<= 0 (+ 59 g_~x))} is VALID [2022-02-21 03:03:22,337 INFO L290 TraceCheckUtils]: 302: Hoare triple {12158#(<= 0 (+ 59 g_~x))} assume ~x - 1 >= -2147483648; {12158#(<= 0 (+ 59 g_~x))} is VALID [2022-02-21 03:03:22,337 INFO L272 TraceCheckUtils]: 303: Hoare triple {12158#(<= 0 (+ 59 g_~x))} call #t~ret0 := g(~x - 1); {12159#(<= 0 (+ |g_#in~x| 60))} is VALID [2022-02-21 03:03:22,337 INFO L290 TraceCheckUtils]: 304: Hoare triple {12159#(<= 0 (+ |g_#in~x| 60))} ~x := #in~x; {12160#(<= 0 (+ g_~x 60))} is VALID [2022-02-21 03:03:22,338 INFO L290 TraceCheckUtils]: 305: Hoare triple {12160#(<= 0 (+ g_~x 60))} assume !(0 == ~x); {12160#(<= 0 (+ g_~x 60))} is VALID [2022-02-21 03:03:22,338 INFO L290 TraceCheckUtils]: 306: Hoare triple {12160#(<= 0 (+ g_~x 60))} assume ~x - 1 <= 2147483647; {12160#(<= 0 (+ g_~x 60))} is VALID [2022-02-21 03:03:22,338 INFO L290 TraceCheckUtils]: 307: Hoare triple {12160#(<= 0 (+ g_~x 60))} assume ~x - 1 >= -2147483648; {12160#(<= 0 (+ g_~x 60))} is VALID [2022-02-21 03:03:22,339 INFO L272 TraceCheckUtils]: 308: Hoare triple {12160#(<= 0 (+ g_~x 60))} call #t~ret0 := g(~x - 1); {12161#(<= 0 (+ |g_#in~x| 61))} is VALID [2022-02-21 03:03:22,339 INFO L290 TraceCheckUtils]: 309: Hoare triple {12161#(<= 0 (+ |g_#in~x| 61))} ~x := #in~x; {12162#(<= 0 (+ g_~x 61))} is VALID [2022-02-21 03:03:22,339 INFO L290 TraceCheckUtils]: 310: Hoare triple {12162#(<= 0 (+ g_~x 61))} assume !(0 == ~x); {12162#(<= 0 (+ g_~x 61))} is VALID [2022-02-21 03:03:22,339 INFO L290 TraceCheckUtils]: 311: Hoare triple {12162#(<= 0 (+ g_~x 61))} assume ~x - 1 <= 2147483647; {12162#(<= 0 (+ g_~x 61))} is VALID [2022-02-21 03:03:22,339 INFO L290 TraceCheckUtils]: 312: Hoare triple {12162#(<= 0 (+ g_~x 61))} assume ~x - 1 >= -2147483648; {12162#(<= 0 (+ g_~x 61))} is VALID [2022-02-21 03:03:22,340 INFO L272 TraceCheckUtils]: 313: Hoare triple {12162#(<= 0 (+ g_~x 61))} call #t~ret0 := g(~x - 1); {12163#(<= 0 (+ |g_#in~x| 62))} is VALID [2022-02-21 03:03:22,340 INFO L290 TraceCheckUtils]: 314: Hoare triple {12163#(<= 0 (+ |g_#in~x| 62))} ~x := #in~x; {12164#(<= 0 (+ 62 g_~x))} is VALID [2022-02-21 03:03:22,340 INFO L290 TraceCheckUtils]: 315: Hoare triple {12164#(<= 0 (+ 62 g_~x))} assume !(0 == ~x); {12164#(<= 0 (+ 62 g_~x))} is VALID [2022-02-21 03:03:22,341 INFO L290 TraceCheckUtils]: 316: Hoare triple {12164#(<= 0 (+ 62 g_~x))} assume ~x - 1 <= 2147483647; {12164#(<= 0 (+ 62 g_~x))} is VALID [2022-02-21 03:03:22,341 INFO L290 TraceCheckUtils]: 317: Hoare triple {12164#(<= 0 (+ 62 g_~x))} assume ~x - 1 >= -2147483648; {12164#(<= 0 (+ 62 g_~x))} is VALID [2022-02-21 03:03:22,341 INFO L272 TraceCheckUtils]: 318: Hoare triple {12164#(<= 0 (+ 62 g_~x))} call #t~ret0 := g(~x - 1); {12165#(<= 0 (+ |g_#in~x| 63))} is VALID [2022-02-21 03:03:22,342 INFO L290 TraceCheckUtils]: 319: Hoare triple {12165#(<= 0 (+ |g_#in~x| 63))} ~x := #in~x; {12166#(<= 0 (+ g_~x 63))} is VALID [2022-02-21 03:03:22,342 INFO L290 TraceCheckUtils]: 320: Hoare triple {12166#(<= 0 (+ g_~x 63))} assume !(0 == ~x); {12166#(<= 0 (+ g_~x 63))} is VALID [2022-02-21 03:03:22,342 INFO L290 TraceCheckUtils]: 321: Hoare triple {12166#(<= 0 (+ g_~x 63))} assume ~x - 1 <= 2147483647; {12166#(<= 0 (+ g_~x 63))} is VALID [2022-02-21 03:03:22,342 INFO L290 TraceCheckUtils]: 322: Hoare triple {12166#(<= 0 (+ g_~x 63))} assume ~x - 1 >= -2147483648; {12166#(<= 0 (+ g_~x 63))} is VALID [2022-02-21 03:03:22,343 INFO L272 TraceCheckUtils]: 323: Hoare triple {12166#(<= 0 (+ g_~x 63))} call #t~ret0 := g(~x - 1); {12167#(<= 0 (+ 64 |g_#in~x|))} is VALID [2022-02-21 03:03:22,343 INFO L290 TraceCheckUtils]: 324: Hoare triple {12167#(<= 0 (+ 64 |g_#in~x|))} ~x := #in~x; {12168#(<= 0 (+ 64 g_~x))} is VALID [2022-02-21 03:03:22,343 INFO L290 TraceCheckUtils]: 325: Hoare triple {12168#(<= 0 (+ 64 g_~x))} assume !(0 == ~x); {12168#(<= 0 (+ 64 g_~x))} is VALID [2022-02-21 03:03:22,343 INFO L290 TraceCheckUtils]: 326: Hoare triple {12168#(<= 0 (+ 64 g_~x))} assume ~x - 1 <= 2147483647; {12168#(<= 0 (+ 64 g_~x))} is VALID [2022-02-21 03:03:22,344 INFO L290 TraceCheckUtils]: 327: Hoare triple {12168#(<= 0 (+ 64 g_~x))} assume ~x - 1 >= -2147483648; {12168#(<= 0 (+ 64 g_~x))} is VALID [2022-02-21 03:03:22,344 INFO L272 TraceCheckUtils]: 328: Hoare triple {12168#(<= 0 (+ 64 g_~x))} call #t~ret0 := g(~x - 1); {12169#(<= 0 (+ |g_#in~x| 65))} is VALID [2022-02-21 03:03:22,344 INFO L290 TraceCheckUtils]: 329: Hoare triple {12169#(<= 0 (+ |g_#in~x| 65))} ~x := #in~x; {12170#(<= 0 (+ g_~x 65))} is VALID [2022-02-21 03:03:22,345 INFO L290 TraceCheckUtils]: 330: Hoare triple {12170#(<= 0 (+ g_~x 65))} assume !(0 == ~x); {12170#(<= 0 (+ g_~x 65))} is VALID [2022-02-21 03:03:22,345 INFO L290 TraceCheckUtils]: 331: Hoare triple {12170#(<= 0 (+ g_~x 65))} assume ~x - 1 <= 2147483647; {12170#(<= 0 (+ g_~x 65))} is VALID [2022-02-21 03:03:22,345 INFO L290 TraceCheckUtils]: 332: Hoare triple {12170#(<= 0 (+ g_~x 65))} assume ~x - 1 >= -2147483648; {12170#(<= 0 (+ g_~x 65))} is VALID [2022-02-21 03:03:22,345 INFO L272 TraceCheckUtils]: 333: Hoare triple {12170#(<= 0 (+ g_~x 65))} call #t~ret0 := g(~x - 1); {12171#(<= 0 (+ 66 |g_#in~x|))} is VALID [2022-02-21 03:03:22,346 INFO L290 TraceCheckUtils]: 334: Hoare triple {12171#(<= 0 (+ 66 |g_#in~x|))} ~x := #in~x; {12172#(<= 0 (+ 66 g_~x))} is VALID [2022-02-21 03:03:22,346 INFO L290 TraceCheckUtils]: 335: Hoare triple {12172#(<= 0 (+ 66 g_~x))} assume !(0 == ~x); {12172#(<= 0 (+ 66 g_~x))} is VALID [2022-02-21 03:03:22,346 INFO L290 TraceCheckUtils]: 336: Hoare triple {12172#(<= 0 (+ 66 g_~x))} assume ~x - 1 <= 2147483647; {12172#(<= 0 (+ 66 g_~x))} is VALID [2022-02-21 03:03:22,346 INFO L290 TraceCheckUtils]: 337: Hoare triple {12172#(<= 0 (+ 66 g_~x))} assume ~x - 1 >= -2147483648; {12172#(<= 0 (+ 66 g_~x))} is VALID [2022-02-21 03:03:22,347 INFO L272 TraceCheckUtils]: 338: Hoare triple {12172#(<= 0 (+ 66 g_~x))} call #t~ret0 := g(~x - 1); {12173#(<= 0 (+ 67 |g_#in~x|))} is VALID [2022-02-21 03:03:22,347 INFO L290 TraceCheckUtils]: 339: Hoare triple {12173#(<= 0 (+ 67 |g_#in~x|))} ~x := #in~x; {12174#(<= 0 (+ 67 g_~x))} is VALID [2022-02-21 03:03:22,347 INFO L290 TraceCheckUtils]: 340: Hoare triple {12174#(<= 0 (+ 67 g_~x))} assume !(0 == ~x); {12174#(<= 0 (+ 67 g_~x))} is VALID [2022-02-21 03:03:22,348 INFO L290 TraceCheckUtils]: 341: Hoare triple {12174#(<= 0 (+ 67 g_~x))} assume ~x - 1 <= 2147483647; {12174#(<= 0 (+ 67 g_~x))} is VALID [2022-02-21 03:03:22,348 INFO L290 TraceCheckUtils]: 342: Hoare triple {12174#(<= 0 (+ 67 g_~x))} assume ~x - 1 >= -2147483648; {12174#(<= 0 (+ 67 g_~x))} is VALID [2022-02-21 03:03:22,348 INFO L272 TraceCheckUtils]: 343: Hoare triple {12174#(<= 0 (+ 67 g_~x))} call #t~ret0 := g(~x - 1); {12175#(<= 0 (+ 68 |g_#in~x|))} is VALID [2022-02-21 03:03:22,348 INFO L290 TraceCheckUtils]: 344: Hoare triple {12175#(<= 0 (+ 68 |g_#in~x|))} ~x := #in~x; {12176#(<= 0 (+ 68 g_~x))} is VALID [2022-02-21 03:03:22,349 INFO L290 TraceCheckUtils]: 345: Hoare triple {12176#(<= 0 (+ 68 g_~x))} assume !(0 == ~x); {12176#(<= 0 (+ 68 g_~x))} is VALID [2022-02-21 03:03:22,349 INFO L290 TraceCheckUtils]: 346: Hoare triple {12176#(<= 0 (+ 68 g_~x))} assume ~x - 1 <= 2147483647; {12176#(<= 0 (+ 68 g_~x))} is VALID [2022-02-21 03:03:22,349 INFO L290 TraceCheckUtils]: 347: Hoare triple {12176#(<= 0 (+ 68 g_~x))} assume ~x - 1 >= -2147483648; {12176#(<= 0 (+ 68 g_~x))} is VALID [2022-02-21 03:03:22,350 INFO L272 TraceCheckUtils]: 348: Hoare triple {12176#(<= 0 (+ 68 g_~x))} call #t~ret0 := g(~x - 1); {12177#(<= 0 (+ |g_#in~x| 69))} is VALID [2022-02-21 03:03:22,350 INFO L290 TraceCheckUtils]: 349: Hoare triple {12177#(<= 0 (+ |g_#in~x| 69))} ~x := #in~x; {12178#(<= 0 (+ 69 g_~x))} is VALID [2022-02-21 03:03:22,350 INFO L290 TraceCheckUtils]: 350: Hoare triple {12178#(<= 0 (+ 69 g_~x))} assume !(0 == ~x); {12178#(<= 0 (+ 69 g_~x))} is VALID [2022-02-21 03:03:22,350 INFO L290 TraceCheckUtils]: 351: Hoare triple {12178#(<= 0 (+ 69 g_~x))} assume ~x - 1 <= 2147483647; {12178#(<= 0 (+ 69 g_~x))} is VALID [2022-02-21 03:03:22,351 INFO L290 TraceCheckUtils]: 352: Hoare triple {12178#(<= 0 (+ 69 g_~x))} assume ~x - 1 >= -2147483648; {12178#(<= 0 (+ 69 g_~x))} is VALID [2022-02-21 03:03:22,351 INFO L272 TraceCheckUtils]: 353: Hoare triple {12178#(<= 0 (+ 69 g_~x))} call #t~ret0 := g(~x - 1); {12179#(<= 0 (+ |g_#in~x| 70))} is VALID [2022-02-21 03:03:22,351 INFO L290 TraceCheckUtils]: 354: Hoare triple {12179#(<= 0 (+ |g_#in~x| 70))} ~x := #in~x; {12180#(<= 0 (+ g_~x 70))} is VALID [2022-02-21 03:03:22,352 INFO L290 TraceCheckUtils]: 355: Hoare triple {12180#(<= 0 (+ g_~x 70))} assume !(0 == ~x); {12180#(<= 0 (+ g_~x 70))} is VALID [2022-02-21 03:03:22,352 INFO L290 TraceCheckUtils]: 356: Hoare triple {12180#(<= 0 (+ g_~x 70))} assume ~x - 1 <= 2147483647; {12180#(<= 0 (+ g_~x 70))} is VALID [2022-02-21 03:03:22,352 INFO L290 TraceCheckUtils]: 357: Hoare triple {12180#(<= 0 (+ g_~x 70))} assume ~x - 1 >= -2147483648; {12180#(<= 0 (+ g_~x 70))} is VALID [2022-02-21 03:03:22,352 INFO L272 TraceCheckUtils]: 358: Hoare triple {12180#(<= 0 (+ g_~x 70))} call #t~ret0 := g(~x - 1); {12181#(<= 0 (+ |g_#in~x| 71))} is VALID [2022-02-21 03:03:22,353 INFO L290 TraceCheckUtils]: 359: Hoare triple {12181#(<= 0 (+ |g_#in~x| 71))} ~x := #in~x; {12182#(<= 0 (+ 71 g_~x))} is VALID [2022-02-21 03:03:22,353 INFO L290 TraceCheckUtils]: 360: Hoare triple {12182#(<= 0 (+ 71 g_~x))} assume !(0 == ~x); {12182#(<= 0 (+ 71 g_~x))} is VALID [2022-02-21 03:03:22,353 INFO L290 TraceCheckUtils]: 361: Hoare triple {12182#(<= 0 (+ 71 g_~x))} assume ~x - 1 <= 2147483647; {12182#(<= 0 (+ 71 g_~x))} is VALID [2022-02-21 03:03:22,355 INFO L290 TraceCheckUtils]: 362: Hoare triple {12182#(<= 0 (+ 71 g_~x))} assume ~x - 1 >= -2147483648; {12182#(<= 0 (+ 71 g_~x))} is VALID [2022-02-21 03:03:22,356 INFO L272 TraceCheckUtils]: 363: Hoare triple {12182#(<= 0 (+ 71 g_~x))} call #t~ret0 := g(~x - 1); {12183#(<= 0 (+ 72 |g_#in~x|))} is VALID [2022-02-21 03:03:22,357 INFO L290 TraceCheckUtils]: 364: Hoare triple {12183#(<= 0 (+ 72 |g_#in~x|))} ~x := #in~x; {12184#(<= 0 (+ 72 g_~x))} is VALID [2022-02-21 03:03:22,357 INFO L290 TraceCheckUtils]: 365: Hoare triple {12184#(<= 0 (+ 72 g_~x))} assume !(0 == ~x); {12184#(<= 0 (+ 72 g_~x))} is VALID [2022-02-21 03:03:22,357 INFO L290 TraceCheckUtils]: 366: Hoare triple {12184#(<= 0 (+ 72 g_~x))} assume ~x - 1 <= 2147483647; {12184#(<= 0 (+ 72 g_~x))} is VALID [2022-02-21 03:03:22,357 INFO L290 TraceCheckUtils]: 367: Hoare triple {12184#(<= 0 (+ 72 g_~x))} assume ~x - 1 >= -2147483648; {12184#(<= 0 (+ 72 g_~x))} is VALID [2022-02-21 03:03:22,358 INFO L272 TraceCheckUtils]: 368: Hoare triple {12184#(<= 0 (+ 72 g_~x))} call #t~ret0 := g(~x - 1); {12185#(<= 0 (+ |g_#in~x| 73))} is VALID [2022-02-21 03:03:22,358 INFO L290 TraceCheckUtils]: 369: Hoare triple {12185#(<= 0 (+ |g_#in~x| 73))} ~x := #in~x; {12186#(<= 0 (+ g_~x 73))} is VALID [2022-02-21 03:03:22,358 INFO L290 TraceCheckUtils]: 370: Hoare triple {12186#(<= 0 (+ g_~x 73))} assume !(0 == ~x); {12186#(<= 0 (+ g_~x 73))} is VALID [2022-02-21 03:03:22,359 INFO L290 TraceCheckUtils]: 371: Hoare triple {12186#(<= 0 (+ g_~x 73))} assume ~x - 1 <= 2147483647; {12186#(<= 0 (+ g_~x 73))} is VALID [2022-02-21 03:03:22,359 INFO L290 TraceCheckUtils]: 372: Hoare triple {12186#(<= 0 (+ g_~x 73))} assume ~x - 1 >= -2147483648; {12186#(<= 0 (+ g_~x 73))} is VALID [2022-02-21 03:03:22,359 INFO L272 TraceCheckUtils]: 373: Hoare triple {12186#(<= 0 (+ g_~x 73))} call #t~ret0 := g(~x - 1); {12187#(<= 0 (+ |g_#in~x| 74))} is VALID [2022-02-21 03:03:22,360 INFO L290 TraceCheckUtils]: 374: Hoare triple {12187#(<= 0 (+ |g_#in~x| 74))} ~x := #in~x; {12188#(<= 0 (+ g_~x 74))} is VALID [2022-02-21 03:03:22,360 INFO L290 TraceCheckUtils]: 375: Hoare triple {12188#(<= 0 (+ g_~x 74))} assume !(0 == ~x); {12188#(<= 0 (+ g_~x 74))} is VALID [2022-02-21 03:03:22,360 INFO L290 TraceCheckUtils]: 376: Hoare triple {12188#(<= 0 (+ g_~x 74))} assume ~x - 1 <= 2147483647; {12188#(<= 0 (+ g_~x 74))} is VALID [2022-02-21 03:03:22,360 INFO L290 TraceCheckUtils]: 377: Hoare triple {12188#(<= 0 (+ g_~x 74))} assume ~x - 1 >= -2147483648; {12188#(<= 0 (+ g_~x 74))} is VALID [2022-02-21 03:03:22,361 INFO L272 TraceCheckUtils]: 378: Hoare triple {12188#(<= 0 (+ g_~x 74))} call #t~ret0 := g(~x - 1); {12189#(<= 0 (+ |g_#in~x| 75))} is VALID [2022-02-21 03:03:22,361 INFO L290 TraceCheckUtils]: 379: Hoare triple {12189#(<= 0 (+ |g_#in~x| 75))} ~x := #in~x; {12190#(<= 0 (+ g_~x 75))} is VALID [2022-02-21 03:03:22,361 INFO L290 TraceCheckUtils]: 380: Hoare triple {12190#(<= 0 (+ g_~x 75))} assume !(0 == ~x); {12190#(<= 0 (+ g_~x 75))} is VALID [2022-02-21 03:03:22,361 INFO L290 TraceCheckUtils]: 381: Hoare triple {12190#(<= 0 (+ g_~x 75))} assume ~x - 1 <= 2147483647; {12190#(<= 0 (+ g_~x 75))} is VALID [2022-02-21 03:03:22,362 INFO L290 TraceCheckUtils]: 382: Hoare triple {12190#(<= 0 (+ g_~x 75))} assume ~x - 1 >= -2147483648; {12190#(<= 0 (+ g_~x 75))} is VALID [2022-02-21 03:03:22,362 INFO L272 TraceCheckUtils]: 383: Hoare triple {12190#(<= 0 (+ g_~x 75))} call #t~ret0 := g(~x - 1); {12191#(<= 0 (+ 76 |g_#in~x|))} is VALID [2022-02-21 03:03:22,362 INFO L290 TraceCheckUtils]: 384: Hoare triple {12191#(<= 0 (+ 76 |g_#in~x|))} ~x := #in~x; {12192#(<= 0 (+ 76 g_~x))} is VALID [2022-02-21 03:03:22,362 INFO L290 TraceCheckUtils]: 385: Hoare triple {12192#(<= 0 (+ 76 g_~x))} assume !(0 == ~x); {12192#(<= 0 (+ 76 g_~x))} is VALID [2022-02-21 03:03:22,363 INFO L290 TraceCheckUtils]: 386: Hoare triple {12192#(<= 0 (+ 76 g_~x))} assume ~x - 1 <= 2147483647; {12192#(<= 0 (+ 76 g_~x))} is VALID [2022-02-21 03:03:22,363 INFO L290 TraceCheckUtils]: 387: Hoare triple {12192#(<= 0 (+ 76 g_~x))} assume ~x - 1 >= -2147483648; {12192#(<= 0 (+ 76 g_~x))} is VALID [2022-02-21 03:03:22,363 INFO L272 TraceCheckUtils]: 388: Hoare triple {12192#(<= 0 (+ 76 g_~x))} call #t~ret0 := g(~x - 1); {12193#(<= 0 (+ 77 |g_#in~x|))} is VALID [2022-02-21 03:03:22,364 INFO L290 TraceCheckUtils]: 389: Hoare triple {12193#(<= 0 (+ 77 |g_#in~x|))} ~x := #in~x; {12194#(<= 0 (+ 77 g_~x))} is VALID [2022-02-21 03:03:22,364 INFO L290 TraceCheckUtils]: 390: Hoare triple {12194#(<= 0 (+ 77 g_~x))} assume !(0 == ~x); {12194#(<= 0 (+ 77 g_~x))} is VALID [2022-02-21 03:03:22,364 INFO L290 TraceCheckUtils]: 391: Hoare triple {12194#(<= 0 (+ 77 g_~x))} assume ~x - 1 <= 2147483647; {12194#(<= 0 (+ 77 g_~x))} is VALID [2022-02-21 03:03:22,364 INFO L290 TraceCheckUtils]: 392: Hoare triple {12194#(<= 0 (+ 77 g_~x))} assume ~x - 1 >= -2147483648; {12194#(<= 0 (+ 77 g_~x))} is VALID [2022-02-21 03:03:22,365 INFO L272 TraceCheckUtils]: 393: Hoare triple {12194#(<= 0 (+ 77 g_~x))} call #t~ret0 := g(~x - 1); {12195#(<= 0 (+ |g_#in~x| 78))} is VALID [2022-02-21 03:03:22,365 INFO L290 TraceCheckUtils]: 394: Hoare triple {12195#(<= 0 (+ |g_#in~x| 78))} ~x := #in~x; {12196#(<= 0 (+ g_~x 78))} is VALID [2022-02-21 03:03:22,365 INFO L290 TraceCheckUtils]: 395: Hoare triple {12196#(<= 0 (+ g_~x 78))} assume !(0 == ~x); {12196#(<= 0 (+ g_~x 78))} is VALID [2022-02-21 03:03:22,365 INFO L290 TraceCheckUtils]: 396: Hoare triple {12196#(<= 0 (+ g_~x 78))} assume ~x - 1 <= 2147483647; {12196#(<= 0 (+ g_~x 78))} is VALID [2022-02-21 03:03:22,366 INFO L290 TraceCheckUtils]: 397: Hoare triple {12196#(<= 0 (+ g_~x 78))} assume ~x - 1 >= -2147483648; {12196#(<= 0 (+ g_~x 78))} is VALID [2022-02-21 03:03:22,366 INFO L272 TraceCheckUtils]: 398: Hoare triple {12196#(<= 0 (+ g_~x 78))} call #t~ret0 := g(~x - 1); {12197#(<= 0 (+ |g_#in~x| 79))} is VALID [2022-02-21 03:03:22,366 INFO L290 TraceCheckUtils]: 399: Hoare triple {12197#(<= 0 (+ |g_#in~x| 79))} ~x := #in~x; {12198#(<= 0 (+ g_~x 79))} is VALID [2022-02-21 03:03:22,366 INFO L290 TraceCheckUtils]: 400: Hoare triple {12198#(<= 0 (+ g_~x 79))} assume !(0 == ~x); {12198#(<= 0 (+ g_~x 79))} is VALID [2022-02-21 03:03:22,367 INFO L290 TraceCheckUtils]: 401: Hoare triple {12198#(<= 0 (+ g_~x 79))} assume ~x - 1 <= 2147483647; {12198#(<= 0 (+ g_~x 79))} is VALID [2022-02-21 03:03:22,367 INFO L290 TraceCheckUtils]: 402: Hoare triple {12198#(<= 0 (+ g_~x 79))} assume ~x - 1 >= -2147483648; {12198#(<= 0 (+ g_~x 79))} is VALID [2022-02-21 03:03:22,367 INFO L272 TraceCheckUtils]: 403: Hoare triple {12198#(<= 0 (+ g_~x 79))} call #t~ret0 := g(~x - 1); {12199#(<= 0 (+ |g_#in~x| 80))} is VALID [2022-02-21 03:03:22,368 INFO L290 TraceCheckUtils]: 404: Hoare triple {12199#(<= 0 (+ |g_#in~x| 80))} ~x := #in~x; {12200#(<= 0 (+ g_~x 80))} is VALID [2022-02-21 03:03:22,368 INFO L290 TraceCheckUtils]: 405: Hoare triple {12200#(<= 0 (+ g_~x 80))} assume !(0 == ~x); {12200#(<= 0 (+ g_~x 80))} is VALID [2022-02-21 03:03:22,368 INFO L290 TraceCheckUtils]: 406: Hoare triple {12200#(<= 0 (+ g_~x 80))} assume ~x - 1 <= 2147483647; {12200#(<= 0 (+ g_~x 80))} is VALID [2022-02-21 03:03:22,368 INFO L290 TraceCheckUtils]: 407: Hoare triple {12200#(<= 0 (+ g_~x 80))} assume ~x - 1 >= -2147483648; {12200#(<= 0 (+ g_~x 80))} is VALID [2022-02-21 03:03:22,369 INFO L272 TraceCheckUtils]: 408: Hoare triple {12200#(<= 0 (+ g_~x 80))} call #t~ret0 := g(~x - 1); {12201#(<= 0 (+ |g_#in~x| 81))} is VALID [2022-02-21 03:03:22,369 INFO L290 TraceCheckUtils]: 409: Hoare triple {12201#(<= 0 (+ |g_#in~x| 81))} ~x := #in~x; {12202#(<= 0 (+ 81 g_~x))} is VALID [2022-02-21 03:03:22,369 INFO L290 TraceCheckUtils]: 410: Hoare triple {12202#(<= 0 (+ 81 g_~x))} assume !(0 == ~x); {12202#(<= 0 (+ 81 g_~x))} is VALID [2022-02-21 03:03:22,369 INFO L290 TraceCheckUtils]: 411: Hoare triple {12202#(<= 0 (+ 81 g_~x))} assume ~x - 1 <= 2147483647; {12202#(<= 0 (+ 81 g_~x))} is VALID [2022-02-21 03:03:22,370 INFO L290 TraceCheckUtils]: 412: Hoare triple {12202#(<= 0 (+ 81 g_~x))} assume ~x - 1 >= -2147483648; {12202#(<= 0 (+ 81 g_~x))} is VALID [2022-02-21 03:03:22,370 INFO L272 TraceCheckUtils]: 413: Hoare triple {12202#(<= 0 (+ 81 g_~x))} call #t~ret0 := g(~x - 1); {12203#(<= 0 (+ |g_#in~x| 82))} is VALID [2022-02-21 03:03:22,370 INFO L290 TraceCheckUtils]: 414: Hoare triple {12203#(<= 0 (+ |g_#in~x| 82))} ~x := #in~x; {12204#(<= 0 (+ 82 g_~x))} is VALID [2022-02-21 03:03:22,371 INFO L290 TraceCheckUtils]: 415: Hoare triple {12204#(<= 0 (+ 82 g_~x))} assume !(0 == ~x); {12204#(<= 0 (+ 82 g_~x))} is VALID [2022-02-21 03:03:22,371 INFO L290 TraceCheckUtils]: 416: Hoare triple {12204#(<= 0 (+ 82 g_~x))} assume ~x - 1 <= 2147483647; {12204#(<= 0 (+ 82 g_~x))} is VALID [2022-02-21 03:03:22,371 INFO L290 TraceCheckUtils]: 417: Hoare triple {12204#(<= 0 (+ 82 g_~x))} assume ~x - 1 >= -2147483648; {12204#(<= 0 (+ 82 g_~x))} is VALID [2022-02-21 03:03:22,372 INFO L272 TraceCheckUtils]: 418: Hoare triple {12204#(<= 0 (+ 82 g_~x))} call #t~ret0 := g(~x - 1); {12205#(<= 0 (+ |g_#in~x| 83))} is VALID [2022-02-21 03:03:22,372 INFO L290 TraceCheckUtils]: 419: Hoare triple {12205#(<= 0 (+ |g_#in~x| 83))} ~x := #in~x; {12206#(<= 0 (+ g_~x 83))} is VALID [2022-02-21 03:03:22,372 INFO L290 TraceCheckUtils]: 420: Hoare triple {12206#(<= 0 (+ g_~x 83))} assume !(0 == ~x); {12206#(<= 0 (+ g_~x 83))} is VALID [2022-02-21 03:03:22,382 INFO L290 TraceCheckUtils]: 421: Hoare triple {12206#(<= 0 (+ g_~x 83))} assume ~x - 1 <= 2147483647; {12206#(<= 0 (+ g_~x 83))} is VALID [2022-02-21 03:03:22,382 INFO L290 TraceCheckUtils]: 422: Hoare triple {12206#(<= 0 (+ g_~x 83))} assume ~x - 1 >= -2147483648; {12206#(<= 0 (+ g_~x 83))} is VALID [2022-02-21 03:03:22,383 INFO L272 TraceCheckUtils]: 423: Hoare triple {12206#(<= 0 (+ g_~x 83))} call #t~ret0 := g(~x - 1); {12207#(<= 0 (+ |g_#in~x| 84))} is VALID [2022-02-21 03:03:22,383 INFO L290 TraceCheckUtils]: 424: Hoare triple {12207#(<= 0 (+ |g_#in~x| 84))} ~x := #in~x; {12208#(<= 0 (+ 84 g_~x))} is VALID [2022-02-21 03:03:22,384 INFO L290 TraceCheckUtils]: 425: Hoare triple {12208#(<= 0 (+ 84 g_~x))} assume !(0 == ~x); {12208#(<= 0 (+ 84 g_~x))} is VALID [2022-02-21 03:03:22,384 INFO L290 TraceCheckUtils]: 426: Hoare triple {12208#(<= 0 (+ 84 g_~x))} assume ~x - 1 <= 2147483647; {12208#(<= 0 (+ 84 g_~x))} is VALID [2022-02-21 03:03:22,384 INFO L290 TraceCheckUtils]: 427: Hoare triple {12208#(<= 0 (+ 84 g_~x))} assume ~x - 1 >= -2147483648; {12208#(<= 0 (+ 84 g_~x))} is VALID [2022-02-21 03:03:22,384 INFO L272 TraceCheckUtils]: 428: Hoare triple {12208#(<= 0 (+ 84 g_~x))} call #t~ret0 := g(~x - 1); {12209#(<= 0 (+ |g_#in~x| 85))} is VALID [2022-02-21 03:03:22,385 INFO L290 TraceCheckUtils]: 429: Hoare triple {12209#(<= 0 (+ |g_#in~x| 85))} ~x := #in~x; {12210#(<= 0 (+ g_~x 85))} is VALID [2022-02-21 03:03:22,385 INFO L290 TraceCheckUtils]: 430: Hoare triple {12210#(<= 0 (+ g_~x 85))} assume !(0 == ~x); {12210#(<= 0 (+ g_~x 85))} is VALID [2022-02-21 03:03:22,385 INFO L290 TraceCheckUtils]: 431: Hoare triple {12210#(<= 0 (+ g_~x 85))} assume ~x - 1 <= 2147483647; {12210#(<= 0 (+ g_~x 85))} is VALID [2022-02-21 03:03:22,385 INFO L290 TraceCheckUtils]: 432: Hoare triple {12210#(<= 0 (+ g_~x 85))} assume ~x - 1 >= -2147483648; {12210#(<= 0 (+ g_~x 85))} is VALID [2022-02-21 03:03:22,386 INFO L272 TraceCheckUtils]: 433: Hoare triple {12210#(<= 0 (+ g_~x 85))} call #t~ret0 := g(~x - 1); {12211#(<= 0 (+ |g_#in~x| 86))} is VALID [2022-02-21 03:03:22,386 INFO L290 TraceCheckUtils]: 434: Hoare triple {12211#(<= 0 (+ |g_#in~x| 86))} ~x := #in~x; {12212#(<= 0 (+ g_~x 86))} is VALID [2022-02-21 03:03:22,386 INFO L290 TraceCheckUtils]: 435: Hoare triple {12212#(<= 0 (+ g_~x 86))} assume !(0 == ~x); {12212#(<= 0 (+ g_~x 86))} is VALID [2022-02-21 03:03:22,387 INFO L290 TraceCheckUtils]: 436: Hoare triple {12212#(<= 0 (+ g_~x 86))} assume ~x - 1 <= 2147483647; {12212#(<= 0 (+ g_~x 86))} is VALID [2022-02-21 03:03:22,387 INFO L290 TraceCheckUtils]: 437: Hoare triple {12212#(<= 0 (+ g_~x 86))} assume ~x - 1 >= -2147483648; {12212#(<= 0 (+ g_~x 86))} is VALID [2022-02-21 03:03:22,387 INFO L272 TraceCheckUtils]: 438: Hoare triple {12212#(<= 0 (+ g_~x 86))} call #t~ret0 := g(~x - 1); {12213#(<= 0 (+ 87 |g_#in~x|))} is VALID [2022-02-21 03:03:22,387 INFO L290 TraceCheckUtils]: 439: Hoare triple {12213#(<= 0 (+ 87 |g_#in~x|))} ~x := #in~x; {12214#(<= 0 (+ 87 g_~x))} is VALID [2022-02-21 03:03:22,388 INFO L290 TraceCheckUtils]: 440: Hoare triple {12214#(<= 0 (+ 87 g_~x))} assume !(0 == ~x); {12214#(<= 0 (+ 87 g_~x))} is VALID [2022-02-21 03:03:22,388 INFO L290 TraceCheckUtils]: 441: Hoare triple {12214#(<= 0 (+ 87 g_~x))} assume ~x - 1 <= 2147483647; {12214#(<= 0 (+ 87 g_~x))} is VALID [2022-02-21 03:03:22,388 INFO L290 TraceCheckUtils]: 442: Hoare triple {12214#(<= 0 (+ 87 g_~x))} assume ~x - 1 >= -2147483648; {12214#(<= 0 (+ 87 g_~x))} is VALID [2022-02-21 03:03:22,389 INFO L272 TraceCheckUtils]: 443: Hoare triple {12214#(<= 0 (+ 87 g_~x))} call #t~ret0 := g(~x - 1); {12215#(<= 0 (+ 88 |g_#in~x|))} is VALID [2022-02-21 03:03:22,389 INFO L290 TraceCheckUtils]: 444: Hoare triple {12215#(<= 0 (+ 88 |g_#in~x|))} ~x := #in~x; {12216#(<= 0 (+ 88 g_~x))} is VALID [2022-02-21 03:03:22,389 INFO L290 TraceCheckUtils]: 445: Hoare triple {12216#(<= 0 (+ 88 g_~x))} assume !(0 == ~x); {12216#(<= 0 (+ 88 g_~x))} is VALID [2022-02-21 03:03:22,389 INFO L290 TraceCheckUtils]: 446: Hoare triple {12216#(<= 0 (+ 88 g_~x))} assume ~x - 1 <= 2147483647; {12216#(<= 0 (+ 88 g_~x))} is VALID [2022-02-21 03:03:22,390 INFO L290 TraceCheckUtils]: 447: Hoare triple {12216#(<= 0 (+ 88 g_~x))} assume ~x - 1 >= -2147483648; {12216#(<= 0 (+ 88 g_~x))} is VALID [2022-02-21 03:03:22,390 INFO L272 TraceCheckUtils]: 448: Hoare triple {12216#(<= 0 (+ 88 g_~x))} call #t~ret0 := g(~x - 1); {12217#(<= 0 (+ |g_#in~x| 89))} is VALID [2022-02-21 03:03:22,390 INFO L290 TraceCheckUtils]: 449: Hoare triple {12217#(<= 0 (+ |g_#in~x| 89))} ~x := #in~x; {12218#(<= 0 (+ g_~x 89))} is VALID [2022-02-21 03:03:22,390 INFO L290 TraceCheckUtils]: 450: Hoare triple {12218#(<= 0 (+ g_~x 89))} assume !(0 == ~x); {12218#(<= 0 (+ g_~x 89))} is VALID [2022-02-21 03:03:22,391 INFO L290 TraceCheckUtils]: 451: Hoare triple {12218#(<= 0 (+ g_~x 89))} assume ~x - 1 <= 2147483647; {12218#(<= 0 (+ g_~x 89))} is VALID [2022-02-21 03:03:22,391 INFO L290 TraceCheckUtils]: 452: Hoare triple {12218#(<= 0 (+ g_~x 89))} assume ~x - 1 >= -2147483648; {12218#(<= 0 (+ g_~x 89))} is VALID [2022-02-21 03:03:22,391 INFO L272 TraceCheckUtils]: 453: Hoare triple {12218#(<= 0 (+ g_~x 89))} call #t~ret0 := g(~x - 1); {12219#(<= 0 (+ |g_#in~x| 90))} is VALID [2022-02-21 03:03:22,392 INFO L290 TraceCheckUtils]: 454: Hoare triple {12219#(<= 0 (+ |g_#in~x| 90))} ~x := #in~x; {12220#(<= 0 (+ g_~x 90))} is VALID [2022-02-21 03:03:22,392 INFO L290 TraceCheckUtils]: 455: Hoare triple {12220#(<= 0 (+ g_~x 90))} assume !(0 == ~x); {12220#(<= 0 (+ g_~x 90))} is VALID [2022-02-21 03:03:22,392 INFO L290 TraceCheckUtils]: 456: Hoare triple {12220#(<= 0 (+ g_~x 90))} assume ~x - 1 <= 2147483647; {12220#(<= 0 (+ g_~x 90))} is VALID [2022-02-21 03:03:22,392 INFO L290 TraceCheckUtils]: 457: Hoare triple {12220#(<= 0 (+ g_~x 90))} assume ~x - 1 >= -2147483648; {12220#(<= 0 (+ g_~x 90))} is VALID [2022-02-21 03:03:22,393 INFO L272 TraceCheckUtils]: 458: Hoare triple {12220#(<= 0 (+ g_~x 90))} call #t~ret0 := g(~x - 1); {12221#(<= 0 (+ 91 |g_#in~x|))} is VALID [2022-02-21 03:03:22,393 INFO L290 TraceCheckUtils]: 459: Hoare triple {12221#(<= 0 (+ 91 |g_#in~x|))} ~x := #in~x; {12222#(<= 0 (+ 91 g_~x))} is VALID [2022-02-21 03:03:22,393 INFO L290 TraceCheckUtils]: 460: Hoare triple {12222#(<= 0 (+ 91 g_~x))} assume !(0 == ~x); {12222#(<= 0 (+ 91 g_~x))} is VALID [2022-02-21 03:03:22,393 INFO L290 TraceCheckUtils]: 461: Hoare triple {12222#(<= 0 (+ 91 g_~x))} assume ~x - 1 <= 2147483647; {12222#(<= 0 (+ 91 g_~x))} is VALID [2022-02-21 03:03:22,394 INFO L290 TraceCheckUtils]: 462: Hoare triple {12222#(<= 0 (+ 91 g_~x))} assume ~x - 1 >= -2147483648; {12222#(<= 0 (+ 91 g_~x))} is VALID [2022-02-21 03:03:22,394 INFO L272 TraceCheckUtils]: 463: Hoare triple {12222#(<= 0 (+ 91 g_~x))} call #t~ret0 := g(~x - 1); {12223#(<= 0 (+ 92 |g_#in~x|))} is VALID [2022-02-21 03:03:22,394 INFO L290 TraceCheckUtils]: 464: Hoare triple {12223#(<= 0 (+ 92 |g_#in~x|))} ~x := #in~x; {12224#(<= 0 (+ 92 g_~x))} is VALID [2022-02-21 03:03:22,394 INFO L290 TraceCheckUtils]: 465: Hoare triple {12224#(<= 0 (+ 92 g_~x))} assume !(0 == ~x); {12224#(<= 0 (+ 92 g_~x))} is VALID [2022-02-21 03:03:22,395 INFO L290 TraceCheckUtils]: 466: Hoare triple {12224#(<= 0 (+ 92 g_~x))} assume ~x - 1 <= 2147483647; {12224#(<= 0 (+ 92 g_~x))} is VALID [2022-02-21 03:03:22,395 INFO L290 TraceCheckUtils]: 467: Hoare triple {12224#(<= 0 (+ 92 g_~x))} assume ~x - 1 >= -2147483648; {12224#(<= 0 (+ 92 g_~x))} is VALID [2022-02-21 03:03:22,395 INFO L272 TraceCheckUtils]: 468: Hoare triple {12224#(<= 0 (+ 92 g_~x))} call #t~ret0 := g(~x - 1); {12225#(<= 0 (+ |g_#in~x| 93))} is VALID [2022-02-21 03:03:22,396 INFO L290 TraceCheckUtils]: 469: Hoare triple {12225#(<= 0 (+ |g_#in~x| 93))} ~x := #in~x; {12226#(<= 0 (+ g_~x 93))} is VALID [2022-02-21 03:03:22,396 INFO L290 TraceCheckUtils]: 470: Hoare triple {12226#(<= 0 (+ g_~x 93))} assume !(0 == ~x); {12226#(<= 0 (+ g_~x 93))} is VALID [2022-02-21 03:03:22,396 INFO L290 TraceCheckUtils]: 471: Hoare triple {12226#(<= 0 (+ g_~x 93))} assume ~x - 1 <= 2147483647; {12226#(<= 0 (+ g_~x 93))} is VALID [2022-02-21 03:03:22,396 INFO L290 TraceCheckUtils]: 472: Hoare triple {12226#(<= 0 (+ g_~x 93))} assume ~x - 1 >= -2147483648; {12226#(<= 0 (+ g_~x 93))} is VALID [2022-02-21 03:03:22,397 INFO L272 TraceCheckUtils]: 473: Hoare triple {12226#(<= 0 (+ g_~x 93))} call #t~ret0 := g(~x - 1); {12227#(<= 0 (+ 94 |g_#in~x|))} is VALID [2022-02-21 03:03:22,397 INFO L290 TraceCheckUtils]: 474: Hoare triple {12227#(<= 0 (+ 94 |g_#in~x|))} ~x := #in~x; {12228#(<= 0 (+ 94 g_~x))} is VALID [2022-02-21 03:03:22,397 INFO L290 TraceCheckUtils]: 475: Hoare triple {12228#(<= 0 (+ 94 g_~x))} assume !(0 == ~x); {12228#(<= 0 (+ 94 g_~x))} is VALID [2022-02-21 03:03:22,397 INFO L290 TraceCheckUtils]: 476: Hoare triple {12228#(<= 0 (+ 94 g_~x))} assume ~x - 1 <= 2147483647; {12228#(<= 0 (+ 94 g_~x))} is VALID [2022-02-21 03:03:22,398 INFO L290 TraceCheckUtils]: 477: Hoare triple {12228#(<= 0 (+ 94 g_~x))} assume !(~x - 1 >= -2147483648); {12037#false} is VALID [2022-02-21 03:03:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 22231 backedges. 0 proven. 22231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:22,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:22,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785643800] [2022-02-21 03:03:22,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785643800] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:22,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751887211] [2022-02-21 03:03:22,407 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-21 03:03:22,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:22,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:22,409 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:22,409 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:22,715 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2022-02-21 03:03:22,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:22,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 192 conjunts are in the unsatisfiable core [2022-02-21 03:03:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:22,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:25,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {12036#true} assume { :begin_inline_ULTIMATE.init } true; {12036#true} is VALID [2022-02-21 03:03:25,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {12036#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {12036#true} is VALID [2022-02-21 03:03:25,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {12036#true} assume !(main_~x~0#1 < 0); {12038#(<= 0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:03:25,624 INFO L272 TraceCheckUtils]: 3: Hoare triple {12038#(<= 0 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret3#1 := g(main_~x~0#1); {12039#(<= 0 |g_#in~x|)} is VALID [2022-02-21 03:03:25,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {12039#(<= 0 |g_#in~x|)} ~x := #in~x; {12040#(<= 0 g_~x)} is VALID [2022-02-21 03:03:25,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {12040#(<= 0 g_~x)} assume !(0 == ~x); {12040#(<= 0 g_~x)} is VALID [2022-02-21 03:03:25,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {12040#(<= 0 g_~x)} assume ~x - 1 <= 2147483647; {12040#(<= 0 g_~x)} is VALID [2022-02-21 03:03:25,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {12040#(<= 0 g_~x)} assume ~x - 1 >= -2147483648; {12040#(<= 0 g_~x)} is VALID [2022-02-21 03:03:25,626 INFO L272 TraceCheckUtils]: 8: Hoare triple {12040#(<= 0 g_~x)} call #t~ret0 := g(~x - 1); {12041#(<= 0 (+ |g_#in~x| 1))} is VALID [2022-02-21 03:03:25,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {12041#(<= 0 (+ |g_#in~x| 1))} ~x := #in~x; {12042#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:25,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {12042#(<= 0 (+ g_~x 1))} assume !(0 == ~x); {12042#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:25,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {12042#(<= 0 (+ g_~x 1))} assume ~x - 1 <= 2147483647; {12042#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:25,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {12042#(<= 0 (+ g_~x 1))} assume ~x - 1 >= -2147483648; {12042#(<= 0 (+ g_~x 1))} is VALID [2022-02-21 03:03:25,628 INFO L272 TraceCheckUtils]: 13: Hoare triple {12042#(<= 0 (+ g_~x 1))} call #t~ret0 := g(~x - 1); {12043#(<= 0 (+ |g_#in~x| 2))} is VALID [2022-02-21 03:03:25,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {12043#(<= 0 (+ |g_#in~x| 2))} ~x := #in~x; {12044#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:25,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {12044#(<= 0 (+ 2 g_~x))} assume !(0 == ~x); {12044#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:25,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {12044#(<= 0 (+ 2 g_~x))} assume ~x - 1 <= 2147483647; {12044#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:25,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {12044#(<= 0 (+ 2 g_~x))} assume ~x - 1 >= -2147483648; {12044#(<= 0 (+ 2 g_~x))} is VALID [2022-02-21 03:03:25,629 INFO L272 TraceCheckUtils]: 18: Hoare triple {12044#(<= 0 (+ 2 g_~x))} call #t~ret0 := g(~x - 1); {12045#(<= 0 (+ |g_#in~x| 3))} is VALID [2022-02-21 03:03:25,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {12045#(<= 0 (+ |g_#in~x| 3))} ~x := #in~x; {12046#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:25,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {12046#(<= 0 (+ 3 g_~x))} assume !(0 == ~x); {12046#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:25,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {12046#(<= 0 (+ 3 g_~x))} assume ~x - 1 <= 2147483647; {12046#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:25,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {12046#(<= 0 (+ 3 g_~x))} assume ~x - 1 >= -2147483648; {12046#(<= 0 (+ 3 g_~x))} is VALID [2022-02-21 03:03:25,631 INFO L272 TraceCheckUtils]: 23: Hoare triple {12046#(<= 0 (+ 3 g_~x))} call #t~ret0 := g(~x - 1); {12047#(<= 0 (+ |g_#in~x| 4))} is VALID [2022-02-21 03:03:25,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {12047#(<= 0 (+ |g_#in~x| 4))} ~x := #in~x; {12048#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:25,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {12048#(<= 0 (+ g_~x 4))} assume !(0 == ~x); {12048#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:25,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {12048#(<= 0 (+ g_~x 4))} assume ~x - 1 <= 2147483647; {12048#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:25,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {12048#(<= 0 (+ g_~x 4))} assume ~x - 1 >= -2147483648; {12048#(<= 0 (+ g_~x 4))} is VALID [2022-02-21 03:03:25,633 INFO L272 TraceCheckUtils]: 28: Hoare triple {12048#(<= 0 (+ g_~x 4))} call #t~ret0 := g(~x - 1); {12049#(<= 0 (+ 5 |g_#in~x|))} is VALID [2022-02-21 03:03:25,633 INFO L290 TraceCheckUtils]: 29: Hoare triple {12049#(<= 0 (+ 5 |g_#in~x|))} ~x := #in~x; {12050#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:25,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {12050#(<= 0 (+ 5 g_~x))} assume !(0 == ~x); {12050#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:25,634 INFO L290 TraceCheckUtils]: 31: Hoare triple {12050#(<= 0 (+ 5 g_~x))} assume ~x - 1 <= 2147483647; {12050#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:25,634 INFO L290 TraceCheckUtils]: 32: Hoare triple {12050#(<= 0 (+ 5 g_~x))} assume ~x - 1 >= -2147483648; {12050#(<= 0 (+ 5 g_~x))} is VALID [2022-02-21 03:03:25,635 INFO L272 TraceCheckUtils]: 33: Hoare triple {12050#(<= 0 (+ 5 g_~x))} call #t~ret0 := g(~x - 1); {12051#(<= 0 (+ |g_#in~x| 6))} is VALID [2022-02-21 03:03:25,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {12051#(<= 0 (+ |g_#in~x| 6))} ~x := #in~x; {12052#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:25,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {12052#(<= 0 (+ 6 g_~x))} assume !(0 == ~x); {12052#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:25,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {12052#(<= 0 (+ 6 g_~x))} assume ~x - 1 <= 2147483647; {12052#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:25,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {12052#(<= 0 (+ 6 g_~x))} assume ~x - 1 >= -2147483648; {12052#(<= 0 (+ 6 g_~x))} is VALID [2022-02-21 03:03:25,637 INFO L272 TraceCheckUtils]: 38: Hoare triple {12052#(<= 0 (+ 6 g_~x))} call #t~ret0 := g(~x - 1); {12053#(<= 0 (+ 7 |g_#in~x|))} is VALID [2022-02-21 03:03:25,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {12053#(<= 0 (+ 7 |g_#in~x|))} ~x := #in~x; {12054#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:25,637 INFO L290 TraceCheckUtils]: 40: Hoare triple {12054#(<= 0 (+ 7 g_~x))} assume !(0 == ~x); {12054#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:25,637 INFO L290 TraceCheckUtils]: 41: Hoare triple {12054#(<= 0 (+ 7 g_~x))} assume ~x - 1 <= 2147483647; {12054#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:25,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {12054#(<= 0 (+ 7 g_~x))} assume ~x - 1 >= -2147483648; {12054#(<= 0 (+ 7 g_~x))} is VALID [2022-02-21 03:03:25,638 INFO L272 TraceCheckUtils]: 43: Hoare triple {12054#(<= 0 (+ 7 g_~x))} call #t~ret0 := g(~x - 1); {12055#(<= 0 (+ |g_#in~x| 8))} is VALID [2022-02-21 03:03:25,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {12055#(<= 0 (+ |g_#in~x| 8))} ~x := #in~x; {12056#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:25,639 INFO L290 TraceCheckUtils]: 45: Hoare triple {12056#(<= 0 (+ g_~x 8))} assume !(0 == ~x); {12056#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:25,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {12056#(<= 0 (+ g_~x 8))} assume ~x - 1 <= 2147483647; {12056#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:25,639 INFO L290 TraceCheckUtils]: 47: Hoare triple {12056#(<= 0 (+ g_~x 8))} assume ~x - 1 >= -2147483648; {12056#(<= 0 (+ g_~x 8))} is VALID [2022-02-21 03:03:25,640 INFO L272 TraceCheckUtils]: 48: Hoare triple {12056#(<= 0 (+ g_~x 8))} call #t~ret0 := g(~x - 1); {12057#(<= 0 (+ |g_#in~x| 9))} is VALID [2022-02-21 03:03:25,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {12057#(<= 0 (+ |g_#in~x| 9))} ~x := #in~x; {12058#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:25,641 INFO L290 TraceCheckUtils]: 50: Hoare triple {12058#(<= 0 (+ 9 g_~x))} assume !(0 == ~x); {12058#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:25,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {12058#(<= 0 (+ 9 g_~x))} assume ~x - 1 <= 2147483647; {12058#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:25,641 INFO L290 TraceCheckUtils]: 52: Hoare triple {12058#(<= 0 (+ 9 g_~x))} assume ~x - 1 >= -2147483648; {12058#(<= 0 (+ 9 g_~x))} is VALID [2022-02-21 03:03:25,642 INFO L272 TraceCheckUtils]: 53: Hoare triple {12058#(<= 0 (+ 9 g_~x))} call #t~ret0 := g(~x - 1); {12059#(<= 0 (+ |g_#in~x| 10))} is VALID [2022-02-21 03:03:25,642 INFO L290 TraceCheckUtils]: 54: Hoare triple {12059#(<= 0 (+ |g_#in~x| 10))} ~x := #in~x; {12060#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:25,642 INFO L290 TraceCheckUtils]: 55: Hoare triple {12060#(<= 0 (+ g_~x 10))} assume !(0 == ~x); {12060#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:25,643 INFO L290 TraceCheckUtils]: 56: Hoare triple {12060#(<= 0 (+ g_~x 10))} assume ~x - 1 <= 2147483647; {12060#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:25,643 INFO L290 TraceCheckUtils]: 57: Hoare triple {12060#(<= 0 (+ g_~x 10))} assume ~x - 1 >= -2147483648; {12060#(<= 0 (+ g_~x 10))} is VALID [2022-02-21 03:03:25,643 INFO L272 TraceCheckUtils]: 58: Hoare triple {12060#(<= 0 (+ g_~x 10))} call #t~ret0 := g(~x - 1); {12061#(<= 0 (+ |g_#in~x| 11))} is VALID [2022-02-21 03:03:25,644 INFO L290 TraceCheckUtils]: 59: Hoare triple {12061#(<= 0 (+ |g_#in~x| 11))} ~x := #in~x; {12062#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:25,644 INFO L290 TraceCheckUtils]: 60: Hoare triple {12062#(<= 0 (+ g_~x 11))} assume !(0 == ~x); {12062#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:25,644 INFO L290 TraceCheckUtils]: 61: Hoare triple {12062#(<= 0 (+ g_~x 11))} assume ~x - 1 <= 2147483647; {12062#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:25,645 INFO L290 TraceCheckUtils]: 62: Hoare triple {12062#(<= 0 (+ g_~x 11))} assume ~x - 1 >= -2147483648; {12062#(<= 0 (+ g_~x 11))} is VALID [2022-02-21 03:03:25,645 INFO L272 TraceCheckUtils]: 63: Hoare triple {12062#(<= 0 (+ g_~x 11))} call #t~ret0 := g(~x - 1); {12063#(<= 0 (+ |g_#in~x| 12))} is VALID [2022-02-21 03:03:25,645 INFO L290 TraceCheckUtils]: 64: Hoare triple {12063#(<= 0 (+ |g_#in~x| 12))} ~x := #in~x; {12064#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:25,646 INFO L290 TraceCheckUtils]: 65: Hoare triple {12064#(<= 0 (+ g_~x 12))} assume !(0 == ~x); {12064#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:25,646 INFO L290 TraceCheckUtils]: 66: Hoare triple {12064#(<= 0 (+ g_~x 12))} assume ~x - 1 <= 2147483647; {12064#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:25,646 INFO L290 TraceCheckUtils]: 67: Hoare triple {12064#(<= 0 (+ g_~x 12))} assume ~x - 1 >= -2147483648; {12064#(<= 0 (+ g_~x 12))} is VALID [2022-02-21 03:03:25,647 INFO L272 TraceCheckUtils]: 68: Hoare triple {12064#(<= 0 (+ g_~x 12))} call #t~ret0 := g(~x - 1); {12065#(<= 0 (+ |g_#in~x| 13))} is VALID [2022-02-21 03:03:25,647 INFO L290 TraceCheckUtils]: 69: Hoare triple {12065#(<= 0 (+ |g_#in~x| 13))} ~x := #in~x; {12066#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:25,647 INFO L290 TraceCheckUtils]: 70: Hoare triple {12066#(<= 0 (+ g_~x 13))} assume !(0 == ~x); {12066#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:25,648 INFO L290 TraceCheckUtils]: 71: Hoare triple {12066#(<= 0 (+ g_~x 13))} assume ~x - 1 <= 2147483647; {12066#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:25,648 INFO L290 TraceCheckUtils]: 72: Hoare triple {12066#(<= 0 (+ g_~x 13))} assume ~x - 1 >= -2147483648; {12066#(<= 0 (+ g_~x 13))} is VALID [2022-02-21 03:03:25,649 INFO L272 TraceCheckUtils]: 73: Hoare triple {12066#(<= 0 (+ g_~x 13))} call #t~ret0 := g(~x - 1); {12067#(<= 0 (+ |g_#in~x| 14))} is VALID [2022-02-21 03:03:25,649 INFO L290 TraceCheckUtils]: 74: Hoare triple {12067#(<= 0 (+ |g_#in~x| 14))} ~x := #in~x; {12068#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:25,649 INFO L290 TraceCheckUtils]: 75: Hoare triple {12068#(<= 0 (+ 14 g_~x))} assume !(0 == ~x); {12068#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:25,650 INFO L290 TraceCheckUtils]: 76: Hoare triple {12068#(<= 0 (+ 14 g_~x))} assume ~x - 1 <= 2147483647; {12068#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:25,650 INFO L290 TraceCheckUtils]: 77: Hoare triple {12068#(<= 0 (+ 14 g_~x))} assume ~x - 1 >= -2147483648; {12068#(<= 0 (+ 14 g_~x))} is VALID [2022-02-21 03:03:25,650 INFO L272 TraceCheckUtils]: 78: Hoare triple {12068#(<= 0 (+ 14 g_~x))} call #t~ret0 := g(~x - 1); {12069#(<= 0 (+ |g_#in~x| 15))} is VALID [2022-02-21 03:03:25,651 INFO L290 TraceCheckUtils]: 79: Hoare triple {12069#(<= 0 (+ |g_#in~x| 15))} ~x := #in~x; {12070#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:25,651 INFO L290 TraceCheckUtils]: 80: Hoare triple {12070#(<= 0 (+ g_~x 15))} assume !(0 == ~x); {12070#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:25,651 INFO L290 TraceCheckUtils]: 81: Hoare triple {12070#(<= 0 (+ g_~x 15))} assume ~x - 1 <= 2147483647; {12070#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:25,652 INFO L290 TraceCheckUtils]: 82: Hoare triple {12070#(<= 0 (+ g_~x 15))} assume ~x - 1 >= -2147483648; {12070#(<= 0 (+ g_~x 15))} is VALID [2022-02-21 03:03:25,652 INFO L272 TraceCheckUtils]: 83: Hoare triple {12070#(<= 0 (+ g_~x 15))} call #t~ret0 := g(~x - 1); {12071#(<= 0 (+ |g_#in~x| 16))} is VALID [2022-02-21 03:03:25,652 INFO L290 TraceCheckUtils]: 84: Hoare triple {12071#(<= 0 (+ |g_#in~x| 16))} ~x := #in~x; {12072#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:25,653 INFO L290 TraceCheckUtils]: 85: Hoare triple {12072#(<= 0 (+ 16 g_~x))} assume !(0 == ~x); {12072#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:25,653 INFO L290 TraceCheckUtils]: 86: Hoare triple {12072#(<= 0 (+ 16 g_~x))} assume ~x - 1 <= 2147483647; {12072#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:25,653 INFO L290 TraceCheckUtils]: 87: Hoare triple {12072#(<= 0 (+ 16 g_~x))} assume ~x - 1 >= -2147483648; {12072#(<= 0 (+ 16 g_~x))} is VALID [2022-02-21 03:03:25,654 INFO L272 TraceCheckUtils]: 88: Hoare triple {12072#(<= 0 (+ 16 g_~x))} call #t~ret0 := g(~x - 1); {12073#(<= 0 (+ |g_#in~x| 17))} is VALID [2022-02-21 03:03:25,654 INFO L290 TraceCheckUtils]: 89: Hoare triple {12073#(<= 0 (+ |g_#in~x| 17))} ~x := #in~x; {12074#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:25,655 INFO L290 TraceCheckUtils]: 90: Hoare triple {12074#(<= 0 (+ g_~x 17))} assume !(0 == ~x); {12074#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:25,655 INFO L290 TraceCheckUtils]: 91: Hoare triple {12074#(<= 0 (+ g_~x 17))} assume ~x - 1 <= 2147483647; {12074#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:25,655 INFO L290 TraceCheckUtils]: 92: Hoare triple {12074#(<= 0 (+ g_~x 17))} assume ~x - 1 >= -2147483648; {12074#(<= 0 (+ g_~x 17))} is VALID [2022-02-21 03:03:25,656 INFO L272 TraceCheckUtils]: 93: Hoare triple {12074#(<= 0 (+ g_~x 17))} call #t~ret0 := g(~x - 1); {12075#(<= 0 (+ |g_#in~x| 18))} is VALID [2022-02-21 03:03:25,656 INFO L290 TraceCheckUtils]: 94: Hoare triple {12075#(<= 0 (+ |g_#in~x| 18))} ~x := #in~x; {12076#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:25,656 INFO L290 TraceCheckUtils]: 95: Hoare triple {12076#(<= 0 (+ g_~x 18))} assume !(0 == ~x); {12076#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:25,657 INFO L290 TraceCheckUtils]: 96: Hoare triple {12076#(<= 0 (+ g_~x 18))} assume ~x - 1 <= 2147483647; {12076#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:25,657 INFO L290 TraceCheckUtils]: 97: Hoare triple {12076#(<= 0 (+ g_~x 18))} assume ~x - 1 >= -2147483648; {12076#(<= 0 (+ g_~x 18))} is VALID [2022-02-21 03:03:25,657 INFO L272 TraceCheckUtils]: 98: Hoare triple {12076#(<= 0 (+ g_~x 18))} call #t~ret0 := g(~x - 1); {12077#(<= 0 (+ 19 |g_#in~x|))} is VALID [2022-02-21 03:03:25,658 INFO L290 TraceCheckUtils]: 99: Hoare triple {12077#(<= 0 (+ 19 |g_#in~x|))} ~x := #in~x; {12078#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:25,658 INFO L290 TraceCheckUtils]: 100: Hoare triple {12078#(<= 0 (+ 19 g_~x))} assume !(0 == ~x); {12078#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:25,658 INFO L290 TraceCheckUtils]: 101: Hoare triple {12078#(<= 0 (+ 19 g_~x))} assume ~x - 1 <= 2147483647; {12078#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:25,659 INFO L290 TraceCheckUtils]: 102: Hoare triple {12078#(<= 0 (+ 19 g_~x))} assume ~x - 1 >= -2147483648; {12078#(<= 0 (+ 19 g_~x))} is VALID [2022-02-21 03:03:25,659 INFO L272 TraceCheckUtils]: 103: Hoare triple {12078#(<= 0 (+ 19 g_~x))} call #t~ret0 := g(~x - 1); {12079#(<= 0 (+ |g_#in~x| 20))} is VALID [2022-02-21 03:03:25,659 INFO L290 TraceCheckUtils]: 104: Hoare triple {12079#(<= 0 (+ |g_#in~x| 20))} ~x := #in~x; {12080#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:25,660 INFO L290 TraceCheckUtils]: 105: Hoare triple {12080#(<= 0 (+ g_~x 20))} assume !(0 == ~x); {12080#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:25,660 INFO L290 TraceCheckUtils]: 106: Hoare triple {12080#(<= 0 (+ g_~x 20))} assume ~x - 1 <= 2147483647; {12080#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:25,660 INFO L290 TraceCheckUtils]: 107: Hoare triple {12080#(<= 0 (+ g_~x 20))} assume ~x - 1 >= -2147483648; {12080#(<= 0 (+ g_~x 20))} is VALID [2022-02-21 03:03:25,661 INFO L272 TraceCheckUtils]: 108: Hoare triple {12080#(<= 0 (+ g_~x 20))} call #t~ret0 := g(~x - 1); {12081#(<= 0 (+ |g_#in~x| 21))} is VALID [2022-02-21 03:03:25,661 INFO L290 TraceCheckUtils]: 109: Hoare triple {12081#(<= 0 (+ |g_#in~x| 21))} ~x := #in~x; {12082#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:25,661 INFO L290 TraceCheckUtils]: 110: Hoare triple {12082#(<= 0 (+ 21 g_~x))} assume !(0 == ~x); {12082#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:25,662 INFO L290 TraceCheckUtils]: 111: Hoare triple {12082#(<= 0 (+ 21 g_~x))} assume ~x - 1 <= 2147483647; {12082#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:25,662 INFO L290 TraceCheckUtils]: 112: Hoare triple {12082#(<= 0 (+ 21 g_~x))} assume ~x - 1 >= -2147483648; {12082#(<= 0 (+ 21 g_~x))} is VALID [2022-02-21 03:03:25,663 INFO L272 TraceCheckUtils]: 113: Hoare triple {12082#(<= 0 (+ 21 g_~x))} call #t~ret0 := g(~x - 1); {12083#(<= 0 (+ |g_#in~x| 22))} is VALID [2022-02-21 03:03:25,663 INFO L290 TraceCheckUtils]: 114: Hoare triple {12083#(<= 0 (+ |g_#in~x| 22))} ~x := #in~x; {12084#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:25,663 INFO L290 TraceCheckUtils]: 115: Hoare triple {12084#(<= 0 (+ 22 g_~x))} assume !(0 == ~x); {12084#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:25,664 INFO L290 TraceCheckUtils]: 116: Hoare triple {12084#(<= 0 (+ 22 g_~x))} assume ~x - 1 <= 2147483647; {12084#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:25,664 INFO L290 TraceCheckUtils]: 117: Hoare triple {12084#(<= 0 (+ 22 g_~x))} assume ~x - 1 >= -2147483648; {12084#(<= 0 (+ 22 g_~x))} is VALID [2022-02-21 03:03:25,664 INFO L272 TraceCheckUtils]: 118: Hoare triple {12084#(<= 0 (+ 22 g_~x))} call #t~ret0 := g(~x - 1); {12085#(<= 0 (+ 23 |g_#in~x|))} is VALID [2022-02-21 03:03:25,665 INFO L290 TraceCheckUtils]: 119: Hoare triple {12085#(<= 0 (+ 23 |g_#in~x|))} ~x := #in~x; {12086#(<= 0 (+ 23 g_~x))} is VALID [2022-02-21 03:03:25,665 INFO L290 TraceCheckUtils]: 120: Hoare triple {12086#(<= 0 (+ 23 g_~x))} assume !(0 == ~x); {12086#(<= 0 (+ 23 g_~x))} is VALID [2022-02-21 03:03:25,665 INFO L290 TraceCheckUtils]: 121: Hoare triple {12086#(<= 0 (+ 23 g_~x))} assume ~x - 1 <= 2147483647; {12086#(<= 0 (+ 23 g_~x))} is VALID [2022-02-21 03:03:25,666 INFO L290 TraceCheckUtils]: 122: Hoare triple {12086#(<= 0 (+ 23 g_~x))} assume ~x - 1 >= -2147483648; {12086#(<= 0 (+ 23 g_~x))} is VALID [2022-02-21 03:03:25,666 INFO L272 TraceCheckUtils]: 123: Hoare triple {12086#(<= 0 (+ 23 g_~x))} call #t~ret0 := g(~x - 1); {12087#(<= 0 (+ |g_#in~x| 24))} is VALID [2022-02-21 03:03:25,666 INFO L290 TraceCheckUtils]: 124: Hoare triple {12087#(<= 0 (+ |g_#in~x| 24))} ~x := #in~x; {12088#(<= 0 (+ g_~x 24))} is VALID [2022-02-21 03:03:25,667 INFO L290 TraceCheckUtils]: 125: Hoare triple {12088#(<= 0 (+ g_~x 24))} assume !(0 == ~x); {12088#(<= 0 (+ g_~x 24))} is VALID [2022-02-21 03:03:25,667 INFO L290 TraceCheckUtils]: 126: Hoare triple {12088#(<= 0 (+ g_~x 24))} assume ~x - 1 <= 2147483647; {12088#(<= 0 (+ g_~x 24))} is VALID [2022-02-21 03:03:25,667 INFO L290 TraceCheckUtils]: 127: Hoare triple {12088#(<= 0 (+ g_~x 24))} assume ~x - 1 >= -2147483648; {12088#(<= 0 (+ g_~x 24))} is VALID [2022-02-21 03:03:25,668 INFO L272 TraceCheckUtils]: 128: Hoare triple {12088#(<= 0 (+ g_~x 24))} call #t~ret0 := g(~x - 1); {12089#(<= 0 (+ |g_#in~x| 25))} is VALID [2022-02-21 03:03:25,668 INFO L290 TraceCheckUtils]: 129: Hoare triple {12089#(<= 0 (+ |g_#in~x| 25))} ~x := #in~x; {12090#(<= 0 (+ g_~x 25))} is VALID [2022-02-21 03:03:25,668 INFO L290 TraceCheckUtils]: 130: Hoare triple {12090#(<= 0 (+ g_~x 25))} assume !(0 == ~x); {12090#(<= 0 (+ g_~x 25))} is VALID [2022-02-21 03:03:25,669 INFO L290 TraceCheckUtils]: 131: Hoare triple {12090#(<= 0 (+ g_~x 25))} assume ~x - 1 <= 2147483647; {12090#(<= 0 (+ g_~x 25))} is VALID [2022-02-21 03:03:25,669 INFO L290 TraceCheckUtils]: 132: Hoare triple {12090#(<= 0 (+ g_~x 25))} assume ~x - 1 >= -2147483648; {12090#(<= 0 (+ g_~x 25))} is VALID [2022-02-21 03:03:25,670 INFO L272 TraceCheckUtils]: 133: Hoare triple {12090#(<= 0 (+ g_~x 25))} call #t~ret0 := g(~x - 1); {12091#(<= 0 (+ |g_#in~x| 26))} is VALID [2022-02-21 03:03:25,670 INFO L290 TraceCheckUtils]: 134: Hoare triple {12091#(<= 0 (+ |g_#in~x| 26))} ~x := #in~x; {12092#(<= 0 (+ g_~x 26))} is VALID [2022-02-21 03:03:25,670 INFO L290 TraceCheckUtils]: 135: Hoare triple {12092#(<= 0 (+ g_~x 26))} assume !(0 == ~x); {12092#(<= 0 (+ g_~x 26))} is VALID [2022-02-21 03:03:25,671 INFO L290 TraceCheckUtils]: 136: Hoare triple {12092#(<= 0 (+ g_~x 26))} assume ~x - 1 <= 2147483647; {12092#(<= 0 (+ g_~x 26))} is VALID [2022-02-21 03:03:25,671 INFO L290 TraceCheckUtils]: 137: Hoare triple {12092#(<= 0 (+ g_~x 26))} assume ~x - 1 >= -2147483648; {12092#(<= 0 (+ g_~x 26))} is VALID [2022-02-21 03:03:25,671 INFO L272 TraceCheckUtils]: 138: Hoare triple {12092#(<= 0 (+ g_~x 26))} call #t~ret0 := g(~x - 1); {12093#(<= 0 (+ |g_#in~x| 27))} is VALID [2022-02-21 03:03:25,672 INFO L290 TraceCheckUtils]: 139: Hoare triple {12093#(<= 0 (+ |g_#in~x| 27))} ~x := #in~x; {12094#(<= 0 (+ g_~x 27))} is VALID [2022-02-21 03:03:25,672 INFO L290 TraceCheckUtils]: 140: Hoare triple {12094#(<= 0 (+ g_~x 27))} assume !(0 == ~x); {12094#(<= 0 (+ g_~x 27))} is VALID [2022-02-21 03:03:25,672 INFO L290 TraceCheckUtils]: 141: Hoare triple {12094#(<= 0 (+ g_~x 27))} assume ~x - 1 <= 2147483647; {12094#(<= 0 (+ g_~x 27))} is VALID [2022-02-21 03:03:25,673 INFO L290 TraceCheckUtils]: 142: Hoare triple {12094#(<= 0 (+ g_~x 27))} assume ~x - 1 >= -2147483648; {12094#(<= 0 (+ g_~x 27))} is VALID [2022-02-21 03:03:25,673 INFO L272 TraceCheckUtils]: 143: Hoare triple {12094#(<= 0 (+ g_~x 27))} call #t~ret0 := g(~x - 1); {12095#(<= 0 (+ |g_#in~x| 28))} is VALID [2022-02-21 03:03:25,674 INFO L290 TraceCheckUtils]: 144: Hoare triple {12095#(<= 0 (+ |g_#in~x| 28))} ~x := #in~x; {12096#(<= 0 (+ g_~x 28))} is VALID [2022-02-21 03:03:25,674 INFO L290 TraceCheckUtils]: 145: Hoare triple {12096#(<= 0 (+ g_~x 28))} assume !(0 == ~x); {12096#(<= 0 (+ g_~x 28))} is VALID [2022-02-21 03:03:25,674 INFO L290 TraceCheckUtils]: 146: Hoare triple {12096#(<= 0 (+ g_~x 28))} assume ~x - 1 <= 2147483647; {12096#(<= 0 (+ g_~x 28))} is VALID [2022-02-21 03:03:25,674 INFO L290 TraceCheckUtils]: 147: Hoare triple {12096#(<= 0 (+ g_~x 28))} assume ~x - 1 >= -2147483648; {12096#(<= 0 (+ g_~x 28))} is VALID [2022-02-21 03:03:25,675 INFO L272 TraceCheckUtils]: 148: Hoare triple {12096#(<= 0 (+ g_~x 28))} call #t~ret0 := g(~x - 1); {12097#(<= 0 (+ 29 |g_#in~x|))} is VALID [2022-02-21 03:03:25,675 INFO L290 TraceCheckUtils]: 149: Hoare triple {12097#(<= 0 (+ 29 |g_#in~x|))} ~x := #in~x; {12098#(<= 0 (+ 29 g_~x))} is VALID [2022-02-21 03:03:25,676 INFO L290 TraceCheckUtils]: 150: Hoare triple {12098#(<= 0 (+ 29 g_~x))} assume !(0 == ~x); {12098#(<= 0 (+ 29 g_~x))} is VALID [2022-02-21 03:03:25,676 INFO L290 TraceCheckUtils]: 151: Hoare triple {12098#(<= 0 (+ 29 g_~x))} assume ~x - 1 <= 2147483647; {12098#(<= 0 (+ 29 g_~x))} is VALID [2022-02-21 03:03:25,676 INFO L290 TraceCheckUtils]: 152: Hoare triple {12098#(<= 0 (+ 29 g_~x))} assume ~x - 1 >= -2147483648; {12098#(<= 0 (+ 29 g_~x))} is VALID [2022-02-21 03:03:25,677 INFO L272 TraceCheckUtils]: 153: Hoare triple {12098#(<= 0 (+ 29 g_~x))} call #t~ret0 := g(~x - 1); {12099#(<= 0 (+ 30 |g_#in~x|))} is VALID [2022-02-21 03:03:25,677 INFO L290 TraceCheckUtils]: 154: Hoare triple {12099#(<= 0 (+ 30 |g_#in~x|))} ~x := #in~x; {12100#(<= 0 (+ 30 g_~x))} is VALID [2022-02-21 03:03:25,677 INFO L290 TraceCheckUtils]: 155: Hoare triple {12100#(<= 0 (+ 30 g_~x))} assume !(0 == ~x); {12100#(<= 0 (+ 30 g_~x))} is VALID [2022-02-21 03:03:25,678 INFO L290 TraceCheckUtils]: 156: Hoare triple {12100#(<= 0 (+ 30 g_~x))} assume ~x - 1 <= 2147483647; {12100#(<= 0 (+ 30 g_~x))} is VALID [2022-02-21 03:03:25,678 INFO L290 TraceCheckUtils]: 157: Hoare triple {12100#(<= 0 (+ 30 g_~x))} assume ~x - 1 >= -2147483648; {12100#(<= 0 (+ 30 g_~x))} is VALID [2022-02-21 03:03:25,678 INFO L272 TraceCheckUtils]: 158: Hoare triple {12100#(<= 0 (+ 30 g_~x))} call #t~ret0 := g(~x - 1); {12101#(<= 0 (+ |g_#in~x| 31))} is VALID [2022-02-21 03:03:25,679 INFO L290 TraceCheckUtils]: 159: Hoare triple {12101#(<= 0 (+ |g_#in~x| 31))} ~x := #in~x; {12102#(<= 0 (+ g_~x 31))} is VALID [2022-02-21 03:03:25,679 INFO L290 TraceCheckUtils]: 160: Hoare triple {12102#(<= 0 (+ g_~x 31))} assume !(0 == ~x); {12102#(<= 0 (+ g_~x 31))} is VALID [2022-02-21 03:03:25,679 INFO L290 TraceCheckUtils]: 161: Hoare triple {12102#(<= 0 (+ g_~x 31))} assume ~x - 1 <= 2147483647; {12102#(<= 0 (+ g_~x 31))} is VALID [2022-02-21 03:03:25,680 INFO L290 TraceCheckUtils]: 162: Hoare triple {12102#(<= 0 (+ g_~x 31))} assume ~x - 1 >= -2147483648; {12102#(<= 0 (+ g_~x 31))} is VALID [2022-02-21 03:03:25,680 INFO L272 TraceCheckUtils]: 163: Hoare triple {12102#(<= 0 (+ g_~x 31))} call #t~ret0 := g(~x - 1); {12103#(<= 0 (+ 32 |g_#in~x|))} is VALID [2022-02-21 03:03:25,681 INFO L290 TraceCheckUtils]: 164: Hoare triple {12103#(<= 0 (+ 32 |g_#in~x|))} ~x := #in~x; {12104#(<= 0 (+ 32 g_~x))} is VALID [2022-02-21 03:03:25,681 INFO L290 TraceCheckUtils]: 165: Hoare triple {12104#(<= 0 (+ 32 g_~x))} assume !(0 == ~x); {12104#(<= 0 (+ 32 g_~x))} is VALID [2022-02-21 03:03:25,681 INFO L290 TraceCheckUtils]: 166: Hoare triple {12104#(<= 0 (+ 32 g_~x))} assume ~x - 1 <= 2147483647; {12104#(<= 0 (+ 32 g_~x))} is VALID [2022-02-21 03:03:25,682 INFO L290 TraceCheckUtils]: 167: Hoare triple {12104#(<= 0 (+ 32 g_~x))} assume ~x - 1 >= -2147483648; {12104#(<= 0 (+ 32 g_~x))} is VALID [2022-02-21 03:03:25,682 INFO L272 TraceCheckUtils]: 168: Hoare triple {12104#(<= 0 (+ 32 g_~x))} call #t~ret0 := g(~x - 1); {12105#(<= 0 (+ |g_#in~x| 33))} is VALID [2022-02-21 03:03:25,682 INFO L290 TraceCheckUtils]: 169: Hoare triple {12105#(<= 0 (+ |g_#in~x| 33))} ~x := #in~x; {12106#(<= 0 (+ g_~x 33))} is VALID [2022-02-21 03:03:25,683 INFO L290 TraceCheckUtils]: 170: Hoare triple {12106#(<= 0 (+ g_~x 33))} assume !(0 == ~x); {12106#(<= 0 (+ g_~x 33))} is VALID [2022-02-21 03:03:25,683 INFO L290 TraceCheckUtils]: 171: Hoare triple {12106#(<= 0 (+ g_~x 33))} assume ~x - 1 <= 2147483647; {12106#(<= 0 (+ g_~x 33))} is VALID [2022-02-21 03:03:25,683 INFO L290 TraceCheckUtils]: 172: Hoare triple {12106#(<= 0 (+ g_~x 33))} assume ~x - 1 >= -2147483648; {12106#(<= 0 (+ g_~x 33))} is VALID [2022-02-21 03:03:25,684 INFO L272 TraceCheckUtils]: 173: Hoare triple {12106#(<= 0 (+ g_~x 33))} call #t~ret0 := g(~x - 1); {12107#(<= 0 (+ |g_#in~x| 34))} is VALID [2022-02-21 03:03:25,684 INFO L290 TraceCheckUtils]: 174: Hoare triple {12107#(<= 0 (+ |g_#in~x| 34))} ~x := #in~x; {12108#(<= 0 (+ g_~x 34))} is VALID [2022-02-21 03:03:25,684 INFO L290 TraceCheckUtils]: 175: Hoare triple {12108#(<= 0 (+ g_~x 34))} assume !(0 == ~x); {12108#(<= 0 (+ g_~x 34))} is VALID [2022-02-21 03:03:25,685 INFO L290 TraceCheckUtils]: 176: Hoare triple {12108#(<= 0 (+ g_~x 34))} assume ~x - 1 <= 2147483647; {12108#(<= 0 (+ g_~x 34))} is VALID [2022-02-21 03:03:25,685 INFO L290 TraceCheckUtils]: 177: Hoare triple {12108#(<= 0 (+ g_~x 34))} assume ~x - 1 >= -2147483648; {12108#(<= 0 (+ g_~x 34))} is VALID [2022-02-21 03:03:25,685 INFO L272 TraceCheckUtils]: 178: Hoare triple {12108#(<= 0 (+ g_~x 34))} call #t~ret0 := g(~x - 1); {12109#(<= 0 (+ 35 |g_#in~x|))} is VALID [2022-02-21 03:03:25,686 INFO L290 TraceCheckUtils]: 179: Hoare triple {12109#(<= 0 (+ 35 |g_#in~x|))} ~x := #in~x; {12110#(<= 0 (+ 35 g_~x))} is VALID [2022-02-21 03:03:25,686 INFO L290 TraceCheckUtils]: 180: Hoare triple {12110#(<= 0 (+ 35 g_~x))} assume !(0 == ~x); {12110#(<= 0 (+ 35 g_~x))} is VALID [2022-02-21 03:03:25,686 INFO L290 TraceCheckUtils]: 181: Hoare triple {12110#(<= 0 (+ 35 g_~x))} assume ~x - 1 <= 2147483647; {12110#(<= 0 (+ 35 g_~x))} is VALID [2022-02-21 03:03:25,687 INFO L290 TraceCheckUtils]: 182: Hoare triple {12110#(<= 0 (+ 35 g_~x))} assume ~x - 1 >= -2147483648; {12110#(<= 0 (+ 35 g_~x))} is VALID [2022-02-21 03:03:25,687 INFO L272 TraceCheckUtils]: 183: Hoare triple {12110#(<= 0 (+ 35 g_~x))} call #t~ret0 := g(~x - 1); {12111#(<= 0 (+ |g_#in~x| 36))} is VALID [2022-02-21 03:03:25,688 INFO L290 TraceCheckUtils]: 184: Hoare triple {12111#(<= 0 (+ |g_#in~x| 36))} ~x := #in~x; {12112#(<= 0 (+ g_~x 36))} is VALID [2022-02-21 03:03:25,688 INFO L290 TraceCheckUtils]: 185: Hoare triple {12112#(<= 0 (+ g_~x 36))} assume !(0 == ~x); {12112#(<= 0 (+ g_~x 36))} is VALID [2022-02-21 03:03:25,688 INFO L290 TraceCheckUtils]: 186: Hoare triple {12112#(<= 0 (+ g_~x 36))} assume ~x - 1 <= 2147483647; {12112#(<= 0 (+ g_~x 36))} is VALID [2022-02-21 03:03:25,688 INFO L290 TraceCheckUtils]: 187: Hoare triple {12112#(<= 0 (+ g_~x 36))} assume ~x - 1 >= -2147483648; {12112#(<= 0 (+ g_~x 36))} is VALID [2022-02-21 03:03:25,689 INFO L272 TraceCheckUtils]: 188: Hoare triple {12112#(<= 0 (+ g_~x 36))} call #t~ret0 := g(~x - 1); {12113#(<= 0 (+ |g_#in~x| 37))} is VALID [2022-02-21 03:03:25,689 INFO L290 TraceCheckUtils]: 189: Hoare triple {12113#(<= 0 (+ |g_#in~x| 37))} ~x := #in~x; {12114#(<= 0 (+ g_~x 37))} is VALID [2022-02-21 03:03:25,690 INFO L290 TraceCheckUtils]: 190: Hoare triple {12114#(<= 0 (+ g_~x 37))} assume !(0 == ~x); {12114#(<= 0 (+ g_~x 37))} is VALID [2022-02-21 03:03:25,690 INFO L290 TraceCheckUtils]: 191: Hoare triple {12114#(<= 0 (+ g_~x 37))} assume ~x - 1 <= 2147483647; {12114#(<= 0 (+ g_~x 37))} is VALID [2022-02-21 03:03:25,690 INFO L290 TraceCheckUtils]: 192: Hoare triple {12114#(<= 0 (+ g_~x 37))} assume ~x - 1 >= -2147483648; {12114#(<= 0 (+ g_~x 37))} is VALID [2022-02-21 03:03:25,691 INFO L272 TraceCheckUtils]: 193: Hoare triple {12114#(<= 0 (+ g_~x 37))} call #t~ret0 := g(~x - 1); {12115#(<= 0 (+ |g_#in~x| 38))} is VALID [2022-02-21 03:03:25,691 INFO L290 TraceCheckUtils]: 194: Hoare triple {12115#(<= 0 (+ |g_#in~x| 38))} ~x := #in~x; {12116#(<= 0 (+ g_~x 38))} is VALID [2022-02-21 03:03:25,691 INFO L290 TraceCheckUtils]: 195: Hoare triple {12116#(<= 0 (+ g_~x 38))} assume !(0 == ~x); {12116#(<= 0 (+ g_~x 38))} is VALID [2022-02-21 03:03:25,692 INFO L290 TraceCheckUtils]: 196: Hoare triple {12116#(<= 0 (+ g_~x 38))} assume ~x - 1 <= 2147483647; {12116#(<= 0 (+ g_~x 38))} is VALID [2022-02-21 03:03:25,692 INFO L290 TraceCheckUtils]: 197: Hoare triple {12116#(<= 0 (+ g_~x 38))} assume ~x - 1 >= -2147483648; {12116#(<= 0 (+ g_~x 38))} is VALID [2022-02-21 03:03:25,692 INFO L272 TraceCheckUtils]: 198: Hoare triple {12116#(<= 0 (+ g_~x 38))} call #t~ret0 := g(~x - 1); {12117#(<= 0 (+ |g_#in~x| 39))} is VALID [2022-02-21 03:03:25,693 INFO L290 TraceCheckUtils]: 199: Hoare triple {12117#(<= 0 (+ |g_#in~x| 39))} ~x := #in~x; {12118#(<= 0 (+ g_~x 39))} is VALID [2022-02-21 03:03:25,693 INFO L290 TraceCheckUtils]: 200: Hoare triple {12118#(<= 0 (+ g_~x 39))} assume !(0 == ~x); {12118#(<= 0 (+ g_~x 39))} is VALID [2022-02-21 03:03:25,693 INFO L290 TraceCheckUtils]: 201: Hoare triple {12118#(<= 0 (+ g_~x 39))} assume ~x - 1 <= 2147483647; {12118#(<= 0 (+ g_~x 39))} is VALID [2022-02-21 03:03:25,694 INFO L290 TraceCheckUtils]: 202: Hoare triple {12118#(<= 0 (+ g_~x 39))} assume ~x - 1 >= -2147483648; {12118#(<= 0 (+ g_~x 39))} is VALID [2022-02-21 03:03:25,694 INFO L272 TraceCheckUtils]: 203: Hoare triple {12118#(<= 0 (+ g_~x 39))} call #t~ret0 := g(~x - 1); {12119#(<= 0 (+ 40 |g_#in~x|))} is VALID [2022-02-21 03:03:25,694 INFO L290 TraceCheckUtils]: 204: Hoare triple {12119#(<= 0 (+ 40 |g_#in~x|))} ~x := #in~x; {12120#(<= 0 (+ 40 g_~x))} is VALID [2022-02-21 03:03:25,695 INFO L290 TraceCheckUtils]: 205: Hoare triple {12120#(<= 0 (+ 40 g_~x))} assume !(0 == ~x); {12120#(<= 0 (+ 40 g_~x))} is VALID [2022-02-21 03:03:25,695 INFO L290 TraceCheckUtils]: 206: Hoare triple {12120#(<= 0 (+ 40 g_~x))} assume ~x - 1 <= 2147483647; {12120#(<= 0 (+ 40 g_~x))} is VALID [2022-02-21 03:03:25,695 INFO L290 TraceCheckUtils]: 207: Hoare triple {12120#(<= 0 (+ 40 g_~x))} assume ~x - 1 >= -2147483648; {12120#(<= 0 (+ 40 g_~x))} is VALID [2022-02-21 03:03:25,696 INFO L272 TraceCheckUtils]: 208: Hoare triple {12120#(<= 0 (+ 40 g_~x))} call #t~ret0 := g(~x - 1); {12121#(<= 0 (+ 41 |g_#in~x|))} is VALID [2022-02-21 03:03:25,696 INFO L290 TraceCheckUtils]: 209: Hoare triple {12121#(<= 0 (+ 41 |g_#in~x|))} ~x := #in~x; {12122#(<= 0 (+ 41 g_~x))} is VALID [2022-02-21 03:03:25,697 INFO L290 TraceCheckUtils]: 210: Hoare triple {12122#(<= 0 (+ 41 g_~x))} assume !(0 == ~x); {12122#(<= 0 (+ 41 g_~x))} is VALID [2022-02-21 03:03:25,697 INFO L290 TraceCheckUtils]: 211: Hoare triple {12122#(<= 0 (+ 41 g_~x))} assume ~x - 1 <= 2147483647; {12122#(<= 0 (+ 41 g_~x))} is VALID [2022-02-21 03:03:25,697 INFO L290 TraceCheckUtils]: 212: Hoare triple {12122#(<= 0 (+ 41 g_~x))} assume ~x - 1 >= -2147483648; {12122#(<= 0 (+ 41 g_~x))} is VALID [2022-02-21 03:03:25,698 INFO L272 TraceCheckUtils]: 213: Hoare triple {12122#(<= 0 (+ 41 g_~x))} call #t~ret0 := g(~x - 1); {12123#(<= 0 (+ 42 |g_#in~x|))} is VALID [2022-02-21 03:03:25,698 INFO L290 TraceCheckUtils]: 214: Hoare triple {12123#(<= 0 (+ 42 |g_#in~x|))} ~x := #in~x; {12124#(<= 0 (+ 42 g_~x))} is VALID [2022-02-21 03:03:25,698 INFO L290 TraceCheckUtils]: 215: Hoare triple {12124#(<= 0 (+ 42 g_~x))} assume !(0 == ~x); {12124#(<= 0 (+ 42 g_~x))} is VALID [2022-02-21 03:03:25,699 INFO L290 TraceCheckUtils]: 216: Hoare triple {12124#(<= 0 (+ 42 g_~x))} assume ~x - 1 <= 2147483647; {12124#(<= 0 (+ 42 g_~x))} is VALID [2022-02-21 03:03:25,699 INFO L290 TraceCheckUtils]: 217: Hoare triple {12124#(<= 0 (+ 42 g_~x))} assume ~x - 1 >= -2147483648; {12124#(<= 0 (+ 42 g_~x))} is VALID [2022-02-21 03:03:25,700 INFO L272 TraceCheckUtils]: 218: Hoare triple {12124#(<= 0 (+ 42 g_~x))} call #t~ret0 := g(~x - 1); {12125#(<= 0 (+ |g_#in~x| 43))} is VALID [2022-02-21 03:03:25,700 INFO L290 TraceCheckUtils]: 219: Hoare triple {12125#(<= 0 (+ |g_#in~x| 43))} ~x := #in~x; {12126#(<= 0 (+ g_~x 43))} is VALID [2022-02-21 03:03:25,700 INFO L290 TraceCheckUtils]: 220: Hoare triple {12126#(<= 0 (+ g_~x 43))} assume !(0 == ~x); {12126#(<= 0 (+ g_~x 43))} is VALID [2022-02-21 03:03:25,700 INFO L290 TraceCheckUtils]: 221: Hoare triple {12126#(<= 0 (+ g_~x 43))} assume ~x - 1 <= 2147483647; {12126#(<= 0 (+ g_~x 43))} is VALID [2022-02-21 03:03:25,701 INFO L290 TraceCheckUtils]: 222: Hoare triple {12126#(<= 0 (+ g_~x 43))} assume ~x - 1 >= -2147483648; {12126#(<= 0 (+ g_~x 43))} is VALID [2022-02-21 03:03:25,701 INFO L272 TraceCheckUtils]: 223: Hoare triple {12126#(<= 0 (+ g_~x 43))} call #t~ret0 := g(~x - 1); {12127#(<= 0 (+ 44 |g_#in~x|))} is VALID [2022-02-21 03:03:25,702 INFO L290 TraceCheckUtils]: 224: Hoare triple {12127#(<= 0 (+ 44 |g_#in~x|))} ~x := #in~x; {12128#(<= 0 (+ 44 g_~x))} is VALID [2022-02-21 03:03:25,702 INFO L290 TraceCheckUtils]: 225: Hoare triple {12128#(<= 0 (+ 44 g_~x))} assume !(0 == ~x); {12128#(<= 0 (+ 44 g_~x))} is VALID [2022-02-21 03:03:25,702 INFO L290 TraceCheckUtils]: 226: Hoare triple {12128#(<= 0 (+ 44 g_~x))} assume ~x - 1 <= 2147483647; {12128#(<= 0 (+ 44 g_~x))} is VALID [2022-02-21 03:03:25,703 INFO L290 TraceCheckUtils]: 227: Hoare triple {12128#(<= 0 (+ 44 g_~x))} assume ~x - 1 >= -2147483648; {12128#(<= 0 (+ 44 g_~x))} is VALID [2022-02-21 03:03:25,703 INFO L272 TraceCheckUtils]: 228: Hoare triple {12128#(<= 0 (+ 44 g_~x))} call #t~ret0 := g(~x - 1); {12129#(<= 0 (+ |g_#in~x| 45))} is VALID [2022-02-21 03:03:25,703 INFO L290 TraceCheckUtils]: 229: Hoare triple {12129#(<= 0 (+ |g_#in~x| 45))} ~x := #in~x; {12130#(<= 0 (+ g_~x 45))} is VALID [2022-02-21 03:03:25,704 INFO L290 TraceCheckUtils]: 230: Hoare triple {12130#(<= 0 (+ g_~x 45))} assume !(0 == ~x); {12130#(<= 0 (+ g_~x 45))} is VALID [2022-02-21 03:03:25,704 INFO L290 TraceCheckUtils]: 231: Hoare triple {12130#(<= 0 (+ g_~x 45))} assume ~x - 1 <= 2147483647; {12130#(<= 0 (+ g_~x 45))} is VALID [2022-02-21 03:03:25,704 INFO L290 TraceCheckUtils]: 232: Hoare triple {12130#(<= 0 (+ g_~x 45))} assume ~x - 1 >= -2147483648; {12130#(<= 0 (+ g_~x 45))} is VALID [2022-02-21 03:03:25,705 INFO L272 TraceCheckUtils]: 233: Hoare triple {12130#(<= 0 (+ g_~x 45))} call #t~ret0 := g(~x - 1); {12131#(<= 0 (+ |g_#in~x| 46))} is VALID [2022-02-21 03:03:25,705 INFO L290 TraceCheckUtils]: 234: Hoare triple {12131#(<= 0 (+ |g_#in~x| 46))} ~x := #in~x; {12132#(<= 0 (+ g_~x 46))} is VALID [2022-02-21 03:03:25,705 INFO L290 TraceCheckUtils]: 235: Hoare triple {12132#(<= 0 (+ g_~x 46))} assume !(0 == ~x); {12132#(<= 0 (+ g_~x 46))} is VALID [2022-02-21 03:03:25,706 INFO L290 TraceCheckUtils]: 236: Hoare triple {12132#(<= 0 (+ g_~x 46))} assume ~x - 1 <= 2147483647; {12132#(<= 0 (+ g_~x 46))} is VALID [2022-02-21 03:03:25,706 INFO L290 TraceCheckUtils]: 237: Hoare triple {12132#(<= 0 (+ g_~x 46))} assume ~x - 1 >= -2147483648; {12132#(<= 0 (+ g_~x 46))} is VALID [2022-02-21 03:03:25,706 INFO L272 TraceCheckUtils]: 238: Hoare triple {12132#(<= 0 (+ g_~x 46))} call #t~ret0 := g(~x - 1); {12133#(<= 0 (+ |g_#in~x| 47))} is VALID [2022-02-21 03:03:25,707 INFO L290 TraceCheckUtils]: 239: Hoare triple {12133#(<= 0 (+ |g_#in~x| 47))} ~x := #in~x; {12134#(<= 0 (+ 47 g_~x))} is VALID [2022-02-21 03:03:25,707 INFO L290 TraceCheckUtils]: 240: Hoare triple {12134#(<= 0 (+ 47 g_~x))} assume !(0 == ~x); {12134#(<= 0 (+ 47 g_~x))} is VALID [2022-02-21 03:03:25,707 INFO L290 TraceCheckUtils]: 241: Hoare triple {12134#(<= 0 (+ 47 g_~x))} assume ~x - 1 <= 2147483647; {12134#(<= 0 (+ 47 g_~x))} is VALID [2022-02-21 03:03:25,708 INFO L290 TraceCheckUtils]: 242: Hoare triple {12134#(<= 0 (+ 47 g_~x))} assume ~x - 1 >= -2147483648; {12134#(<= 0 (+ 47 g_~x))} is VALID [2022-02-21 03:03:25,708 INFO L272 TraceCheckUtils]: 243: Hoare triple {12134#(<= 0 (+ 47 g_~x))} call #t~ret0 := g(~x - 1); {12135#(<= 0 (+ |g_#in~x| 48))} is VALID [2022-02-21 03:03:25,709 INFO L290 TraceCheckUtils]: 244: Hoare triple {12135#(<= 0 (+ |g_#in~x| 48))} ~x := #in~x; {12136#(<= 0 (+ g_~x 48))} is VALID [2022-02-21 03:03:25,709 INFO L290 TraceCheckUtils]: 245: Hoare triple {12136#(<= 0 (+ g_~x 48))} assume !(0 == ~x); {12136#(<= 0 (+ g_~x 48))} is VALID [2022-02-21 03:03:25,709 INFO L290 TraceCheckUtils]: 246: Hoare triple {12136#(<= 0 (+ g_~x 48))} assume ~x - 1 <= 2147483647; {12136#(<= 0 (+ g_~x 48))} is VALID [2022-02-21 03:03:25,709 INFO L290 TraceCheckUtils]: 247: Hoare triple {12136#(<= 0 (+ g_~x 48))} assume ~x - 1 >= -2147483648; {12136#(<= 0 (+ g_~x 48))} is VALID [2022-02-21 03:03:25,710 INFO L272 TraceCheckUtils]: 248: Hoare triple {12136#(<= 0 (+ g_~x 48))} call #t~ret0 := g(~x - 1); {12137#(<= 0 (+ 49 |g_#in~x|))} is VALID [2022-02-21 03:03:25,710 INFO L290 TraceCheckUtils]: 249: Hoare triple {12137#(<= 0 (+ 49 |g_#in~x|))} ~x := #in~x; {12138#(<= 0 (+ 49 g_~x))} is VALID [2022-02-21 03:03:25,711 INFO L290 TraceCheckUtils]: 250: Hoare triple {12138#(<= 0 (+ 49 g_~x))} assume !(0 == ~x); {12138#(<= 0 (+ 49 g_~x))} is VALID [2022-02-21 03:03:25,711 INFO L290 TraceCheckUtils]: 251: Hoare triple {12138#(<= 0 (+ 49 g_~x))} assume ~x - 1 <= 2147483647; {12138#(<= 0 (+ 49 g_~x))} is VALID [2022-02-21 03:03:25,711 INFO L290 TraceCheckUtils]: 252: Hoare triple {12138#(<= 0 (+ 49 g_~x))} assume ~x - 1 >= -2147483648; {12138#(<= 0 (+ 49 g_~x))} is VALID [2022-02-21 03:03:25,712 INFO L272 TraceCheckUtils]: 253: Hoare triple {12138#(<= 0 (+ 49 g_~x))} call #t~ret0 := g(~x - 1); {12139#(<= 0 (+ |g_#in~x| 50))} is VALID [2022-02-21 03:03:25,712 INFO L290 TraceCheckUtils]: 254: Hoare triple {12139#(<= 0 (+ |g_#in~x| 50))} ~x := #in~x; {12140#(<= 0 (+ g_~x 50))} is VALID [2022-02-21 03:03:25,712 INFO L290 TraceCheckUtils]: 255: Hoare triple {12140#(<= 0 (+ g_~x 50))} assume !(0 == ~x); {12140#(<= 0 (+ g_~x 50))} is VALID [2022-02-21 03:03:25,713 INFO L290 TraceCheckUtils]: 256: Hoare triple {12140#(<= 0 (+ g_~x 50))} assume ~x - 1 <= 2147483647; {12140#(<= 0 (+ g_~x 50))} is VALID [2022-02-21 03:03:25,713 INFO L290 TraceCheckUtils]: 257: Hoare triple {12140#(<= 0 (+ g_~x 50))} assume ~x - 1 >= -2147483648; {12140#(<= 0 (+ g_~x 50))} is VALID [2022-02-21 03:03:25,713 INFO L272 TraceCheckUtils]: 258: Hoare triple {12140#(<= 0 (+ g_~x 50))} call #t~ret0 := g(~x - 1); {12141#(<= 0 (+ 51 |g_#in~x|))} is VALID [2022-02-21 03:03:25,714 INFO L290 TraceCheckUtils]: 259: Hoare triple {12141#(<= 0 (+ 51 |g_#in~x|))} ~x := #in~x; {12142#(<= 0 (+ 51 g_~x))} is VALID [2022-02-21 03:03:25,714 INFO L290 TraceCheckUtils]: 260: Hoare triple {12142#(<= 0 (+ 51 g_~x))} assume !(0 == ~x); {12142#(<= 0 (+ 51 g_~x))} is VALID [2022-02-21 03:03:25,714 INFO L290 TraceCheckUtils]: 261: Hoare triple {12142#(<= 0 (+ 51 g_~x))} assume ~x - 1 <= 2147483647; {12142#(<= 0 (+ 51 g_~x))} is VALID [2022-02-21 03:03:25,715 INFO L290 TraceCheckUtils]: 262: Hoare triple {12142#(<= 0 (+ 51 g_~x))} assume ~x - 1 >= -2147483648; {12142#(<= 0 (+ 51 g_~x))} is VALID [2022-02-21 03:03:25,715 INFO L272 TraceCheckUtils]: 263: Hoare triple {12142#(<= 0 (+ 51 g_~x))} call #t~ret0 := g(~x - 1); {12143#(<= 0 (+ |g_#in~x| 52))} is VALID [2022-02-21 03:03:25,716 INFO L290 TraceCheckUtils]: 264: Hoare triple {12143#(<= 0 (+ |g_#in~x| 52))} ~x := #in~x; {12144#(<= 0 (+ 52 g_~x))} is VALID [2022-02-21 03:03:25,716 INFO L290 TraceCheckUtils]: 265: Hoare triple {12144#(<= 0 (+ 52 g_~x))} assume !(0 == ~x); {12144#(<= 0 (+ 52 g_~x))} is VALID [2022-02-21 03:03:25,716 INFO L290 TraceCheckUtils]: 266: Hoare triple {12144#(<= 0 (+ 52 g_~x))} assume ~x - 1 <= 2147483647; {12144#(<= 0 (+ 52 g_~x))} is VALID [2022-02-21 03:03:25,716 INFO L290 TraceCheckUtils]: 267: Hoare triple {12144#(<= 0 (+ 52 g_~x))} assume ~x - 1 >= -2147483648; {12144#(<= 0 (+ 52 g_~x))} is VALID [2022-02-21 03:03:25,717 INFO L272 TraceCheckUtils]: 268: Hoare triple {12144#(<= 0 (+ 52 g_~x))} call #t~ret0 := g(~x - 1); {12145#(<= 0 (+ 53 |g_#in~x|))} is VALID [2022-02-21 03:03:25,717 INFO L290 TraceCheckUtils]: 269: Hoare triple {12145#(<= 0 (+ 53 |g_#in~x|))} ~x := #in~x; {12146#(<= 0 (+ 53 g_~x))} is VALID [2022-02-21 03:03:25,718 INFO L290 TraceCheckUtils]: 270: Hoare triple {12146#(<= 0 (+ 53 g_~x))} assume !(0 == ~x); {12146#(<= 0 (+ 53 g_~x))} is VALID [2022-02-21 03:03:25,718 INFO L290 TraceCheckUtils]: 271: Hoare triple {12146#(<= 0 (+ 53 g_~x))} assume ~x - 1 <= 2147483647; {12146#(<= 0 (+ 53 g_~x))} is VALID [2022-02-21 03:03:25,718 INFO L290 TraceCheckUtils]: 272: Hoare triple {12146#(<= 0 (+ 53 g_~x))} assume ~x - 1 >= -2147483648; {12146#(<= 0 (+ 53 g_~x))} is VALID [2022-02-21 03:03:25,719 INFO L272 TraceCheckUtils]: 273: Hoare triple {12146#(<= 0 (+ 53 g_~x))} call #t~ret0 := g(~x - 1); {12147#(<= 0 (+ |g_#in~x| 54))} is VALID [2022-02-21 03:03:25,719 INFO L290 TraceCheckUtils]: 274: Hoare triple {12147#(<= 0 (+ |g_#in~x| 54))} ~x := #in~x; {12148#(<= 0 (+ g_~x 54))} is VALID [2022-02-21 03:03:25,719 INFO L290 TraceCheckUtils]: 275: Hoare triple {12148#(<= 0 (+ g_~x 54))} assume !(0 == ~x); {12148#(<= 0 (+ g_~x 54))} is VALID [2022-02-21 03:03:25,720 INFO L290 TraceCheckUtils]: 276: Hoare triple {12148#(<= 0 (+ g_~x 54))} assume ~x - 1 <= 2147483647; {12148#(<= 0 (+ g_~x 54))} is VALID [2022-02-21 03:03:25,720 INFO L290 TraceCheckUtils]: 277: Hoare triple {12148#(<= 0 (+ g_~x 54))} assume ~x - 1 >= -2147483648; {12148#(<= 0 (+ g_~x 54))} is VALID [2022-02-21 03:03:25,720 INFO L272 TraceCheckUtils]: 278: Hoare triple {12148#(<= 0 (+ g_~x 54))} call #t~ret0 := g(~x - 1); {12149#(<= 0 (+ |g_#in~x| 55))} is VALID [2022-02-21 03:03:25,721 INFO L290 TraceCheckUtils]: 279: Hoare triple {12149#(<= 0 (+ |g_#in~x| 55))} ~x := #in~x; {12150#(<= 0 (+ g_~x 55))} is VALID [2022-02-21 03:03:25,721 INFO L290 TraceCheckUtils]: 280: Hoare triple {12150#(<= 0 (+ g_~x 55))} assume !(0 == ~x); {12150#(<= 0 (+ g_~x 55))} is VALID [2022-02-21 03:03:25,721 INFO L290 TraceCheckUtils]: 281: Hoare triple {12150#(<= 0 (+ g_~x 55))} assume ~x - 1 <= 2147483647; {12150#(<= 0 (+ g_~x 55))} is VALID [2022-02-21 03:03:25,722 INFO L290 TraceCheckUtils]: 282: Hoare triple {12150#(<= 0 (+ g_~x 55))} assume ~x - 1 >= -2147483648; {12150#(<= 0 (+ g_~x 55))} is VALID [2022-02-21 03:03:25,722 INFO L272 TraceCheckUtils]: 283: Hoare triple {12150#(<= 0 (+ g_~x 55))} call #t~ret0 := g(~x - 1); {12151#(<= 0 (+ 56 |g_#in~x|))} is VALID [2022-02-21 03:03:25,722 INFO L290 TraceCheckUtils]: 284: Hoare triple {12151#(<= 0 (+ 56 |g_#in~x|))} ~x := #in~x; {12152#(<= 0 (+ 56 g_~x))} is VALID [2022-02-21 03:03:25,723 INFO L290 TraceCheckUtils]: 285: Hoare triple {12152#(<= 0 (+ 56 g_~x))} assume !(0 == ~x); {12152#(<= 0 (+ 56 g_~x))} is VALID [2022-02-21 03:03:25,723 INFO L290 TraceCheckUtils]: 286: Hoare triple {12152#(<= 0 (+ 56 g_~x))} assume ~x - 1 <= 2147483647; {12152#(<= 0 (+ 56 g_~x))} is VALID [2022-02-21 03:03:25,723 INFO L290 TraceCheckUtils]: 287: Hoare triple {12152#(<= 0 (+ 56 g_~x))} assume ~x - 1 >= -2147483648; {12152#(<= 0 (+ 56 g_~x))} is VALID [2022-02-21 03:03:25,724 INFO L272 TraceCheckUtils]: 288: Hoare triple {12152#(<= 0 (+ 56 g_~x))} call #t~ret0 := g(~x - 1); {12153#(<= 0 (+ 57 |g_#in~x|))} is VALID [2022-02-21 03:03:25,724 INFO L290 TraceCheckUtils]: 289: Hoare triple {12153#(<= 0 (+ 57 |g_#in~x|))} ~x := #in~x; {12154#(<= 0 (+ 57 g_~x))} is VALID [2022-02-21 03:03:25,724 INFO L290 TraceCheckUtils]: 290: Hoare triple {12154#(<= 0 (+ 57 g_~x))} assume !(0 == ~x); {12154#(<= 0 (+ 57 g_~x))} is VALID [2022-02-21 03:03:25,725 INFO L290 TraceCheckUtils]: 291: Hoare triple {12154#(<= 0 (+ 57 g_~x))} assume ~x - 1 <= 2147483647; {12154#(<= 0 (+ 57 g_~x))} is VALID [2022-02-21 03:03:25,725 INFO L290 TraceCheckUtils]: 292: Hoare triple {12154#(<= 0 (+ 57 g_~x))} assume ~x - 1 >= -2147483648; {12154#(<= 0 (+ 57 g_~x))} is VALID [2022-02-21 03:03:25,726 INFO L272 TraceCheckUtils]: 293: Hoare triple {12154#(<= 0 (+ 57 g_~x))} call #t~ret0 := g(~x - 1); {12155#(<= 0 (+ |g_#in~x| 58))} is VALID [2022-02-21 03:03:25,726 INFO L290 TraceCheckUtils]: 294: Hoare triple {12155#(<= 0 (+ |g_#in~x| 58))} ~x := #in~x; {12156#(<= 0 (+ g_~x 58))} is VALID [2022-02-21 03:03:25,726 INFO L290 TraceCheckUtils]: 295: Hoare triple {12156#(<= 0 (+ g_~x 58))} assume !(0 == ~x); {12156#(<= 0 (+ g_~x 58))} is VALID [2022-02-21 03:03:25,726 INFO L290 TraceCheckUtils]: 296: Hoare triple {12156#(<= 0 (+ g_~x 58))} assume ~x - 1 <= 2147483647; {12156#(<= 0 (+ g_~x 58))} is VALID [2022-02-21 03:03:25,727 INFO L290 TraceCheckUtils]: 297: Hoare triple {12156#(<= 0 (+ g_~x 58))} assume ~x - 1 >= -2147483648; {12156#(<= 0 (+ g_~x 58))} is VALID [2022-02-21 03:03:25,727 INFO L272 TraceCheckUtils]: 298: Hoare triple {12156#(<= 0 (+ g_~x 58))} call #t~ret0 := g(~x - 1); {12157#(<= 0 (+ 59 |g_#in~x|))} is VALID [2022-02-21 03:03:25,728 INFO L290 TraceCheckUtils]: 299: Hoare triple {12157#(<= 0 (+ 59 |g_#in~x|))} ~x := #in~x; {12158#(<= 0 (+ 59 g_~x))} is VALID [2022-02-21 03:03:25,728 INFO L290 TraceCheckUtils]: 300: Hoare triple {12158#(<= 0 (+ 59 g_~x))} assume !(0 == ~x); {12158#(<= 0 (+ 59 g_~x))} is VALID [2022-02-21 03:03:25,728 INFO L290 TraceCheckUtils]: 301: Hoare triple {12158#(<= 0 (+ 59 g_~x))} assume ~x - 1 <= 2147483647; {12158#(<= 0 (+ 59 g_~x))} is VALID [2022-02-21 03:03:25,729 INFO L290 TraceCheckUtils]: 302: Hoare triple {12158#(<= 0 (+ 59 g_~x))} assume ~x - 1 >= -2147483648; {12158#(<= 0 (+ 59 g_~x))} is VALID [2022-02-21 03:03:25,729 INFO L272 TraceCheckUtils]: 303: Hoare triple {12158#(<= 0 (+ 59 g_~x))} call #t~ret0 := g(~x - 1); {12159#(<= 0 (+ |g_#in~x| 60))} is VALID [2022-02-21 03:03:25,729 INFO L290 TraceCheckUtils]: 304: Hoare triple {12159#(<= 0 (+ |g_#in~x| 60))} ~x := #in~x; {12160#(<= 0 (+ g_~x 60))} is VALID [2022-02-21 03:03:25,730 INFO L290 TraceCheckUtils]: 305: Hoare triple {12160#(<= 0 (+ g_~x 60))} assume !(0 == ~x); {12160#(<= 0 (+ g_~x 60))} is VALID [2022-02-21 03:03:25,730 INFO L290 TraceCheckUtils]: 306: Hoare triple {12160#(<= 0 (+ g_~x 60))} assume ~x - 1 <= 2147483647; {12160#(<= 0 (+ g_~x 60))} is VALID [2022-02-21 03:03:25,730 INFO L290 TraceCheckUtils]: 307: Hoare triple {12160#(<= 0 (+ g_~x 60))} assume ~x - 1 >= -2147483648; {12160#(<= 0 (+ g_~x 60))} is VALID [2022-02-21 03:03:25,731 INFO L272 TraceCheckUtils]: 308: Hoare triple {12160#(<= 0 (+ g_~x 60))} call #t~ret0 := g(~x - 1); {12161#(<= 0 (+ |g_#in~x| 61))} is VALID [2022-02-21 03:03:25,731 INFO L290 TraceCheckUtils]: 309: Hoare triple {12161#(<= 0 (+ |g_#in~x| 61))} ~x := #in~x; {12162#(<= 0 (+ g_~x 61))} is VALID [2022-02-21 03:03:25,731 INFO L290 TraceCheckUtils]: 310: Hoare triple {12162#(<= 0 (+ g_~x 61))} assume !(0 == ~x); {12162#(<= 0 (+ g_~x 61))} is VALID [2022-02-21 03:03:25,732 INFO L290 TraceCheckUtils]: 311: Hoare triple {12162#(<= 0 (+ g_~x 61))} assume ~x - 1 <= 2147483647; {12162#(<= 0 (+ g_~x 61))} is VALID [2022-02-21 03:03:25,732 INFO L290 TraceCheckUtils]: 312: Hoare triple {12162#(<= 0 (+ g_~x 61))} assume ~x - 1 >= -2147483648; {12162#(<= 0 (+ g_~x 61))} is VALID [2022-02-21 03:03:25,732 INFO L272 TraceCheckUtils]: 313: Hoare triple {12162#(<= 0 (+ g_~x 61))} call #t~ret0 := g(~x - 1); {12163#(<= 0 (+ |g_#in~x| 62))} is VALID [2022-02-21 03:03:25,733 INFO L290 TraceCheckUtils]: 314: Hoare triple {12163#(<= 0 (+ |g_#in~x| 62))} ~x := #in~x; {12164#(<= 0 (+ 62 g_~x))} is VALID [2022-02-21 03:03:25,733 INFO L290 TraceCheckUtils]: 315: Hoare triple {12164#(<= 0 (+ 62 g_~x))} assume !(0 == ~x); {12164#(<= 0 (+ 62 g_~x))} is VALID [2022-02-21 03:03:25,733 INFO L290 TraceCheckUtils]: 316: Hoare triple {12164#(<= 0 (+ 62 g_~x))} assume ~x - 1 <= 2147483647; {12164#(<= 0 (+ 62 g_~x))} is VALID [2022-02-21 03:03:25,734 INFO L290 TraceCheckUtils]: 317: Hoare triple {12164#(<= 0 (+ 62 g_~x))} assume ~x - 1 >= -2147483648; {12164#(<= 0 (+ 62 g_~x))} is VALID [2022-02-21 03:03:25,734 INFO L272 TraceCheckUtils]: 318: Hoare triple {12164#(<= 0 (+ 62 g_~x))} call #t~ret0 := g(~x - 1); {12165#(<= 0 (+ |g_#in~x| 63))} is VALID [2022-02-21 03:03:25,735 INFO L290 TraceCheckUtils]: 319: Hoare triple {12165#(<= 0 (+ |g_#in~x| 63))} ~x := #in~x; {12166#(<= 0 (+ g_~x 63))} is VALID [2022-02-21 03:03:25,735 INFO L290 TraceCheckUtils]: 320: Hoare triple {12166#(<= 0 (+ g_~x 63))} assume !(0 == ~x); {12166#(<= 0 (+ g_~x 63))} is VALID [2022-02-21 03:03:25,735 INFO L290 TraceCheckUtils]: 321: Hoare triple {12166#(<= 0 (+ g_~x 63))} assume ~x - 1 <= 2147483647; {12166#(<= 0 (+ g_~x 63))} is VALID [2022-02-21 03:03:25,735 INFO L290 TraceCheckUtils]: 322: Hoare triple {12166#(<= 0 (+ g_~x 63))} assume ~x - 1 >= -2147483648; {12166#(<= 0 (+ g_~x 63))} is VALID [2022-02-21 03:03:25,736 INFO L272 TraceCheckUtils]: 323: Hoare triple {12166#(<= 0 (+ g_~x 63))} call #t~ret0 := g(~x - 1); {12167#(<= 0 (+ 64 |g_#in~x|))} is VALID [2022-02-21 03:03:25,736 INFO L290 TraceCheckUtils]: 324: Hoare triple {12167#(<= 0 (+ 64 |g_#in~x|))} ~x := #in~x; {12168#(<= 0 (+ 64 g_~x))} is VALID [2022-02-21 03:03:25,737 INFO L290 TraceCheckUtils]: 325: Hoare triple {12168#(<= 0 (+ 64 g_~x))} assume !(0 == ~x); {12168#(<= 0 (+ 64 g_~x))} is VALID [2022-02-21 03:03:25,737 INFO L290 TraceCheckUtils]: 326: Hoare triple {12168#(<= 0 (+ 64 g_~x))} assume ~x - 1 <= 2147483647; {12168#(<= 0 (+ 64 g_~x))} is VALID [2022-02-21 03:03:25,737 INFO L290 TraceCheckUtils]: 327: Hoare triple {12168#(<= 0 (+ 64 g_~x))} assume ~x - 1 >= -2147483648; {12168#(<= 0 (+ 64 g_~x))} is VALID [2022-02-21 03:03:25,738 INFO L272 TraceCheckUtils]: 328: Hoare triple {12168#(<= 0 (+ 64 g_~x))} call #t~ret0 := g(~x - 1); {12169#(<= 0 (+ |g_#in~x| 65))} is VALID [2022-02-21 03:03:25,738 INFO L290 TraceCheckUtils]: 329: Hoare triple {12169#(<= 0 (+ |g_#in~x| 65))} ~x := #in~x; {12170#(<= 0 (+ g_~x 65))} is VALID [2022-02-21 03:03:25,739 INFO L290 TraceCheckUtils]: 330: Hoare triple {12170#(<= 0 (+ g_~x 65))} assume !(0 == ~x); {12170#(<= 0 (+ g_~x 65))} is VALID [2022-02-21 03:03:25,739 INFO L290 TraceCheckUtils]: 331: Hoare triple {12170#(<= 0 (+ g_~x 65))} assume ~x - 1 <= 2147483647; {12170#(<= 0 (+ g_~x 65))} is VALID [2022-02-21 03:03:25,739 INFO L290 TraceCheckUtils]: 332: Hoare triple {12170#(<= 0 (+ g_~x 65))} assume ~x - 1 >= -2147483648; {12170#(<= 0 (+ g_~x 65))} is VALID [2022-02-21 03:03:25,740 INFO L272 TraceCheckUtils]: 333: Hoare triple {12170#(<= 0 (+ g_~x 65))} call #t~ret0 := g(~x - 1); {12171#(<= 0 (+ 66 |g_#in~x|))} is VALID [2022-02-21 03:03:25,740 INFO L290 TraceCheckUtils]: 334: Hoare triple {12171#(<= 0 (+ 66 |g_#in~x|))} ~x := #in~x; {12172#(<= 0 (+ 66 g_~x))} is VALID [2022-02-21 03:03:25,740 INFO L290 TraceCheckUtils]: 335: Hoare triple {12172#(<= 0 (+ 66 g_~x))} assume !(0 == ~x); {12172#(<= 0 (+ 66 g_~x))} is VALID [2022-02-21 03:03:25,741 INFO L290 TraceCheckUtils]: 336: Hoare triple {12172#(<= 0 (+ 66 g_~x))} assume ~x - 1 <= 2147483647; {12172#(<= 0 (+ 66 g_~x))} is VALID [2022-02-21 03:03:25,741 INFO L290 TraceCheckUtils]: 337: Hoare triple {12172#(<= 0 (+ 66 g_~x))} assume ~x - 1 >= -2147483648; {12172#(<= 0 (+ 66 g_~x))} is VALID [2022-02-21 03:03:25,742 INFO L272 TraceCheckUtils]: 338: Hoare triple {12172#(<= 0 (+ 66 g_~x))} call #t~ret0 := g(~x - 1); {12173#(<= 0 (+ 67 |g_#in~x|))} is VALID [2022-02-21 03:03:25,742 INFO L290 TraceCheckUtils]: 339: Hoare triple {12173#(<= 0 (+ 67 |g_#in~x|))} ~x := #in~x; {12174#(<= 0 (+ 67 g_~x))} is VALID [2022-02-21 03:03:25,742 INFO L290 TraceCheckUtils]: 340: Hoare triple {12174#(<= 0 (+ 67 g_~x))} assume !(0 == ~x); {12174#(<= 0 (+ 67 g_~x))} is VALID [2022-02-21 03:03:25,743 INFO L290 TraceCheckUtils]: 341: Hoare triple {12174#(<= 0 (+ 67 g_~x))} assume ~x - 1 <= 2147483647; {12174#(<= 0 (+ 67 g_~x))} is VALID [2022-02-21 03:03:25,743 INFO L290 TraceCheckUtils]: 342: Hoare triple {12174#(<= 0 (+ 67 g_~x))} assume ~x - 1 >= -2147483648; {12174#(<= 0 (+ 67 g_~x))} is VALID [2022-02-21 03:03:25,744 INFO L272 TraceCheckUtils]: 343: Hoare triple {12174#(<= 0 (+ 67 g_~x))} call #t~ret0 := g(~x - 1); {12175#(<= 0 (+ 68 |g_#in~x|))} is VALID [2022-02-21 03:03:25,744 INFO L290 TraceCheckUtils]: 344: Hoare triple {12175#(<= 0 (+ 68 |g_#in~x|))} ~x := #in~x; {12176#(<= 0 (+ 68 g_~x))} is VALID [2022-02-21 03:03:25,744 INFO L290 TraceCheckUtils]: 345: Hoare triple {12176#(<= 0 (+ 68 g_~x))} assume !(0 == ~x); {12176#(<= 0 (+ 68 g_~x))} is VALID [2022-02-21 03:03:25,745 INFO L290 TraceCheckUtils]: 346: Hoare triple {12176#(<= 0 (+ 68 g_~x))} assume ~x - 1 <= 2147483647; {12176#(<= 0 (+ 68 g_~x))} is VALID [2022-02-21 03:03:25,745 INFO L290 TraceCheckUtils]: 347: Hoare triple {12176#(<= 0 (+ 68 g_~x))} assume ~x - 1 >= -2147483648; {12176#(<= 0 (+ 68 g_~x))} is VALID [2022-02-21 03:03:25,745 INFO L272 TraceCheckUtils]: 348: Hoare triple {12176#(<= 0 (+ 68 g_~x))} call #t~ret0 := g(~x - 1); {12177#(<= 0 (+ |g_#in~x| 69))} is VALID [2022-02-21 03:03:25,746 INFO L290 TraceCheckUtils]: 349: Hoare triple {12177#(<= 0 (+ |g_#in~x| 69))} ~x := #in~x; {12178#(<= 0 (+ 69 g_~x))} is VALID [2022-02-21 03:03:25,746 INFO L290 TraceCheckUtils]: 350: Hoare triple {12178#(<= 0 (+ 69 g_~x))} assume !(0 == ~x); {12178#(<= 0 (+ 69 g_~x))} is VALID [2022-02-21 03:03:25,746 INFO L290 TraceCheckUtils]: 351: Hoare triple {12178#(<= 0 (+ 69 g_~x))} assume ~x - 1 <= 2147483647; {12178#(<= 0 (+ 69 g_~x))} is VALID [2022-02-21 03:03:25,747 INFO L290 TraceCheckUtils]: 352: Hoare triple {12178#(<= 0 (+ 69 g_~x))} assume ~x - 1 >= -2147483648; {12178#(<= 0 (+ 69 g_~x))} is VALID [2022-02-21 03:03:25,747 INFO L272 TraceCheckUtils]: 353: Hoare triple {12178#(<= 0 (+ 69 g_~x))} call #t~ret0 := g(~x - 1); {12179#(<= 0 (+ |g_#in~x| 70))} is VALID [2022-02-21 03:03:25,748 INFO L290 TraceCheckUtils]: 354: Hoare triple {12179#(<= 0 (+ |g_#in~x| 70))} ~x := #in~x; {12180#(<= 0 (+ g_~x 70))} is VALID [2022-02-21 03:03:25,748 INFO L290 TraceCheckUtils]: 355: Hoare triple {12180#(<= 0 (+ g_~x 70))} assume !(0 == ~x); {12180#(<= 0 (+ g_~x 70))} is VALID [2022-02-21 03:03:25,748 INFO L290 TraceCheckUtils]: 356: Hoare triple {12180#(<= 0 (+ g_~x 70))} assume ~x - 1 <= 2147483647; {12180#(<= 0 (+ g_~x 70))} is VALID [2022-02-21 03:03:25,748 INFO L290 TraceCheckUtils]: 357: Hoare triple {12180#(<= 0 (+ g_~x 70))} assume ~x - 1 >= -2147483648; {12180#(<= 0 (+ g_~x 70))} is VALID [2022-02-21 03:03:25,749 INFO L272 TraceCheckUtils]: 358: Hoare triple {12180#(<= 0 (+ g_~x 70))} call #t~ret0 := g(~x - 1); {12181#(<= 0 (+ |g_#in~x| 71))} is VALID [2022-02-21 03:03:25,749 INFO L290 TraceCheckUtils]: 359: Hoare triple {12181#(<= 0 (+ |g_#in~x| 71))} ~x := #in~x; {12182#(<= 0 (+ 71 g_~x))} is VALID [2022-02-21 03:03:25,750 INFO L290 TraceCheckUtils]: 360: Hoare triple {12182#(<= 0 (+ 71 g_~x))} assume !(0 == ~x); {12182#(<= 0 (+ 71 g_~x))} is VALID [2022-02-21 03:03:25,750 INFO L290 TraceCheckUtils]: 361: Hoare triple {12182#(<= 0 (+ 71 g_~x))} assume ~x - 1 <= 2147483647; {12182#(<= 0 (+ 71 g_~x))} is VALID [2022-02-21 03:03:25,750 INFO L290 TraceCheckUtils]: 362: Hoare triple {12182#(<= 0 (+ 71 g_~x))} assume ~x - 1 >= -2147483648; {12182#(<= 0 (+ 71 g_~x))} is VALID [2022-02-21 03:03:25,751 INFO L272 TraceCheckUtils]: 363: Hoare triple {12182#(<= 0 (+ 71 g_~x))} call #t~ret0 := g(~x - 1); {12183#(<= 0 (+ 72 |g_#in~x|))} is VALID [2022-02-21 03:03:25,751 INFO L290 TraceCheckUtils]: 364: Hoare triple {12183#(<= 0 (+ 72 |g_#in~x|))} ~x := #in~x; {12184#(<= 0 (+ 72 g_~x))} is VALID [2022-02-21 03:03:25,751 INFO L290 TraceCheckUtils]: 365: Hoare triple {12184#(<= 0 (+ 72 g_~x))} assume !(0 == ~x); {12184#(<= 0 (+ 72 g_~x))} is VALID [2022-02-21 03:03:25,752 INFO L290 TraceCheckUtils]: 366: Hoare triple {12184#(<= 0 (+ 72 g_~x))} assume ~x - 1 <= 2147483647; {12184#(<= 0 (+ 72 g_~x))} is VALID [2022-02-21 03:03:25,752 INFO L290 TraceCheckUtils]: 367: Hoare triple {12184#(<= 0 (+ 72 g_~x))} assume ~x - 1 >= -2147483648; {12184#(<= 0 (+ 72 g_~x))} is VALID [2022-02-21 03:03:25,753 INFO L272 TraceCheckUtils]: 368: Hoare triple {12184#(<= 0 (+ 72 g_~x))} call #t~ret0 := g(~x - 1); {12185#(<= 0 (+ |g_#in~x| 73))} is VALID [2022-02-21 03:03:25,753 INFO L290 TraceCheckUtils]: 369: Hoare triple {12185#(<= 0 (+ |g_#in~x| 73))} ~x := #in~x; {12186#(<= 0 (+ g_~x 73))} is VALID [2022-02-21 03:03:25,753 INFO L290 TraceCheckUtils]: 370: Hoare triple {12186#(<= 0 (+ g_~x 73))} assume !(0 == ~x); {12186#(<= 0 (+ g_~x 73))} is VALID [2022-02-21 03:03:25,754 INFO L290 TraceCheckUtils]: 371: Hoare triple {12186#(<= 0 (+ g_~x 73))} assume ~x - 1 <= 2147483647; {12186#(<= 0 (+ g_~x 73))} is VALID [2022-02-21 03:03:25,754 INFO L290 TraceCheckUtils]: 372: Hoare triple {12186#(<= 0 (+ g_~x 73))} assume ~x - 1 >= -2147483648; {12186#(<= 0 (+ g_~x 73))} is VALID [2022-02-21 03:03:25,754 INFO L272 TraceCheckUtils]: 373: Hoare triple {12186#(<= 0 (+ g_~x 73))} call #t~ret0 := g(~x - 1); {12187#(<= 0 (+ |g_#in~x| 74))} is VALID [2022-02-21 03:03:25,755 INFO L290 TraceCheckUtils]: 374: Hoare triple {12187#(<= 0 (+ |g_#in~x| 74))} ~x := #in~x; {12188#(<= 0 (+ g_~x 74))} is VALID [2022-02-21 03:03:25,755 INFO L290 TraceCheckUtils]: 375: Hoare triple {12188#(<= 0 (+ g_~x 74))} assume !(0 == ~x); {12188#(<= 0 (+ g_~x 74))} is VALID [2022-02-21 03:03:25,755 INFO L290 TraceCheckUtils]: 376: Hoare triple {12188#(<= 0 (+ g_~x 74))} assume ~x - 1 <= 2147483647; {12188#(<= 0 (+ g_~x 74))} is VALID [2022-02-21 03:03:25,756 INFO L290 TraceCheckUtils]: 377: Hoare triple {12188#(<= 0 (+ g_~x 74))} assume ~x - 1 >= -2147483648; {12188#(<= 0 (+ g_~x 74))} is VALID [2022-02-21 03:03:25,756 INFO L272 TraceCheckUtils]: 378: Hoare triple {12188#(<= 0 (+ g_~x 74))} call #t~ret0 := g(~x - 1); {12189#(<= 0 (+ |g_#in~x| 75))} is VALID [2022-02-21 03:03:25,756 INFO L290 TraceCheckUtils]: 379: Hoare triple {12189#(<= 0 (+ |g_#in~x| 75))} ~x := #in~x; {12190#(<= 0 (+ g_~x 75))} is VALID [2022-02-21 03:03:25,757 INFO L290 TraceCheckUtils]: 380: Hoare triple {12190#(<= 0 (+ g_~x 75))} assume !(0 == ~x); {12190#(<= 0 (+ g_~x 75))} is VALID [2022-02-21 03:03:25,757 INFO L290 TraceCheckUtils]: 381: Hoare triple {12190#(<= 0 (+ g_~x 75))} assume ~x - 1 <= 2147483647; {12190#(<= 0 (+ g_~x 75))} is VALID [2022-02-21 03:03:25,757 INFO L290 TraceCheckUtils]: 382: Hoare triple {12190#(<= 0 (+ g_~x 75))} assume ~x - 1 >= -2147483648; {12190#(<= 0 (+ g_~x 75))} is VALID [2022-02-21 03:03:25,758 INFO L272 TraceCheckUtils]: 383: Hoare triple {12190#(<= 0 (+ g_~x 75))} call #t~ret0 := g(~x - 1); {12191#(<= 0 (+ 76 |g_#in~x|))} is VALID [2022-02-21 03:03:25,758 INFO L290 TraceCheckUtils]: 384: Hoare triple {12191#(<= 0 (+ 76 |g_#in~x|))} ~x := #in~x; {12192#(<= 0 (+ 76 g_~x))} is VALID [2022-02-21 03:03:25,758 INFO L290 TraceCheckUtils]: 385: Hoare triple {12192#(<= 0 (+ 76 g_~x))} assume !(0 == ~x); {12192#(<= 0 (+ 76 g_~x))} is VALID [2022-02-21 03:03:25,759 INFO L290 TraceCheckUtils]: 386: Hoare triple {12192#(<= 0 (+ 76 g_~x))} assume ~x - 1 <= 2147483647; {12192#(<= 0 (+ 76 g_~x))} is VALID [2022-02-21 03:03:25,759 INFO L290 TraceCheckUtils]: 387: Hoare triple {12192#(<= 0 (+ 76 g_~x))} assume ~x - 1 >= -2147483648; {12192#(<= 0 (+ 76 g_~x))} is VALID [2022-02-21 03:03:25,760 INFO L272 TraceCheckUtils]: 388: Hoare triple {12192#(<= 0 (+ 76 g_~x))} call #t~ret0 := g(~x - 1); {12193#(<= 0 (+ 77 |g_#in~x|))} is VALID [2022-02-21 03:03:25,760 INFO L290 TraceCheckUtils]: 389: Hoare triple {12193#(<= 0 (+ 77 |g_#in~x|))} ~x := #in~x; {12194#(<= 0 (+ 77 g_~x))} is VALID [2022-02-21 03:03:25,760 INFO L290 TraceCheckUtils]: 390: Hoare triple {12194#(<= 0 (+ 77 g_~x))} assume !(0 == ~x); {12194#(<= 0 (+ 77 g_~x))} is VALID [2022-02-21 03:03:25,760 INFO L290 TraceCheckUtils]: 391: Hoare triple {12194#(<= 0 (+ 77 g_~x))} assume ~x - 1 <= 2147483647; {12194#(<= 0 (+ 77 g_~x))} is VALID [2022-02-21 03:03:25,761 INFO L290 TraceCheckUtils]: 392: Hoare triple {12194#(<= 0 (+ 77 g_~x))} assume ~x - 1 >= -2147483648; {12194#(<= 0 (+ 77 g_~x))} is VALID [2022-02-21 03:03:25,761 INFO L272 TraceCheckUtils]: 393: Hoare triple {12194#(<= 0 (+ 77 g_~x))} call #t~ret0 := g(~x - 1); {12195#(<= 0 (+ |g_#in~x| 78))} is VALID [2022-02-21 03:03:25,762 INFO L290 TraceCheckUtils]: 394: Hoare triple {12195#(<= 0 (+ |g_#in~x| 78))} ~x := #in~x; {12196#(<= 0 (+ g_~x 78))} is VALID [2022-02-21 03:03:25,762 INFO L290 TraceCheckUtils]: 395: Hoare triple {12196#(<= 0 (+ g_~x 78))} assume !(0 == ~x); {12196#(<= 0 (+ g_~x 78))} is VALID [2022-02-21 03:03:25,762 INFO L290 TraceCheckUtils]: 396: Hoare triple {12196#(<= 0 (+ g_~x 78))} assume ~x - 1 <= 2147483647; {12196#(<= 0 (+ g_~x 78))} is VALID [2022-02-21 03:03:25,762 INFO L290 TraceCheckUtils]: 397: Hoare triple {12196#(<= 0 (+ g_~x 78))} assume ~x - 1 >= -2147483648; {12196#(<= 0 (+ g_~x 78))} is VALID [2022-02-21 03:03:25,763 INFO L272 TraceCheckUtils]: 398: Hoare triple {12196#(<= 0 (+ g_~x 78))} call #t~ret0 := g(~x - 1); {12197#(<= 0 (+ |g_#in~x| 79))} is VALID [2022-02-21 03:03:25,763 INFO L290 TraceCheckUtils]: 399: Hoare triple {12197#(<= 0 (+ |g_#in~x| 79))} ~x := #in~x; {12198#(<= 0 (+ g_~x 79))} is VALID [2022-02-21 03:03:25,764 INFO L290 TraceCheckUtils]: 400: Hoare triple {12198#(<= 0 (+ g_~x 79))} assume !(0 == ~x); {12198#(<= 0 (+ g_~x 79))} is VALID [2022-02-21 03:03:25,764 INFO L290 TraceCheckUtils]: 401: Hoare triple {12198#(<= 0 (+ g_~x 79))} assume ~x - 1 <= 2147483647; {12198#(<= 0 (+ g_~x 79))} is VALID [2022-02-21 03:03:25,764 INFO L290 TraceCheckUtils]: 402: Hoare triple {12198#(<= 0 (+ g_~x 79))} assume ~x - 1 >= -2147483648; {12198#(<= 0 (+ g_~x 79))} is VALID [2022-02-21 03:03:25,765 INFO L272 TraceCheckUtils]: 403: Hoare triple {12198#(<= 0 (+ g_~x 79))} call #t~ret0 := g(~x - 1); {12199#(<= 0 (+ |g_#in~x| 80))} is VALID [2022-02-21 03:03:25,765 INFO L290 TraceCheckUtils]: 404: Hoare triple {12199#(<= 0 (+ |g_#in~x| 80))} ~x := #in~x; {12200#(<= 0 (+ g_~x 80))} is VALID [2022-02-21 03:03:25,765 INFO L290 TraceCheckUtils]: 405: Hoare triple {12200#(<= 0 (+ g_~x 80))} assume !(0 == ~x); {12200#(<= 0 (+ g_~x 80))} is VALID [2022-02-21 03:03:25,766 INFO L290 TraceCheckUtils]: 406: Hoare triple {12200#(<= 0 (+ g_~x 80))} assume ~x - 1 <= 2147483647; {12200#(<= 0 (+ g_~x 80))} is VALID [2022-02-21 03:03:25,766 INFO L290 TraceCheckUtils]: 407: Hoare triple {12200#(<= 0 (+ g_~x 80))} assume ~x - 1 >= -2147483648; {12200#(<= 0 (+ g_~x 80))} is VALID [2022-02-21 03:03:25,766 INFO L272 TraceCheckUtils]: 408: Hoare triple {12200#(<= 0 (+ g_~x 80))} call #t~ret0 := g(~x - 1); {12201#(<= 0 (+ |g_#in~x| 81))} is VALID [2022-02-21 03:03:25,767 INFO L290 TraceCheckUtils]: 409: Hoare triple {12201#(<= 0 (+ |g_#in~x| 81))} ~x := #in~x; {12202#(<= 0 (+ 81 g_~x))} is VALID [2022-02-21 03:03:25,767 INFO L290 TraceCheckUtils]: 410: Hoare triple {12202#(<= 0 (+ 81 g_~x))} assume !(0 == ~x); {12202#(<= 0 (+ 81 g_~x))} is VALID [2022-02-21 03:03:25,767 INFO L290 TraceCheckUtils]: 411: Hoare triple {12202#(<= 0 (+ 81 g_~x))} assume ~x - 1 <= 2147483647; {12202#(<= 0 (+ 81 g_~x))} is VALID [2022-02-21 03:03:25,768 INFO L290 TraceCheckUtils]: 412: Hoare triple {12202#(<= 0 (+ 81 g_~x))} assume ~x - 1 >= -2147483648; {12202#(<= 0 (+ 81 g_~x))} is VALID [2022-02-21 03:03:25,768 INFO L272 TraceCheckUtils]: 413: Hoare triple {12202#(<= 0 (+ 81 g_~x))} call #t~ret0 := g(~x - 1); {12203#(<= 0 (+ |g_#in~x| 82))} is VALID [2022-02-21 03:03:25,769 INFO L290 TraceCheckUtils]: 414: Hoare triple {12203#(<= 0 (+ |g_#in~x| 82))} ~x := #in~x; {12204#(<= 0 (+ 82 g_~x))} is VALID [2022-02-21 03:03:25,769 INFO L290 TraceCheckUtils]: 415: Hoare triple {12204#(<= 0 (+ 82 g_~x))} assume !(0 == ~x); {12204#(<= 0 (+ 82 g_~x))} is VALID [2022-02-21 03:03:25,769 INFO L290 TraceCheckUtils]: 416: Hoare triple {12204#(<= 0 (+ 82 g_~x))} assume ~x - 1 <= 2147483647; {12204#(<= 0 (+ 82 g_~x))} is VALID [2022-02-21 03:03:25,770 INFO L290 TraceCheckUtils]: 417: Hoare triple {12204#(<= 0 (+ 82 g_~x))} assume ~x - 1 >= -2147483648; {12204#(<= 0 (+ 82 g_~x))} is VALID [2022-02-21 03:03:25,770 INFO L272 TraceCheckUtils]: 418: Hoare triple {12204#(<= 0 (+ 82 g_~x))} call #t~ret0 := g(~x - 1); {12205#(<= 0 (+ |g_#in~x| 83))} is VALID [2022-02-21 03:03:25,771 INFO L290 TraceCheckUtils]: 419: Hoare triple {12205#(<= 0 (+ |g_#in~x| 83))} ~x := #in~x; {12206#(<= 0 (+ g_~x 83))} is VALID [2022-02-21 03:03:25,771 INFO L290 TraceCheckUtils]: 420: Hoare triple {12206#(<= 0 (+ g_~x 83))} assume !(0 == ~x); {12206#(<= 0 (+ g_~x 83))} is VALID [2022-02-21 03:03:25,771 INFO L290 TraceCheckUtils]: 421: Hoare triple {12206#(<= 0 (+ g_~x 83))} assume ~x - 1 <= 2147483647; {12206#(<= 0 (+ g_~x 83))} is VALID [2022-02-21 03:03:25,771 INFO L290 TraceCheckUtils]: 422: Hoare triple {12206#(<= 0 (+ g_~x 83))} assume ~x - 1 >= -2147483648; {12206#(<= 0 (+ g_~x 83))} is VALID [2022-02-21 03:03:25,772 INFO L272 TraceCheckUtils]: 423: Hoare triple {12206#(<= 0 (+ g_~x 83))} call #t~ret0 := g(~x - 1); {12207#(<= 0 (+ |g_#in~x| 84))} is VALID [2022-02-21 03:03:25,772 INFO L290 TraceCheckUtils]: 424: Hoare triple {12207#(<= 0 (+ |g_#in~x| 84))} ~x := #in~x; {12208#(<= 0 (+ 84 g_~x))} is VALID [2022-02-21 03:03:25,773 INFO L290 TraceCheckUtils]: 425: Hoare triple {12208#(<= 0 (+ 84 g_~x))} assume !(0 == ~x); {12208#(<= 0 (+ 84 g_~x))} is VALID [2022-02-21 03:03:25,773 INFO L290 TraceCheckUtils]: 426: Hoare triple {12208#(<= 0 (+ 84 g_~x))} assume ~x - 1 <= 2147483647; {12208#(<= 0 (+ 84 g_~x))} is VALID [2022-02-21 03:03:25,773 INFO L290 TraceCheckUtils]: 427: Hoare triple {12208#(<= 0 (+ 84 g_~x))} assume ~x - 1 >= -2147483648; {12208#(<= 0 (+ 84 g_~x))} is VALID [2022-02-21 03:03:25,774 INFO L272 TraceCheckUtils]: 428: Hoare triple {12208#(<= 0 (+ 84 g_~x))} call #t~ret0 := g(~x - 1); {12209#(<= 0 (+ |g_#in~x| 85))} is VALID [2022-02-21 03:03:25,774 INFO L290 TraceCheckUtils]: 429: Hoare triple {12209#(<= 0 (+ |g_#in~x| 85))} ~x := #in~x; {12210#(<= 0 (+ g_~x 85))} is VALID [2022-02-21 03:03:25,774 INFO L290 TraceCheckUtils]: 430: Hoare triple {12210#(<= 0 (+ g_~x 85))} assume !(0 == ~x); {12210#(<= 0 (+ g_~x 85))} is VALID [2022-02-21 03:03:25,775 INFO L290 TraceCheckUtils]: 431: Hoare triple {12210#(<= 0 (+ g_~x 85))} assume ~x - 1 <= 2147483647; {12210#(<= 0 (+ g_~x 85))} is VALID [2022-02-21 03:03:25,775 INFO L290 TraceCheckUtils]: 432: Hoare triple {12210#(<= 0 (+ g_~x 85))} assume ~x - 1 >= -2147483648; {12210#(<= 0 (+ g_~x 85))} is VALID [2022-02-21 03:03:25,775 INFO L272 TraceCheckUtils]: 433: Hoare triple {12210#(<= 0 (+ g_~x 85))} call #t~ret0 := g(~x - 1); {12211#(<= 0 (+ |g_#in~x| 86))} is VALID [2022-02-21 03:03:25,776 INFO L290 TraceCheckUtils]: 434: Hoare triple {12211#(<= 0 (+ |g_#in~x| 86))} ~x := #in~x; {12212#(<= 0 (+ g_~x 86))} is VALID [2022-02-21 03:03:25,776 INFO L290 TraceCheckUtils]: 435: Hoare triple {12212#(<= 0 (+ g_~x 86))} assume !(0 == ~x); {12212#(<= 0 (+ g_~x 86))} is VALID [2022-02-21 03:03:25,776 INFO L290 TraceCheckUtils]: 436: Hoare triple {12212#(<= 0 (+ g_~x 86))} assume ~x - 1 <= 2147483647; {12212#(<= 0 (+ g_~x 86))} is VALID [2022-02-21 03:03:25,777 INFO L290 TraceCheckUtils]: 437: Hoare triple {12212#(<= 0 (+ g_~x 86))} assume ~x - 1 >= -2147483648; {12212#(<= 0 (+ g_~x 86))} is VALID [2022-02-21 03:03:25,777 INFO L272 TraceCheckUtils]: 438: Hoare triple {12212#(<= 0 (+ g_~x 86))} call #t~ret0 := g(~x - 1); {12213#(<= 0 (+ 87 |g_#in~x|))} is VALID [2022-02-21 03:03:25,777 INFO L290 TraceCheckUtils]: 439: Hoare triple {12213#(<= 0 (+ 87 |g_#in~x|))} ~x := #in~x; {12214#(<= 0 (+ 87 g_~x))} is VALID [2022-02-21 03:03:25,778 INFO L290 TraceCheckUtils]: 440: Hoare triple {12214#(<= 0 (+ 87 g_~x))} assume !(0 == ~x); {12214#(<= 0 (+ 87 g_~x))} is VALID [2022-02-21 03:03:25,778 INFO L290 TraceCheckUtils]: 441: Hoare triple {12214#(<= 0 (+ 87 g_~x))} assume ~x - 1 <= 2147483647; {12214#(<= 0 (+ 87 g_~x))} is VALID [2022-02-21 03:03:25,778 INFO L290 TraceCheckUtils]: 442: Hoare triple {12214#(<= 0 (+ 87 g_~x))} assume ~x - 1 >= -2147483648; {12214#(<= 0 (+ 87 g_~x))} is VALID [2022-02-21 03:03:25,779 INFO L272 TraceCheckUtils]: 443: Hoare triple {12214#(<= 0 (+ 87 g_~x))} call #t~ret0 := g(~x - 1); {12215#(<= 0 (+ 88 |g_#in~x|))} is VALID [2022-02-21 03:03:25,779 INFO L290 TraceCheckUtils]: 444: Hoare triple {12215#(<= 0 (+ 88 |g_#in~x|))} ~x := #in~x; {12216#(<= 0 (+ 88 g_~x))} is VALID [2022-02-21 03:03:25,780 INFO L290 TraceCheckUtils]: 445: Hoare triple {12216#(<= 0 (+ 88 g_~x))} assume !(0 == ~x); {12216#(<= 0 (+ 88 g_~x))} is VALID [2022-02-21 03:03:25,780 INFO L290 TraceCheckUtils]: 446: Hoare triple {12216#(<= 0 (+ 88 g_~x))} assume ~x - 1 <= 2147483647; {12216#(<= 0 (+ 88 g_~x))} is VALID [2022-02-21 03:03:25,780 INFO L290 TraceCheckUtils]: 447: Hoare triple {12216#(<= 0 (+ 88 g_~x))} assume ~x - 1 >= -2147483648; {12216#(<= 0 (+ 88 g_~x))} is VALID [2022-02-21 03:03:25,781 INFO L272 TraceCheckUtils]: 448: Hoare triple {12216#(<= 0 (+ 88 g_~x))} call #t~ret0 := g(~x - 1); {12217#(<= 0 (+ |g_#in~x| 89))} is VALID [2022-02-21 03:03:25,781 INFO L290 TraceCheckUtils]: 449: Hoare triple {12217#(<= 0 (+ |g_#in~x| 89))} ~x := #in~x; {12218#(<= 0 (+ g_~x 89))} is VALID [2022-02-21 03:03:25,781 INFO L290 TraceCheckUtils]: 450: Hoare triple {12218#(<= 0 (+ g_~x 89))} assume !(0 == ~x); {12218#(<= 0 (+ g_~x 89))} is VALID [2022-02-21 03:03:25,782 INFO L290 TraceCheckUtils]: 451: Hoare triple {12218#(<= 0 (+ g_~x 89))} assume ~x - 1 <= 2147483647; {12218#(<= 0 (+ g_~x 89))} is VALID [2022-02-21 03:03:25,782 INFO L290 TraceCheckUtils]: 452: Hoare triple {12218#(<= 0 (+ g_~x 89))} assume ~x - 1 >= -2147483648; {12218#(<= 0 (+ g_~x 89))} is VALID [2022-02-21 03:03:25,782 INFO L272 TraceCheckUtils]: 453: Hoare triple {12218#(<= 0 (+ g_~x 89))} call #t~ret0 := g(~x - 1); {12219#(<= 0 (+ |g_#in~x| 90))} is VALID [2022-02-21 03:03:25,783 INFO L290 TraceCheckUtils]: 454: Hoare triple {12219#(<= 0 (+ |g_#in~x| 90))} ~x := #in~x; {12220#(<= 0 (+ g_~x 90))} is VALID [2022-02-21 03:03:25,783 INFO L290 TraceCheckUtils]: 455: Hoare triple {12220#(<= 0 (+ g_~x 90))} assume !(0 == ~x); {12220#(<= 0 (+ g_~x 90))} is VALID [2022-02-21 03:03:25,783 INFO L290 TraceCheckUtils]: 456: Hoare triple {12220#(<= 0 (+ g_~x 90))} assume ~x - 1 <= 2147483647; {12220#(<= 0 (+ g_~x 90))} is VALID [2022-02-21 03:03:25,784 INFO L290 TraceCheckUtils]: 457: Hoare triple {12220#(<= 0 (+ g_~x 90))} assume ~x - 1 >= -2147483648; {12220#(<= 0 (+ g_~x 90))} is VALID [2022-02-21 03:03:25,784 INFO L272 TraceCheckUtils]: 458: Hoare triple {12220#(<= 0 (+ g_~x 90))} call #t~ret0 := g(~x - 1); {12221#(<= 0 (+ 91 |g_#in~x|))} is VALID [2022-02-21 03:03:25,785 INFO L290 TraceCheckUtils]: 459: Hoare triple {12221#(<= 0 (+ 91 |g_#in~x|))} ~x := #in~x; {12222#(<= 0 (+ 91 g_~x))} is VALID [2022-02-21 03:03:25,785 INFO L290 TraceCheckUtils]: 460: Hoare triple {12222#(<= 0 (+ 91 g_~x))} assume !(0 == ~x); {12222#(<= 0 (+ 91 g_~x))} is VALID [2022-02-21 03:03:25,785 INFO L290 TraceCheckUtils]: 461: Hoare triple {12222#(<= 0 (+ 91 g_~x))} assume ~x - 1 <= 2147483647; {12222#(<= 0 (+ 91 g_~x))} is VALID [2022-02-21 03:03:25,785 INFO L290 TraceCheckUtils]: 462: Hoare triple {12222#(<= 0 (+ 91 g_~x))} assume ~x - 1 >= -2147483648; {12222#(<= 0 (+ 91 g_~x))} is VALID [2022-02-21 03:03:25,786 INFO L272 TraceCheckUtils]: 463: Hoare triple {12222#(<= 0 (+ 91 g_~x))} call #t~ret0 := g(~x - 1); {12223#(<= 0 (+ 92 |g_#in~x|))} is VALID [2022-02-21 03:03:25,786 INFO L290 TraceCheckUtils]: 464: Hoare triple {12223#(<= 0 (+ 92 |g_#in~x|))} ~x := #in~x; {12224#(<= 0 (+ 92 g_~x))} is VALID [2022-02-21 03:03:25,787 INFO L290 TraceCheckUtils]: 465: Hoare triple {12224#(<= 0 (+ 92 g_~x))} assume !(0 == ~x); {12224#(<= 0 (+ 92 g_~x))} is VALID [2022-02-21 03:03:25,787 INFO L290 TraceCheckUtils]: 466: Hoare triple {12224#(<= 0 (+ 92 g_~x))} assume ~x - 1 <= 2147483647; {12224#(<= 0 (+ 92 g_~x))} is VALID [2022-02-21 03:03:25,787 INFO L290 TraceCheckUtils]: 467: Hoare triple {12224#(<= 0 (+ 92 g_~x))} assume ~x - 1 >= -2147483648; {12224#(<= 0 (+ 92 g_~x))} is VALID [2022-02-21 03:03:25,788 INFO L272 TraceCheckUtils]: 468: Hoare triple {12224#(<= 0 (+ 92 g_~x))} call #t~ret0 := g(~x - 1); {12225#(<= 0 (+ |g_#in~x| 93))} is VALID [2022-02-21 03:03:25,788 INFO L290 TraceCheckUtils]: 469: Hoare triple {12225#(<= 0 (+ |g_#in~x| 93))} ~x := #in~x; {12226#(<= 0 (+ g_~x 93))} is VALID [2022-02-21 03:03:25,788 INFO L290 TraceCheckUtils]: 470: Hoare triple {12226#(<= 0 (+ g_~x 93))} assume !(0 == ~x); {12226#(<= 0 (+ g_~x 93))} is VALID [2022-02-21 03:03:25,789 INFO L290 TraceCheckUtils]: 471: Hoare triple {12226#(<= 0 (+ g_~x 93))} assume ~x - 1 <= 2147483647; {12226#(<= 0 (+ g_~x 93))} is VALID [2022-02-21 03:03:25,789 INFO L290 TraceCheckUtils]: 472: Hoare triple {12226#(<= 0 (+ g_~x 93))} assume ~x - 1 >= -2147483648; {12226#(<= 0 (+ g_~x 93))} is VALID [2022-02-21 03:03:25,789 INFO L272 TraceCheckUtils]: 473: Hoare triple {12226#(<= 0 (+ g_~x 93))} call #t~ret0 := g(~x - 1); {12227#(<= 0 (+ 94 |g_#in~x|))} is VALID [2022-02-21 03:03:25,790 INFO L290 TraceCheckUtils]: 474: Hoare triple {12227#(<= 0 (+ 94 |g_#in~x|))} ~x := #in~x; {12228#(<= 0 (+ 94 g_~x))} is VALID [2022-02-21 03:03:25,790 INFO L290 TraceCheckUtils]: 475: Hoare triple {12228#(<= 0 (+ 94 g_~x))} assume !(0 == ~x); {12228#(<= 0 (+ 94 g_~x))} is VALID [2022-02-21 03:03:25,790 INFO L290 TraceCheckUtils]: 476: Hoare triple {12228#(<= 0 (+ 94 g_~x))} assume ~x - 1 <= 2147483647; {12228#(<= 0 (+ 94 g_~x))} is VALID [2022-02-21 03:03:25,791 INFO L290 TraceCheckUtils]: 477: Hoare triple {12228#(<= 0 (+ 94 g_~x))} assume !(~x - 1 >= -2147483648); {12037#false} is VALID [2022-02-21 03:03:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 22231 backedges. 0 proven. 22231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:25,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:49,726 INFO L290 TraceCheckUtils]: 477: Hoare triple {13663#(<= 0 (+ 2147483647 g_~x))} assume !(~x - 1 >= -2147483648); {12037#false} is VALID [2022-02-21 03:03:49,726 INFO L290 TraceCheckUtils]: 476: Hoare triple {13663#(<= 0 (+ 2147483647 g_~x))} assume ~x - 1 <= 2147483647; {13663#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:03:49,726 INFO L290 TraceCheckUtils]: 475: Hoare triple {13663#(<= 0 (+ 2147483647 g_~x))} assume !(0 == ~x); {13663#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:03:49,727 INFO L290 TraceCheckUtils]: 474: Hoare triple {13673#(<= 0 (+ 2147483647 |g_#in~x|))} ~x := #in~x; {13663#(<= 0 (+ 2147483647 g_~x))} is VALID [2022-02-21 03:03:49,727 INFO L272 TraceCheckUtils]: 473: Hoare triple {13677#(<= 0 (+ g_~x 2147483646))} call #t~ret0 := g(~x - 1); {13673#(<= 0 (+ 2147483647 |g_#in~x|))} is VALID [2022-02-21 03:03:49,728 INFO L290 TraceCheckUtils]: 472: Hoare triple {13677#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 >= -2147483648; {13677#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:49,728 INFO L290 TraceCheckUtils]: 471: Hoare triple {13677#(<= 0 (+ g_~x 2147483646))} assume ~x - 1 <= 2147483647; {13677#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:49,728 INFO L290 TraceCheckUtils]: 470: Hoare triple {13677#(<= 0 (+ g_~x 2147483646))} assume !(0 == ~x); {13677#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:49,729 INFO L290 TraceCheckUtils]: 469: Hoare triple {13690#(<= 0 (+ |g_#in~x| 2147483646))} ~x := #in~x; {13677#(<= 0 (+ g_~x 2147483646))} is VALID [2022-02-21 03:03:49,729 INFO L272 TraceCheckUtils]: 468: Hoare triple {13694#(<= 0 (+ 2147483645 g_~x))} call #t~ret0 := g(~x - 1); {13690#(<= 0 (+ |g_#in~x| 2147483646))} is VALID [2022-02-21 03:03:49,729 INFO L290 TraceCheckUtils]: 467: Hoare triple {13694#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 >= -2147483648; {13694#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:49,729 INFO L290 TraceCheckUtils]: 466: Hoare triple {13694#(<= 0 (+ 2147483645 g_~x))} assume ~x - 1 <= 2147483647; {13694#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:49,730 INFO L290 TraceCheckUtils]: 465: Hoare triple {13694#(<= 0 (+ 2147483645 g_~x))} assume !(0 == ~x); {13694#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:49,730 INFO L290 TraceCheckUtils]: 464: Hoare triple {13707#(<= 0 (+ 2147483645 |g_#in~x|))} ~x := #in~x; {13694#(<= 0 (+ 2147483645 g_~x))} is VALID [2022-02-21 03:03:49,731 INFO L272 TraceCheckUtils]: 463: Hoare triple {13711#(<= 0 (+ g_~x 2147483644))} call #t~ret0 := g(~x - 1); {13707#(<= 0 (+ 2147483645 |g_#in~x|))} is VALID [2022-02-21 03:03:49,731 INFO L290 TraceCheckUtils]: 462: Hoare triple {13711#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 >= -2147483648; {13711#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:49,731 INFO L290 TraceCheckUtils]: 461: Hoare triple {13711#(<= 0 (+ g_~x 2147483644))} assume ~x - 1 <= 2147483647; {13711#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:49,731 INFO L290 TraceCheckUtils]: 460: Hoare triple {13711#(<= 0 (+ g_~x 2147483644))} assume !(0 == ~x); {13711#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:49,732 INFO L290 TraceCheckUtils]: 459: Hoare triple {13724#(<= 0 (+ |g_#in~x| 2147483644))} ~x := #in~x; {13711#(<= 0 (+ g_~x 2147483644))} is VALID [2022-02-21 03:03:49,732 INFO L272 TraceCheckUtils]: 458: Hoare triple {13728#(<= 0 (+ 2147483643 g_~x))} call #t~ret0 := g(~x - 1); {13724#(<= 0 (+ |g_#in~x| 2147483644))} is VALID [2022-02-21 03:03:49,732 INFO L290 TraceCheckUtils]: 457: Hoare triple {13728#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 >= -2147483648; {13728#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:49,733 INFO L290 TraceCheckUtils]: 456: Hoare triple {13728#(<= 0 (+ 2147483643 g_~x))} assume ~x - 1 <= 2147483647; {13728#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:49,733 INFO L290 TraceCheckUtils]: 455: Hoare triple {13728#(<= 0 (+ 2147483643 g_~x))} assume !(0 == ~x); {13728#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:49,733 INFO L290 TraceCheckUtils]: 454: Hoare triple {13741#(<= 0 (+ 2147483643 |g_#in~x|))} ~x := #in~x; {13728#(<= 0 (+ 2147483643 g_~x))} is VALID [2022-02-21 03:03:49,734 INFO L272 TraceCheckUtils]: 453: Hoare triple {13745#(<= 0 (+ g_~x 2147483642))} call #t~ret0 := g(~x - 1); {13741#(<= 0 (+ 2147483643 |g_#in~x|))} is VALID [2022-02-21 03:03:49,734 INFO L290 TraceCheckUtils]: 452: Hoare triple {13745#(<= 0 (+ g_~x 2147483642))} assume ~x - 1 >= -2147483648; {13745#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:03:49,734 INFO L290 TraceCheckUtils]: 451: Hoare triple {13745#(<= 0 (+ g_~x 2147483642))} assume ~x - 1 <= 2147483647; {13745#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:03:49,735 INFO L290 TraceCheckUtils]: 450: Hoare triple {13745#(<= 0 (+ g_~x 2147483642))} assume !(0 == ~x); {13745#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:03:49,735 INFO L290 TraceCheckUtils]: 449: Hoare triple {13758#(<= 0 (+ |g_#in~x| 2147483642))} ~x := #in~x; {13745#(<= 0 (+ g_~x 2147483642))} is VALID [2022-02-21 03:03:49,735 INFO L272 TraceCheckUtils]: 448: Hoare triple {13762#(<= 0 (+ g_~x 2147483641))} call #t~ret0 := g(~x - 1); {13758#(<= 0 (+ |g_#in~x| 2147483642))} is VALID [2022-02-21 03:03:49,736 INFO L290 TraceCheckUtils]: 447: Hoare triple {13762#(<= 0 (+ g_~x 2147483641))} assume ~x - 1 >= -2147483648; {13762#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:03:49,736 INFO L290 TraceCheckUtils]: 446: Hoare triple {13762#(<= 0 (+ g_~x 2147483641))} assume ~x - 1 <= 2147483647; {13762#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:03:49,736 INFO L290 TraceCheckUtils]: 445: Hoare triple {13762#(<= 0 (+ g_~x 2147483641))} assume !(0 == ~x); {13762#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:03:49,736 INFO L290 TraceCheckUtils]: 444: Hoare triple {13775#(<= 0 (+ |g_#in~x| 2147483641))} ~x := #in~x; {13762#(<= 0 (+ g_~x 2147483641))} is VALID [2022-02-21 03:03:49,737 INFO L272 TraceCheckUtils]: 443: Hoare triple {13779#(<= 0 (+ g_~x 2147483640))} call #t~ret0 := g(~x - 1); {13775#(<= 0 (+ |g_#in~x| 2147483641))} is VALID [2022-02-21 03:03:49,737 INFO L290 TraceCheckUtils]: 442: Hoare triple {13779#(<= 0 (+ g_~x 2147483640))} assume ~x - 1 >= -2147483648; {13779#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:03:49,737 INFO L290 TraceCheckUtils]: 441: Hoare triple {13779#(<= 0 (+ g_~x 2147483640))} assume ~x - 1 <= 2147483647; {13779#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:03:49,738 INFO L290 TraceCheckUtils]: 440: Hoare triple {13779#(<= 0 (+ g_~x 2147483640))} assume !(0 == ~x); {13779#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:03:49,738 INFO L290 TraceCheckUtils]: 439: Hoare triple {13792#(<= 0 (+ |g_#in~x| 2147483640))} ~x := #in~x; {13779#(<= 0 (+ g_~x 2147483640))} is VALID [2022-02-21 03:03:49,738 INFO L272 TraceCheckUtils]: 438: Hoare triple {13796#(<= 0 (+ g_~x 2147483639))} call #t~ret0 := g(~x - 1); {13792#(<= 0 (+ |g_#in~x| 2147483640))} is VALID [2022-02-21 03:03:49,739 INFO L290 TraceCheckUtils]: 437: Hoare triple {13796#(<= 0 (+ g_~x 2147483639))} assume ~x - 1 >= -2147483648; {13796#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:03:49,739 INFO L290 TraceCheckUtils]: 436: Hoare triple {13796#(<= 0 (+ g_~x 2147483639))} assume ~x - 1 <= 2147483647; {13796#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:03:49,744 INFO L290 TraceCheckUtils]: 435: Hoare triple {13796#(<= 0 (+ g_~x 2147483639))} assume !(0 == ~x); {13796#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:03:49,744 INFO L290 TraceCheckUtils]: 434: Hoare triple {13809#(<= 0 (+ |g_#in~x| 2147483639))} ~x := #in~x; {13796#(<= 0 (+ g_~x 2147483639))} is VALID [2022-02-21 03:03:49,745 INFO L272 TraceCheckUtils]: 433: Hoare triple {13813#(<= 0 (+ 2147483638 g_~x))} call #t~ret0 := g(~x - 1); {13809#(<= 0 (+ |g_#in~x| 2147483639))} is VALID [2022-02-21 03:03:49,745 INFO L290 TraceCheckUtils]: 432: Hoare triple {13813#(<= 0 (+ 2147483638 g_~x))} assume ~x - 1 >= -2147483648; {13813#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:03:49,746 INFO L290 TraceCheckUtils]: 431: Hoare triple {13813#(<= 0 (+ 2147483638 g_~x))} assume ~x - 1 <= 2147483647; {13813#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:03:49,746 INFO L290 TraceCheckUtils]: 430: Hoare triple {13813#(<= 0 (+ 2147483638 g_~x))} assume !(0 == ~x); {13813#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:03:49,746 INFO L290 TraceCheckUtils]: 429: Hoare triple {13826#(<= 0 (+ 2147483638 |g_#in~x|))} ~x := #in~x; {13813#(<= 0 (+ 2147483638 g_~x))} is VALID [2022-02-21 03:03:49,747 INFO L272 TraceCheckUtils]: 428: Hoare triple {13830#(<= 0 (+ g_~x 2147483637))} call #t~ret0 := g(~x - 1); {13826#(<= 0 (+ 2147483638 |g_#in~x|))} is VALID [2022-02-21 03:03:49,747 INFO L290 TraceCheckUtils]: 427: Hoare triple {13830#(<= 0 (+ g_~x 2147483637))} assume ~x - 1 >= -2147483648; {13830#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:03:49,747 INFO L290 TraceCheckUtils]: 426: Hoare triple {13830#(<= 0 (+ g_~x 2147483637))} assume ~x - 1 <= 2147483647; {13830#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:03:49,747 INFO L290 TraceCheckUtils]: 425: Hoare triple {13830#(<= 0 (+ g_~x 2147483637))} assume !(0 == ~x); {13830#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:03:49,748 INFO L290 TraceCheckUtils]: 424: Hoare triple {13843#(<= 0 (+ |g_#in~x| 2147483637))} ~x := #in~x; {13830#(<= 0 (+ g_~x 2147483637))} is VALID [2022-02-21 03:03:49,748 INFO L272 TraceCheckUtils]: 423: Hoare triple {13847#(<= 0 (+ g_~x 2147483636))} call #t~ret0 := g(~x - 1); {13843#(<= 0 (+ |g_#in~x| 2147483637))} is VALID [2022-02-21 03:03:49,749 INFO L290 TraceCheckUtils]: 422: Hoare triple {13847#(<= 0 (+ g_~x 2147483636))} assume ~x - 1 >= -2147483648; {13847#(<= 0 (+ g_~x 2147483636))} is VALID [2022-02-21 03:03:49,749 INFO L290 TraceCheckUtils]: 421: Hoare triple {13847#(<= 0 (+ g_~x 2147483636))} assume ~x - 1 <= 2147483647; {13847#(<= 0 (+ g_~x 2147483636))} is VALID [2022-02-21 03:03:49,749 INFO L290 TraceCheckUtils]: 420: Hoare triple {13847#(<= 0 (+ g_~x 2147483636))} assume !(0 == ~x); {13847#(<= 0 (+ g_~x 2147483636))} is VALID [2022-02-21 03:03:49,749 INFO L290 TraceCheckUtils]: 419: Hoare triple {13860#(<= 0 (+ |g_#in~x| 2147483636))} ~x := #in~x; {13847#(<= 0 (+ g_~x 2147483636))} is VALID [2022-02-21 03:03:49,750 INFO L272 TraceCheckUtils]: 418: Hoare triple {13864#(<= 0 (+ g_~x 2147483635))} call #t~ret0 := g(~x - 1); {13860#(<= 0 (+ |g_#in~x| 2147483636))} is VALID [2022-02-21 03:03:49,750 INFO L290 TraceCheckUtils]: 417: Hoare triple {13864#(<= 0 (+ g_~x 2147483635))} assume ~x - 1 >= -2147483648; {13864#(<= 0 (+ g_~x 2147483635))} is VALID [2022-02-21 03:03:49,750 INFO L290 TraceCheckUtils]: 416: Hoare triple {13864#(<= 0 (+ g_~x 2147483635))} assume ~x - 1 <= 2147483647; {13864#(<= 0 (+ g_~x 2147483635))} is VALID [2022-02-21 03:03:49,751 INFO L290 TraceCheckUtils]: 415: Hoare triple {13864#(<= 0 (+ g_~x 2147483635))} assume !(0 == ~x); {13864#(<= 0 (+ g_~x 2147483635))} is VALID [2022-02-21 03:03:49,751 INFO L290 TraceCheckUtils]: 414: Hoare triple {13877#(<= 0 (+ |g_#in~x| 2147483635))} ~x := #in~x; {13864#(<= 0 (+ g_~x 2147483635))} is VALID [2022-02-21 03:03:49,751 INFO L272 TraceCheckUtils]: 413: Hoare triple {13881#(<= 0 (+ g_~x 2147483634))} call #t~ret0 := g(~x - 1); {13877#(<= 0 (+ |g_#in~x| 2147483635))} is VALID [2022-02-21 03:03:49,752 INFO L290 TraceCheckUtils]: 412: Hoare triple {13881#(<= 0 (+ g_~x 2147483634))} assume ~x - 1 >= -2147483648; {13881#(<= 0 (+ g_~x 2147483634))} is VALID [2022-02-21 03:03:49,752 INFO L290 TraceCheckUtils]: 411: Hoare triple {13881#(<= 0 (+ g_~x 2147483634))} assume ~x - 1 <= 2147483647; {13881#(<= 0 (+ g_~x 2147483634))} is VALID [2022-02-21 03:03:49,752 INFO L290 TraceCheckUtils]: 410: Hoare triple {13881#(<= 0 (+ g_~x 2147483634))} assume !(0 == ~x); {13881#(<= 0 (+ g_~x 2147483634))} is VALID [2022-02-21 03:03:49,753 INFO L290 TraceCheckUtils]: 409: Hoare triple {13894#(<= 0 (+ |g_#in~x| 2147483634))} ~x := #in~x; {13881#(<= 0 (+ g_~x 2147483634))} is VALID [2022-02-21 03:03:49,753 INFO L272 TraceCheckUtils]: 408: Hoare triple {13898#(<= 0 (+ g_~x 2147483633))} call #t~ret0 := g(~x - 1); {13894#(<= 0 (+ |g_#in~x| 2147483634))} is VALID [2022-02-21 03:03:49,753 INFO L290 TraceCheckUtils]: 407: Hoare triple {13898#(<= 0 (+ g_~x 2147483633))} assume ~x - 1 >= -2147483648; {13898#(<= 0 (+ g_~x 2147483633))} is VALID [2022-02-21 03:03:49,754 INFO L290 TraceCheckUtils]: 406: Hoare triple {13898#(<= 0 (+ g_~x 2147483633))} assume ~x - 1 <= 2147483647; {13898#(<= 0 (+ g_~x 2147483633))} is VALID [2022-02-21 03:03:49,754 INFO L290 TraceCheckUtils]: 405: Hoare triple {13898#(<= 0 (+ g_~x 2147483633))} assume !(0 == ~x); {13898#(<= 0 (+ g_~x 2147483633))} is VALID [2022-02-21 03:03:49,754 INFO L290 TraceCheckUtils]: 404: Hoare triple {13911#(<= 0 (+ |g_#in~x| 2147483633))} ~x := #in~x; {13898#(<= 0 (+ g_~x 2147483633))} is VALID [2022-02-21 03:03:49,755 INFO L272 TraceCheckUtils]: 403: Hoare triple {13915#(<= 0 (+ 2147483632 g_~x))} call #t~ret0 := g(~x - 1); {13911#(<= 0 (+ |g_#in~x| 2147483633))} is VALID [2022-02-21 03:03:49,755 INFO L290 TraceCheckUtils]: 402: Hoare triple {13915#(<= 0 (+ 2147483632 g_~x))} assume ~x - 1 >= -2147483648; {13915#(<= 0 (+ 2147483632 g_~x))} is VALID [2022-02-21 03:03:49,755 INFO L290 TraceCheckUtils]: 401: Hoare triple {13915#(<= 0 (+ 2147483632 g_~x))} assume ~x - 1 <= 2147483647; {13915#(<= 0 (+ 2147483632 g_~x))} is VALID [2022-02-21 03:03:49,756 INFO L290 TraceCheckUtils]: 400: Hoare triple {13915#(<= 0 (+ 2147483632 g_~x))} assume !(0 == ~x); {13915#(<= 0 (+ 2147483632 g_~x))} is VALID [2022-02-21 03:03:49,756 INFO L290 TraceCheckUtils]: 399: Hoare triple {13928#(<= 0 (+ 2147483632 |g_#in~x|))} ~x := #in~x; {13915#(<= 0 (+ 2147483632 g_~x))} is VALID [2022-02-21 03:03:49,756 INFO L272 TraceCheckUtils]: 398: Hoare triple {13932#(<= 0 (+ g_~x 2147483631))} call #t~ret0 := g(~x - 1); {13928#(<= 0 (+ 2147483632 |g_#in~x|))} is VALID [2022-02-21 03:03:49,757 INFO L290 TraceCheckUtils]: 397: Hoare triple {13932#(<= 0 (+ g_~x 2147483631))} assume ~x - 1 >= -2147483648; {13932#(<= 0 (+ g_~x 2147483631))} is VALID [2022-02-21 03:03:49,757 INFO L290 TraceCheckUtils]: 396: Hoare triple {13932#(<= 0 (+ g_~x 2147483631))} assume ~x - 1 <= 2147483647; {13932#(<= 0 (+ g_~x 2147483631))} is VALID [2022-02-21 03:03:49,757 INFO L290 TraceCheckUtils]: 395: Hoare triple {13932#(<= 0 (+ g_~x 2147483631))} assume !(0 == ~x); {13932#(<= 0 (+ g_~x 2147483631))} is VALID [2022-02-21 03:03:49,757 INFO L290 TraceCheckUtils]: 394: Hoare triple {13945#(<= 0 (+ |g_#in~x| 2147483631))} ~x := #in~x; {13932#(<= 0 (+ g_~x 2147483631))} is VALID [2022-02-21 03:03:49,758 INFO L272 TraceCheckUtils]: 393: Hoare triple {13949#(<= 0 (+ g_~x 2147483630))} call #t~ret0 := g(~x - 1); {13945#(<= 0 (+ |g_#in~x| 2147483631))} is VALID [2022-02-21 03:03:49,758 INFO L290 TraceCheckUtils]: 392: Hoare triple {13949#(<= 0 (+ g_~x 2147483630))} assume ~x - 1 >= -2147483648; {13949#(<= 0 (+ g_~x 2147483630))} is VALID [2022-02-21 03:03:49,758 INFO L290 TraceCheckUtils]: 391: Hoare triple {13949#(<= 0 (+ g_~x 2147483630))} assume ~x - 1 <= 2147483647; {13949#(<= 0 (+ g_~x 2147483630))} is VALID [2022-02-21 03:03:49,759 INFO L290 TraceCheckUtils]: 390: Hoare triple {13949#(<= 0 (+ g_~x 2147483630))} assume !(0 == ~x); {13949#(<= 0 (+ g_~x 2147483630))} is VALID [2022-02-21 03:03:49,759 INFO L290 TraceCheckUtils]: 389: Hoare triple {13962#(<= 0 (+ |g_#in~x| 2147483630))} ~x := #in~x; {13949#(<= 0 (+ g_~x 2147483630))} is VALID [2022-02-21 03:03:49,760 INFO L272 TraceCheckUtils]: 388: Hoare triple {13966#(<= 0 (+ g_~x 2147483629))} call #t~ret0 := g(~x - 1); {13962#(<= 0 (+ |g_#in~x| 2147483630))} is VALID [2022-02-21 03:03:49,760 INFO L290 TraceCheckUtils]: 387: Hoare triple {13966#(<= 0 (+ g_~x 2147483629))} assume ~x - 1 >= -2147483648; {13966#(<= 0 (+ g_~x 2147483629))} is VALID [2022-02-21 03:03:49,760 INFO L290 TraceCheckUtils]: 386: Hoare triple {13966#(<= 0 (+ g_~x 2147483629))} assume ~x - 1 <= 2147483647; {13966#(<= 0 (+ g_~x 2147483629))} is VALID [2022-02-21 03:03:49,760 INFO L290 TraceCheckUtils]: 385: Hoare triple {13966#(<= 0 (+ g_~x 2147483629))} assume !(0 == ~x); {13966#(<= 0 (+ g_~x 2147483629))} is VALID [2022-02-21 03:03:49,761 INFO L290 TraceCheckUtils]: 384: Hoare triple {13979#(<= 0 (+ |g_#in~x| 2147483629))} ~x := #in~x; {13966#(<= 0 (+ g_~x 2147483629))} is VALID [2022-02-21 03:03:49,761 INFO L272 TraceCheckUtils]: 383: Hoare triple {13983#(<= 0 (+ g_~x 2147483628))} call #t~ret0 := g(~x - 1); {13979#(<= 0 (+ |g_#in~x| 2147483629))} is VALID [2022-02-21 03:03:49,761 INFO L290 TraceCheckUtils]: 382: Hoare triple {13983#(<= 0 (+ g_~x 2147483628))} assume ~x - 1 >= -2147483648; {13983#(<= 0 (+ g_~x 2147483628))} is VALID [2022-02-21 03:03:49,762 INFO L290 TraceCheckUtils]: 381: Hoare triple {13983#(<= 0 (+ g_~x 2147483628))} assume ~x - 1 <= 2147483647; {13983#(<= 0 (+ g_~x 2147483628))} is VALID [2022-02-21 03:03:49,762 INFO L290 TraceCheckUtils]: 380: Hoare triple {13983#(<= 0 (+ g_~x 2147483628))} assume !(0 == ~x); {13983#(<= 0 (+ g_~x 2147483628))} is VALID [2022-02-21 03:03:49,762 INFO L290 TraceCheckUtils]: 379: Hoare triple {13996#(<= 0 (+ |g_#in~x| 2147483628))} ~x := #in~x; {13983#(<= 0 (+ g_~x 2147483628))} is VALID [2022-02-21 03:03:49,763 INFO L272 TraceCheckUtils]: 378: Hoare triple {14000#(<= 0 (+ g_~x 2147483627))} call #t~ret0 := g(~x - 1); {13996#(<= 0 (+ |g_#in~x| 2147483628))} is VALID [2022-02-21 03:03:49,763 INFO L290 TraceCheckUtils]: 377: Hoare triple {14000#(<= 0 (+ g_~x 2147483627))} assume ~x - 1 >= -2147483648; {14000#(<= 0 (+ g_~x 2147483627))} is VALID [2022-02-21 03:03:49,763 INFO L290 TraceCheckUtils]: 376: Hoare triple {14000#(<= 0 (+ g_~x 2147483627))} assume ~x - 1 <= 2147483647; {14000#(<= 0 (+ g_~x 2147483627))} is VALID [2022-02-21 03:03:49,763 INFO L290 TraceCheckUtils]: 375: Hoare triple {14000#(<= 0 (+ g_~x 2147483627))} assume !(0 == ~x); {14000#(<= 0 (+ g_~x 2147483627))} is VALID [2022-02-21 03:03:49,764 INFO L290 TraceCheckUtils]: 374: Hoare triple {14013#(<= 0 (+ |g_#in~x| 2147483627))} ~x := #in~x; {14000#(<= 0 (+ g_~x 2147483627))} is VALID [2022-02-21 03:03:49,764 INFO L272 TraceCheckUtils]: 373: Hoare triple {14017#(<= 0 (+ 2147483626 g_~x))} call #t~ret0 := g(~x - 1); {14013#(<= 0 (+ |g_#in~x| 2147483627))} is VALID [2022-02-21 03:03:49,765 INFO L290 TraceCheckUtils]: 372: Hoare triple {14017#(<= 0 (+ 2147483626 g_~x))} assume ~x - 1 >= -2147483648; {14017#(<= 0 (+ 2147483626 g_~x))} is VALID [2022-02-21 03:03:49,765 INFO L290 TraceCheckUtils]: 371: Hoare triple {14017#(<= 0 (+ 2147483626 g_~x))} assume ~x - 1 <= 2147483647; {14017#(<= 0 (+ 2147483626 g_~x))} is VALID [2022-02-21 03:03:49,765 INFO L290 TraceCheckUtils]: 370: Hoare triple {14017#(<= 0 (+ 2147483626 g_~x))} assume !(0 == ~x); {14017#(<= 0 (+ 2147483626 g_~x))} is VALID [2022-02-21 03:03:49,765 INFO L290 TraceCheckUtils]: 369: Hoare triple {14030#(<= 0 (+ 2147483626 |g_#in~x|))} ~x := #in~x; {14017#(<= 0 (+ 2147483626 g_~x))} is VALID [2022-02-21 03:03:49,767 INFO L272 TraceCheckUtils]: 368: Hoare triple {14034#(<= 0 (+ 2147483625 g_~x))} call #t~ret0 := g(~x - 1); {14030#(<= 0 (+ 2147483626 |g_#in~x|))} is VALID [2022-02-21 03:03:49,767 INFO L290 TraceCheckUtils]: 367: Hoare triple {14034#(<= 0 (+ 2147483625 g_~x))} assume ~x - 1 >= -2147483648; {14034#(<= 0 (+ 2147483625 g_~x))} is VALID [2022-02-21 03:03:49,768 INFO L290 TraceCheckUtils]: 366: Hoare triple {14034#(<= 0 (+ 2147483625 g_~x))} assume ~x - 1 <= 2147483647; {14034#(<= 0 (+ 2147483625 g_~x))} is VALID [2022-02-21 03:03:49,768 INFO L290 TraceCheckUtils]: 365: Hoare triple {14034#(<= 0 (+ 2147483625 g_~x))} assume !(0 == ~x); {14034#(<= 0 (+ 2147483625 g_~x))} is VALID [2022-02-21 03:03:49,769 INFO L290 TraceCheckUtils]: 364: Hoare triple {14047#(<= 0 (+ 2147483625 |g_#in~x|))} ~x := #in~x; {14034#(<= 0 (+ 2147483625 g_~x))} is VALID [2022-02-21 03:03:49,769 INFO L272 TraceCheckUtils]: 363: Hoare triple {14051#(<= 0 (+ 2147483624 g_~x))} call #t~ret0 := g(~x - 1); {14047#(<= 0 (+ 2147483625 |g_#in~x|))} is VALID [2022-02-21 03:03:49,769 INFO L290 TraceCheckUtils]: 362: Hoare triple {14051#(<= 0 (+ 2147483624 g_~x))} assume ~x - 1 >= -2147483648; {14051#(<= 0 (+ 2147483624 g_~x))} is VALID [2022-02-21 03:03:49,770 INFO L290 TraceCheckUtils]: 361: Hoare triple {14051#(<= 0 (+ 2147483624 g_~x))} assume ~x - 1 <= 2147483647; {14051#(<= 0 (+ 2147483624 g_~x))} is VALID [2022-02-21 03:03:49,771 INFO L290 TraceCheckUtils]: 360: Hoare triple {14051#(<= 0 (+ 2147483624 g_~x))} assume !(0 == ~x); {14051#(<= 0 (+ 2147483624 g_~x))} is VALID [2022-02-21 03:03:49,771 INFO L290 TraceCheckUtils]: 359: Hoare triple {14064#(<= 0 (+ 2147483624 |g_#in~x|))} ~x := #in~x; {14051#(<= 0 (+ 2147483624 g_~x))} is VALID [2022-02-21 03:03:49,771 INFO L272 TraceCheckUtils]: 358: Hoare triple {14068#(<= 0 (+ 2147483623 g_~x))} call #t~ret0 := g(~x - 1); {14064#(<= 0 (+ 2147483624 |g_#in~x|))} is VALID [2022-02-21 03:03:49,772 INFO L290 TraceCheckUtils]: 357: Hoare triple {14068#(<= 0 (+ 2147483623 g_~x))} assume ~x - 1 >= -2147483648; {14068#(<= 0 (+ 2147483623 g_~x))} is VALID [2022-02-21 03:03:49,772 INFO L290 TraceCheckUtils]: 356: Hoare triple {14068#(<= 0 (+ 2147483623 g_~x))} assume ~x - 1 <= 2147483647; {14068#(<= 0 (+ 2147483623 g_~x))} is VALID [2022-02-21 03:03:49,772 INFO L290 TraceCheckUtils]: 355: Hoare triple {14068#(<= 0 (+ 2147483623 g_~x))} assume !(0 == ~x); {14068#(<= 0 (+ 2147483623 g_~x))} is VALID [2022-02-21 03:03:49,773 INFO L290 TraceCheckUtils]: 354: Hoare triple {14081#(<= 0 (+ |g_#in~x| 2147483623))} ~x := #in~x; {14068#(<= 0 (+ 2147483623 g_~x))} is VALID [2022-02-21 03:03:49,773 INFO L272 TraceCheckUtils]: 353: Hoare triple {14085#(<= 0 (+ g_~x 2147483622))} call #t~ret0 := g(~x - 1); {14081#(<= 0 (+ |g_#in~x| 2147483623))} is VALID [2022-02-21 03:03:49,773 INFO L290 TraceCheckUtils]: 352: Hoare triple {14085#(<= 0 (+ g_~x 2147483622))} assume ~x - 1 >= -2147483648; {14085#(<= 0 (+ g_~x 2147483622))} is VALID [2022-02-21 03:03:49,774 INFO L290 TraceCheckUtils]: 351: Hoare triple {14085#(<= 0 (+ g_~x 2147483622))} assume ~x - 1 <= 2147483647; {14085#(<= 0 (+ g_~x 2147483622))} is VALID [2022-02-21 03:03:49,774 INFO L290 TraceCheckUtils]: 350: Hoare triple {14085#(<= 0 (+ g_~x 2147483622))} assume !(0 == ~x); {14085#(<= 0 (+ g_~x 2147483622))} is VALID [2022-02-21 03:03:49,774 INFO L290 TraceCheckUtils]: 349: Hoare triple {14098#(<= 0 (+ |g_#in~x| 2147483622))} ~x := #in~x; {14085#(<= 0 (+ g_~x 2147483622))} is VALID [2022-02-21 03:03:49,775 INFO L272 TraceCheckUtils]: 348: Hoare triple {14102#(<= 0 (+ 2147483621 g_~x))} call #t~ret0 := g(~x - 1); {14098#(<= 0 (+ |g_#in~x| 2147483622))} is VALID [2022-02-21 03:03:49,775 INFO L290 TraceCheckUtils]: 347: Hoare triple {14102#(<= 0 (+ 2147483621 g_~x))} assume ~x - 1 >= -2147483648; {14102#(<= 0 (+ 2147483621 g_~x))} is VALID [2022-02-21 03:03:49,775 INFO L290 TraceCheckUtils]: 346: Hoare triple {14102#(<= 0 (+ 2147483621 g_~x))} assume ~x - 1 <= 2147483647; {14102#(<= 0 (+ 2147483621 g_~x))} is VALID [2022-02-21 03:03:49,776 INFO L290 TraceCheckUtils]: 345: Hoare triple {14102#(<= 0 (+ 2147483621 g_~x))} assume !(0 == ~x); {14102#(<= 0 (+ 2147483621 g_~x))} is VALID [2022-02-21 03:03:49,776 INFO L290 TraceCheckUtils]: 344: Hoare triple {14115#(<= 0 (+ 2147483621 |g_#in~x|))} ~x := #in~x; {14102#(<= 0 (+ 2147483621 g_~x))} is VALID [2022-02-21 03:03:49,776 INFO L272 TraceCheckUtils]: 343: Hoare triple {14119#(<= 0 (+ g_~x 2147483620))} call #t~ret0 := g(~x - 1); {14115#(<= 0 (+ 2147483621 |g_#in~x|))} is VALID [2022-02-21 03:03:49,777 INFO L290 TraceCheckUtils]: 342: Hoare triple {14119#(<= 0 (+ g_~x 2147483620))} assume ~x - 1 >= -2147483648; {14119#(<= 0 (+ g_~x 2147483620))} is VALID [2022-02-21 03:03:49,777 INFO L290 TraceCheckUtils]: 341: Hoare triple {14119#(<= 0 (+ g_~x 2147483620))} assume ~x - 1 <= 2147483647; {14119#(<= 0 (+ g_~x 2147483620))} is VALID [2022-02-21 03:03:49,777 INFO L290 TraceCheckUtils]: 340: Hoare triple {14119#(<= 0 (+ g_~x 2147483620))} assume !(0 == ~x); {14119#(<= 0 (+ g_~x 2147483620))} is VALID [2022-02-21 03:03:49,777 INFO L290 TraceCheckUtils]: 339: Hoare triple {14132#(<= 0 (+ |g_#in~x| 2147483620))} ~x := #in~x; {14119#(<= 0 (+ g_~x 2147483620))} is VALID [2022-02-21 03:03:49,778 INFO L272 TraceCheckUtils]: 338: Hoare triple {14136#(<= 0 (+ g_~x 2147483619))} call #t~ret0 := g(~x - 1); {14132#(<= 0 (+ |g_#in~x| 2147483620))} is VALID [2022-02-21 03:03:49,778 INFO L290 TraceCheckUtils]: 337: Hoare triple {14136#(<= 0 (+ g_~x 2147483619))} assume ~x - 1 >= -2147483648; {14136#(<= 0 (+ g_~x 2147483619))} is VALID [2022-02-21 03:03:49,778 INFO L290 TraceCheckUtils]: 336: Hoare triple {14136#(<= 0 (+ g_~x 2147483619))} assume ~x - 1 <= 2147483647; {14136#(<= 0 (+ g_~x 2147483619))} is VALID [2022-02-21 03:03:49,779 INFO L290 TraceCheckUtils]: 335: Hoare triple {14136#(<= 0 (+ g_~x 2147483619))} assume !(0 == ~x); {14136#(<= 0 (+ g_~x 2147483619))} is VALID [2022-02-21 03:03:49,779 INFO L290 TraceCheckUtils]: 334: Hoare triple {14149#(<= 0 (+ |g_#in~x| 2147483619))} ~x := #in~x; {14136#(<= 0 (+ g_~x 2147483619))} is VALID [2022-02-21 03:03:49,780 INFO L272 TraceCheckUtils]: 333: Hoare triple {14153#(<= 0 (+ 2147483618 g_~x))} call #t~ret0 := g(~x - 1); {14149#(<= 0 (+ |g_#in~x| 2147483619))} is VALID [2022-02-21 03:03:49,780 INFO L290 TraceCheckUtils]: 332: Hoare triple {14153#(<= 0 (+ 2147483618 g_~x))} assume ~x - 1 >= -2147483648; {14153#(<= 0 (+ 2147483618 g_~x))} is VALID [2022-02-21 03:03:49,780 INFO L290 TraceCheckUtils]: 331: Hoare triple {14153#(<= 0 (+ 2147483618 g_~x))} assume ~x - 1 <= 2147483647; {14153#(<= 0 (+ 2147483618 g_~x))} is VALID [2022-02-21 03:03:49,780 INFO L290 TraceCheckUtils]: 330: Hoare triple {14153#(<= 0 (+ 2147483618 g_~x))} assume !(0 == ~x); {14153#(<= 0 (+ 2147483618 g_~x))} is VALID [2022-02-21 03:03:49,781 INFO L290 TraceCheckUtils]: 329: Hoare triple {14166#(<= 0 (+ 2147483618 |g_#in~x|))} ~x := #in~x; {14153#(<= 0 (+ 2147483618 g_~x))} is VALID [2022-02-21 03:03:49,781 INFO L272 TraceCheckUtils]: 328: Hoare triple {14170#(<= 0 (+ 2147483617 g_~x))} call #t~ret0 := g(~x - 1); {14166#(<= 0 (+ 2147483618 |g_#in~x|))} is VALID [2022-02-21 03:03:49,781 INFO L290 TraceCheckUtils]: 327: Hoare triple {14170#(<= 0 (+ 2147483617 g_~x))} assume ~x - 1 >= -2147483648; {14170#(<= 0 (+ 2147483617 g_~x))} is VALID [2022-02-21 03:03:49,782 INFO L290 TraceCheckUtils]: 326: Hoare triple {14170#(<= 0 (+ 2147483617 g_~x))} assume ~x - 1 <= 2147483647; {14170#(<= 0 (+ 2147483617 g_~x))} is VALID [2022-02-21 03:03:49,782 INFO L290 TraceCheckUtils]: 325: Hoare triple {14170#(<= 0 (+ 2147483617 g_~x))} assume !(0 == ~x); {14170#(<= 0 (+ 2147483617 g_~x))} is VALID [2022-02-21 03:03:49,782 INFO L290 TraceCheckUtils]: 324: Hoare triple {14183#(<= 0 (+ 2147483617 |g_#in~x|))} ~x := #in~x; {14170#(<= 0 (+ 2147483617 g_~x))} is VALID [2022-02-21 03:03:49,783 INFO L272 TraceCheckUtils]: 323: Hoare triple {14187#(<= 0 (+ g_~x 2147483616))} call #t~ret0 := g(~x - 1); {14183#(<= 0 (+ 2147483617 |g_#in~x|))} is VALID [2022-02-21 03:03:49,783 INFO L290 TraceCheckUtils]: 322: Hoare triple {14187#(<= 0 (+ g_~x 2147483616))} assume ~x - 1 >= -2147483648; {14187#(<= 0 (+ g_~x 2147483616))} is VALID [2022-02-21 03:03:49,783 INFO L290 TraceCheckUtils]: 321: Hoare triple {14187#(<= 0 (+ g_~x 2147483616))} assume ~x - 1 <= 2147483647; {14187#(<= 0 (+ g_~x 2147483616))} is VALID [2022-02-21 03:03:49,784 INFO L290 TraceCheckUtils]: 320: Hoare triple {14187#(<= 0 (+ g_~x 2147483616))} assume !(0 == ~x); {14187#(<= 0 (+ g_~x 2147483616))} is VALID [2022-02-21 03:03:49,784 INFO L290 TraceCheckUtils]: 319: Hoare triple {14200#(<= 0 (+ |g_#in~x| 2147483616))} ~x := #in~x; {14187#(<= 0 (+ g_~x 2147483616))} is VALID [2022-02-21 03:03:49,784 INFO L272 TraceCheckUtils]: 318: Hoare triple {14204#(<= 0 (+ g_~x 2147483615))} call #t~ret0 := g(~x - 1); {14200#(<= 0 (+ |g_#in~x| 2147483616))} is VALID [2022-02-21 03:03:49,785 INFO L290 TraceCheckUtils]: 317: Hoare triple {14204#(<= 0 (+ g_~x 2147483615))} assume ~x - 1 >= -2147483648; {14204#(<= 0 (+ g_~x 2147483615))} is VALID [2022-02-21 03:03:49,785 INFO L290 TraceCheckUtils]: 316: Hoare triple {14204#(<= 0 (+ g_~x 2147483615))} assume ~x - 1 <= 2147483647; {14204#(<= 0 (+ g_~x 2147483615))} is VALID [2022-02-21 03:03:49,785 INFO L290 TraceCheckUtils]: 315: Hoare triple {14204#(<= 0 (+ g_~x 2147483615))} assume !(0 == ~x); {14204#(<= 0 (+ g_~x 2147483615))} is VALID [2022-02-21 03:03:49,785 INFO L290 TraceCheckUtils]: 314: Hoare triple {14217#(<= 0 (+ |g_#in~x| 2147483615))} ~x := #in~x; {14204#(<= 0 (+ g_~x 2147483615))} is VALID [2022-02-21 03:03:49,786 INFO L272 TraceCheckUtils]: 313: Hoare triple {14221#(<= 0 (+ g_~x 2147483614))} call #t~ret0 := g(~x - 1); {14217#(<= 0 (+ |g_#in~x| 2147483615))} is VALID [2022-02-21 03:03:49,786 INFO L290 TraceCheckUtils]: 312: Hoare triple {14221#(<= 0 (+ g_~x 2147483614))} assume ~x - 1 >= -2147483648; {14221#(<= 0 (+ g_~x 2147483614))} is VALID [2022-02-21 03:03:49,786 INFO L290 TraceCheckUtils]: 311: Hoare triple {14221#(<= 0 (+ g_~x 2147483614))} assume ~x - 1 <= 2147483647; {14221#(<= 0 (+ g_~x 2147483614))} is VALID [2022-02-21 03:03:49,787 INFO L290 TraceCheckUtils]: 310: Hoare triple {14221#(<= 0 (+ g_~x 2147483614))} assume !(0 == ~x); {14221#(<= 0 (+ g_~x 2147483614))} is VALID [2022-02-21 03:03:49,787 INFO L290 TraceCheckUtils]: 309: Hoare triple {14234#(<= 0 (+ |g_#in~x| 2147483614))} ~x := #in~x; {14221#(<= 0 (+ g_~x 2147483614))} is VALID [2022-02-21 03:03:49,787 INFO L272 TraceCheckUtils]: 308: Hoare triple {14238#(<= 0 (+ 2147483613 g_~x))} call #t~ret0 := g(~x - 1); {14234#(<= 0 (+ |g_#in~x| 2147483614))} is VALID [2022-02-21 03:03:49,788 INFO L290 TraceCheckUtils]: 307: Hoare triple {14238#(<= 0 (+ 2147483613 g_~x))} assume ~x - 1 >= -2147483648; {14238#(<= 0 (+ 2147483613 g_~x))} is VALID [2022-02-21 03:03:49,788 INFO L290 TraceCheckUtils]: 306: Hoare triple {14238#(<= 0 (+ 2147483613 g_~x))} assume ~x - 1 <= 2147483647; {14238#(<= 0 (+ 2147483613 g_~x))} is VALID [2022-02-21 03:03:49,788 INFO L290 TraceCheckUtils]: 305: Hoare triple {14238#(<= 0 (+ 2147483613 g_~x))} assume !(0 == ~x); {14238#(<= 0 (+ 2147483613 g_~x))} is VALID [2022-02-21 03:03:49,789 INFO L290 TraceCheckUtils]: 304: Hoare triple {14251#(<= 0 (+ |g_#in~x| 2147483613))} ~x := #in~x; {14238#(<= 0 (+ 2147483613 g_~x))} is VALID [2022-02-21 03:03:49,789 INFO L272 TraceCheckUtils]: 303: Hoare triple {14255#(<= 0 (+ 2147483612 g_~x))} call #t~ret0 := g(~x - 1); {14251#(<= 0 (+ |g_#in~x| 2147483613))} is VALID [2022-02-21 03:03:49,789 INFO L290 TraceCheckUtils]: 302: Hoare triple {14255#(<= 0 (+ 2147483612 g_~x))} assume ~x - 1 >= -2147483648; {14255#(<= 0 (+ 2147483612 g_~x))} is VALID [2022-02-21 03:03:49,790 INFO L290 TraceCheckUtils]: 301: Hoare triple {14255#(<= 0 (+ 2147483612 g_~x))} assume ~x - 1 <= 2147483647; {14255#(<= 0 (+ 2147483612 g_~x))} is VALID [2022-02-21 03:03:49,790 INFO L290 TraceCheckUtils]: 300: Hoare triple {14255#(<= 0 (+ 2147483612 g_~x))} assume !(0 == ~x); {14255#(<= 0 (+ 2147483612 g_~x))} is VALID [2022-02-21 03:03:49,790 INFO L290 TraceCheckUtils]: 299: Hoare triple {14268#(<= 0 (+ 2147483612 |g_#in~x|))} ~x := #in~x; {14255#(<= 0 (+ 2147483612 g_~x))} is VALID [2022-02-21 03:03:49,791 INFO L272 TraceCheckUtils]: 298: Hoare triple {14272#(<= 0 (+ 2147483611 g_~x))} call #t~ret0 := g(~x - 1); {14268#(<= 0 (+ 2147483612 |g_#in~x|))} is VALID [2022-02-21 03:03:49,791 INFO L290 TraceCheckUtils]: 297: Hoare triple {14272#(<= 0 (+ 2147483611 g_~x))} assume ~x - 1 >= -2147483648; {14272#(<= 0 (+ 2147483611 g_~x))} is VALID [2022-02-21 03:03:49,791 INFO L290 TraceCheckUtils]: 296: Hoare triple {14272#(<= 0 (+ 2147483611 g_~x))} assume ~x - 1 <= 2147483647; {14272#(<= 0 (+ 2147483611 g_~x))} is VALID [2022-02-21 03:03:49,792 INFO L290 TraceCheckUtils]: 295: Hoare triple {14272#(<= 0 (+ 2147483611 g_~x))} assume !(0 == ~x); {14272#(<= 0 (+ 2147483611 g_~x))} is VALID [2022-02-21 03:03:49,792 INFO L290 TraceCheckUtils]: 294: Hoare triple {14285#(<= 0 (+ 2147483611 |g_#in~x|))} ~x := #in~x; {14272#(<= 0 (+ 2147483611 g_~x))} is VALID [2022-02-21 03:03:49,793 INFO L272 TraceCheckUtils]: 293: Hoare triple {14289#(<= 0 (+ g_~x 2147483610))} call #t~ret0 := g(~x - 1); {14285#(<= 0 (+ 2147483611 |g_#in~x|))} is VALID [2022-02-21 03:03:49,793 INFO L290 TraceCheckUtils]: 292: Hoare triple {14289#(<= 0 (+ g_~x 2147483610))} assume ~x - 1 >= -2147483648; {14289#(<= 0 (+ g_~x 2147483610))} is VALID [2022-02-21 03:03:49,793 INFO L290 TraceCheckUtils]: 291: Hoare triple {14289#(<= 0 (+ g_~x 2147483610))} assume ~x - 1 <= 2147483647; {14289#(<= 0 (+ g_~x 2147483610))} is VALID [2022-02-21 03:03:49,793 INFO L290 TraceCheckUtils]: 290: Hoare triple {14289#(<= 0 (+ g_~x 2147483610))} assume !(0 == ~x); {14289#(<= 0 (+ g_~x 2147483610))} is VALID [2022-02-21 03:03:49,794 INFO L290 TraceCheckUtils]: 289: Hoare triple {14302#(<= 0 (+ |g_#in~x| 2147483610))} ~x := #in~x; {14289#(<= 0 (+ g_~x 2147483610))} is VALID [2022-02-21 03:03:49,794 INFO L272 TraceCheckUtils]: 288: Hoare triple {14306#(<= 0 (+ g_~x 2147483609))} call #t~ret0 := g(~x - 1); {14302#(<= 0 (+ |g_#in~x| 2147483610))} is VALID [2022-02-21 03:03:49,794 INFO L290 TraceCheckUtils]: 287: Hoare triple {14306#(<= 0 (+ g_~x 2147483609))} assume ~x - 1 >= -2147483648; {14306#(<= 0 (+ g_~x 2147483609))} is VALID [2022-02-21 03:03:49,795 INFO L290 TraceCheckUtils]: 286: Hoare triple {14306#(<= 0 (+ g_~x 2147483609))} assume ~x - 1 <= 2147483647; {14306#(<= 0 (+ g_~x 2147483609))} is VALID [2022-02-21 03:03:49,795 INFO L290 TraceCheckUtils]: 285: Hoare triple {14306#(<= 0 (+ g_~x 2147483609))} assume !(0 == ~x); {14306#(<= 0 (+ g_~x 2147483609))} is VALID [2022-02-21 03:03:49,795 INFO L290 TraceCheckUtils]: 284: Hoare triple {14319#(<= 0 (+ |g_#in~x| 2147483609))} ~x := #in~x; {14306#(<= 0 (+ g_~x 2147483609))} is VALID [2022-02-21 03:03:49,796 INFO L272 TraceCheckUtils]: 283: Hoare triple {14323#(<= 0 (+ g_~x 2147483608))} call #t~ret0 := g(~x - 1); {14319#(<= 0 (+ |g_#in~x| 2147483609))} is VALID [2022-02-21 03:03:49,796 INFO L290 TraceCheckUtils]: 282: Hoare triple {14323#(<= 0 (+ g_~x 2147483608))} assume ~x - 1 >= -2147483648; {14323#(<= 0 (+ g_~x 2147483608))} is VALID [2022-02-21 03:03:49,796 INFO L290 TraceCheckUtils]: 281: Hoare triple {14323#(<= 0 (+ g_~x 2147483608))} assume ~x - 1 <= 2147483647; {14323#(<= 0 (+ g_~x 2147483608))} is VALID [2022-02-21 03:03:49,797 INFO L290 TraceCheckUtils]: 280: Hoare triple {14323#(<= 0 (+ g_~x 2147483608))} assume !(0 == ~x); {14323#(<= 0 (+ g_~x 2147483608))} is VALID [2022-02-21 03:03:49,797 INFO L290 TraceCheckUtils]: 279: Hoare triple {14336#(<= 0 (+ |g_#in~x| 2147483608))} ~x := #in~x; {14323#(<= 0 (+ g_~x 2147483608))} is VALID [2022-02-21 03:03:49,797 INFO L272 TraceCheckUtils]: 278: Hoare triple {14340#(<= 0 (+ g_~x 2147483607))} call #t~ret0 := g(~x - 1); {14336#(<= 0 (+ |g_#in~x| 2147483608))} is VALID [2022-02-21 03:03:49,798 INFO L290 TraceCheckUtils]: 277: Hoare triple {14340#(<= 0 (+ g_~x 2147483607))} assume ~x - 1 >= -2147483648; {14340#(<= 0 (+ g_~x 2147483607))} is VALID [2022-02-21 03:03:49,798 INFO L290 TraceCheckUtils]: 276: Hoare triple {14340#(<= 0 (+ g_~x 2147483607))} assume ~x - 1 <= 2147483647; {14340#(<= 0 (+ g_~x 2147483607))} is VALID [2022-02-21 03:03:49,798 INFO L290 TraceCheckUtils]: 275: Hoare triple {14340#(<= 0 (+ g_~x 2147483607))} assume !(0 == ~x); {14340#(<= 0 (+ g_~x 2147483607))} is VALID [2022-02-21 03:03:49,798 INFO L290 TraceCheckUtils]: 274: Hoare triple {14353#(<= 0 (+ |g_#in~x| 2147483607))} ~x := #in~x; {14340#(<= 0 (+ g_~x 2147483607))} is VALID [2022-02-21 03:03:49,799 INFO L272 TraceCheckUtils]: 273: Hoare triple {14357#(<= 0 (+ 2147483606 g_~x))} call #t~ret0 := g(~x - 1); {14353#(<= 0 (+ |g_#in~x| 2147483607))} is VALID [2022-02-21 03:03:49,799 INFO L290 TraceCheckUtils]: 272: Hoare triple {14357#(<= 0 (+ 2147483606 g_~x))} assume ~x - 1 >= -2147483648; {14357#(<= 0 (+ 2147483606 g_~x))} is VALID [2022-02-21 03:03:49,799 INFO L290 TraceCheckUtils]: 271: Hoare triple {14357#(<= 0 (+ 2147483606 g_~x))} assume ~x - 1 <= 2147483647; {14357#(<= 0 (+ 2147483606 g_~x))} is VALID [2022-02-21 03:03:49,800 INFO L290 TraceCheckUtils]: 270: Hoare triple {14357#(<= 0 (+ 2147483606 g_~x))} assume !(0 == ~x); {14357#(<= 0 (+ 2147483606 g_~x))} is VALID [2022-02-21 03:03:49,800 INFO L290 TraceCheckUtils]: 269: Hoare triple {14370#(<= 0 (+ 2147483606 |g_#in~x|))} ~x := #in~x; {14357#(<= 0 (+ 2147483606 g_~x))} is VALID [2022-02-21 03:03:49,800 INFO L272 TraceCheckUtils]: 268: Hoare triple {14374#(<= 0 (+ g_~x 2147483605))} call #t~ret0 := g(~x - 1); {14370#(<= 0 (+ 2147483606 |g_#in~x|))} is VALID [2022-02-21 03:03:49,801 INFO L290 TraceCheckUtils]: 267: Hoare triple {14374#(<= 0 (+ g_~x 2147483605))} assume ~x - 1 >= -2147483648; {14374#(<= 0 (+ g_~x 2147483605))} is VALID [2022-02-21 03:03:49,801 INFO L290 TraceCheckUtils]: 266: Hoare triple {14374#(<= 0 (+ g_~x 2147483605))} assume ~x - 1 <= 2147483647; {14374#(<= 0 (+ g_~x 2147483605))} is VALID [2022-02-21 03:03:49,801 INFO L290 TraceCheckUtils]: 265: Hoare triple {14374#(<= 0 (+ g_~x 2147483605))} assume !(0 == ~x); {14374#(<= 0 (+ g_~x 2147483605))} is VALID [2022-02-21 03:03:49,802 INFO L290 TraceCheckUtils]: 264: Hoare triple {14387#(<= 0 (+ |g_#in~x| 2147483605))} ~x := #in~x; {14374#(<= 0 (+ g_~x 2147483605))} is VALID [2022-02-21 03:03:49,802 INFO L272 TraceCheckUtils]: 263: Hoare triple {14391#(<= 0 (+ 2147483604 g_~x))} call #t~ret0 := g(~x - 1); {14387#(<= 0 (+ |g_#in~x| 2147483605))} is VALID [2022-02-21 03:03:49,802 INFO L290 TraceCheckUtils]: 262: Hoare triple {14391#(<= 0 (+ 2147483604 g_~x))} assume ~x - 1 >= -2147483648; {14391#(<= 0 (+ 2147483604 g_~x))} is VALID [2022-02-21 03:03:49,803 INFO L290 TraceCheckUtils]: 261: Hoare triple {14391#(<= 0 (+ 2147483604 g_~x))} assume ~x - 1 <= 2147483647; {14391#(<= 0 (+ 2147483604 g_~x))} is VALID [2022-02-21 03:03:49,803 INFO L290 TraceCheckUtils]: 260: Hoare triple {14391#(<= 0 (+ 2147483604 g_~x))} assume !(0 == ~x); {14391#(<= 0 (+ 2147483604 g_~x))} is VALID [2022-02-21 03:03:49,803 INFO L290 TraceCheckUtils]: 259: Hoare triple {14404#(<= 0 (+ |g_#in~x| 2147483604))} ~x := #in~x; {14391#(<= 0 (+ 2147483604 g_~x))} is VALID [2022-02-21 03:03:49,804 INFO L272 TraceCheckUtils]: 258: Hoare triple {14408#(<= 0 (+ 2147483603 g_~x))} call #t~ret0 := g(~x - 1); {14404#(<= 0 (+ |g_#in~x| 2147483604))} is VALID [2022-02-21 03:03:49,804 INFO L290 TraceCheckUtils]: 257: Hoare triple {14408#(<= 0 (+ 2147483603 g_~x))} assume ~x - 1 >= -2147483648; {14408#(<= 0 (+ 2147483603 g_~x))} is VALID [2022-02-21 03:03:49,804 INFO L290 TraceCheckUtils]: 256: Hoare triple {14408#(<= 0 (+ 2147483603 g_~x))} assume ~x - 1 <= 2147483647; {14408#(<= 0 (+ 2147483603 g_~x))} is VALID [2022-02-21 03:03:49,805 INFO L290 TraceCheckUtils]: 255: Hoare triple {14408#(<= 0 (+ 2147483603 g_~x))} assume !(0 == ~x); {14408#(<= 0 (+ 2147483603 g_~x))} is VALID [2022-02-21 03:03:49,805 INFO L290 TraceCheckUtils]: 254: Hoare triple {14421#(<= 0 (+ 2147483603 |g_#in~x|))} ~x := #in~x; {14408#(<= 0 (+ 2147483603 g_~x))} is VALID [2022-02-21 03:03:49,805 INFO L272 TraceCheckUtils]: 253: Hoare triple {14425#(<= 0 (+ 2147483602 g_~x))} call #t~ret0 := g(~x - 1); {14421#(<= 0 (+ 2147483603 |g_#in~x|))} is VALID [2022-02-21 03:03:49,807 INFO L290 TraceCheckUtils]: 252: Hoare triple {14425#(<= 0 (+ 2147483602 g_~x))} assume ~x - 1 >= -2147483648; {14425#(<= 0 (+ 2147483602 g_~x))} is VALID [2022-02-21 03:03:49,807 INFO L290 TraceCheckUtils]: 251: Hoare triple {14425#(<= 0 (+ 2147483602 g_~x))} assume ~x - 1 <= 2147483647; {14425#(<= 0 (+ 2147483602 g_~x))} is VALID [2022-02-21 03:03:49,809 INFO L290 TraceCheckUtils]: 250: Hoare triple {14425#(<= 0 (+ 2147483602 g_~x))} assume !(0 == ~x); {14425#(<= 0 (+ 2147483602 g_~x))} is VALID [2022-02-21 03:03:49,810 INFO L290 TraceCheckUtils]: 249: Hoare triple {14438#(<= 0 (+ |g_#in~x| 2147483602))} ~x := #in~x; {14425#(<= 0 (+ 2147483602 g_~x))} is VALID [2022-02-21 03:03:49,810 INFO L272 TraceCheckUtils]: 248: Hoare triple {14442#(<= 0 (+ g_~x 2147483601))} call #t~ret0 := g(~x - 1); {14438#(<= 0 (+ |g_#in~x| 2147483602))} is VALID [2022-02-21 03:03:49,810 INFO L290 TraceCheckUtils]: 247: Hoare triple {14442#(<= 0 (+ g_~x 2147483601))} assume ~x - 1 >= -2147483648; {14442#(<= 0 (+ g_~x 2147483601))} is VALID [2022-02-21 03:03:49,811 INFO L290 TraceCheckUtils]: 246: Hoare triple {14442#(<= 0 (+ g_~x 2147483601))} assume ~x - 1 <= 2147483647; {14442#(<= 0 (+ g_~x 2147483601))} is VALID [2022-02-21 03:03:49,811 INFO L290 TraceCheckUtils]: 245: Hoare triple {14442#(<= 0 (+ g_~x 2147483601))} assume !(0 == ~x); {14442#(<= 0 (+ g_~x 2147483601))} is VALID [2022-02-21 03:03:49,811 INFO L290 TraceCheckUtils]: 244: Hoare triple {14455#(<= 0 (+ |g_#in~x| 2147483601))} ~x := #in~x; {14442#(<= 0 (+ g_~x 2147483601))} is VALID [2022-02-21 03:03:49,812 INFO L272 TraceCheckUtils]: 243: Hoare triple {14459#(<= 0 (+ g_~x 2147483600))} call #t~ret0 := g(~x - 1); {14455#(<= 0 (+ |g_#in~x| 2147483601))} is VALID [2022-02-21 03:03:49,812 INFO L290 TraceCheckUtils]: 242: Hoare triple {14459#(<= 0 (+ g_~x 2147483600))} assume ~x - 1 >= -2147483648; {14459#(<= 0 (+ g_~x 2147483600))} is VALID [2022-02-21 03:03:49,812 INFO L290 TraceCheckUtils]: 241: Hoare triple {14459#(<= 0 (+ g_~x 2147483600))} assume ~x - 1 <= 2147483647; {14459#(<= 0 (+ g_~x 2147483600))} is VALID [2022-02-21 03:03:49,813 INFO L290 TraceCheckUtils]: 240: Hoare triple {14459#(<= 0 (+ g_~x 2147483600))} assume !(0 == ~x); {14459#(<= 0 (+ g_~x 2147483600))} is VALID [2022-02-21 03:03:49,813 INFO L290 TraceCheckUtils]: 239: Hoare triple {14472#(<= 0 (+ |g_#in~x| 2147483600))} ~x := #in~x; {14459#(<= 0 (+ g_~x 2147483600))} is VALID [2022-02-21 03:03:49,813 INFO L272 TraceCheckUtils]: 238: Hoare triple {14476#(<= 0 (+ 2147483599 g_~x))} call #t~ret0 := g(~x - 1); {14472#(<= 0 (+ |g_#in~x| 2147483600))} is VALID [2022-02-21 03:03:49,814 INFO L290 TraceCheckUtils]: 237: Hoare triple {14476#(<= 0 (+ 2147483599 g_~x))} assume ~x - 1 >= -2147483648; {14476#(<= 0 (+ 2147483599 g_~x))} is VALID [2022-02-21 03:03:49,814 INFO L290 TraceCheckUtils]: 236: Hoare triple {14476#(<= 0 (+ 2147483599 g_~x))} assume ~x - 1 <= 2147483647; {14476#(<= 0 (+ 2147483599 g_~x))} is VALID [2022-02-21 03:03:49,814 INFO L290 TraceCheckUtils]: 235: Hoare triple {14476#(<= 0 (+ 2147483599 g_~x))} assume !(0 == ~x); {14476#(<= 0 (+ 2147483599 g_~x))} is VALID [2022-02-21 03:03:49,815 INFO L290 TraceCheckUtils]: 234: Hoare triple {14489#(<= 0 (+ |g_#in~x| 2147483599))} ~x := #in~x; {14476#(<= 0 (+ 2147483599 g_~x))} is VALID [2022-02-21 03:03:49,815 INFO L272 TraceCheckUtils]: 233: Hoare triple {14493#(<= 0 (+ 2147483598 g_~x))} call #t~ret0 := g(~x - 1); {14489#(<= 0 (+ |g_#in~x| 2147483599))} is VALID [2022-02-21 03:03:49,815 INFO L290 TraceCheckUtils]: 232: Hoare triple {14493#(<= 0 (+ 2147483598 g_~x))} assume ~x - 1 >= -2147483648; {14493#(<= 0 (+ 2147483598 g_~x))} is VALID [2022-02-21 03:03:49,816 INFO L290 TraceCheckUtils]: 231: Hoare triple {14493#(<= 0 (+ 2147483598 g_~x))} assume ~x - 1 <= 2147483647; {14493#(<= 0 (+ 2147483598 g_~x))} is VALID [2022-02-21 03:03:49,816 INFO L290 TraceCheckUtils]: 230: Hoare triple {14493#(<= 0 (+ 2147483598 g_~x))} assume !(0 == ~x); {14493#(<= 0 (+ 2147483598 g_~x))} is VALID [2022-02-21 03:03:49,816 INFO L290 TraceCheckUtils]: 229: Hoare triple {14506#(<= 0 (+ 2147483598 |g_#in~x|))} ~x := #in~x; {14493#(<= 0 (+ 2147483598 g_~x))} is VALID [2022-02-21 03:03:49,817 INFO L272 TraceCheckUtils]: 228: Hoare triple {14510#(<= 0 (+ 2147483597 g_~x))} call #t~ret0 := g(~x - 1); {14506#(<= 0 (+ 2147483598 |g_#in~x|))} is VALID [2022-02-21 03:03:49,817 INFO L290 TraceCheckUtils]: 227: Hoare triple {14510#(<= 0 (+ 2147483597 g_~x))} assume ~x - 1 >= -2147483648; {14510#(<= 0 (+ 2147483597 g_~x))} is VALID [2022-02-21 03:03:49,817 INFO L290 TraceCheckUtils]: 226: Hoare triple {14510#(<= 0 (+ 2147483597 g_~x))} assume ~x - 1 <= 2147483647; {14510#(<= 0 (+ 2147483597 g_~x))} is VALID [2022-02-21 03:03:49,818 INFO L290 TraceCheckUtils]: 225: Hoare triple {14510#(<= 0 (+ 2147483597 g_~x))} assume !(0 == ~x); {14510#(<= 0 (+ 2147483597 g_~x))} is VALID [2022-02-21 03:03:49,818 INFO L290 TraceCheckUtils]: 224: Hoare triple {14523#(<= 0 (+ |g_#in~x| 2147483597))} ~x := #in~x; {14510#(<= 0 (+ 2147483597 g_~x))} is VALID [2022-02-21 03:03:49,818 INFO L272 TraceCheckUtils]: 223: Hoare triple {14527#(<= 0 (+ g_~x 2147483596))} call #t~ret0 := g(~x - 1); {14523#(<= 0 (+ |g_#in~x| 2147483597))} is VALID [2022-02-21 03:03:49,819 INFO L290 TraceCheckUtils]: 222: Hoare triple {14527#(<= 0 (+ g_~x 2147483596))} assume ~x - 1 >= -2147483648; {14527#(<= 0 (+ g_~x 2147483596))} is VALID [2022-02-21 03:03:49,819 INFO L290 TraceCheckUtils]: 221: Hoare triple {14527#(<= 0 (+ g_~x 2147483596))} assume ~x - 1 <= 2147483647; {14527#(<= 0 (+ g_~x 2147483596))} is VALID [2022-02-21 03:03:49,819 INFO L290 TraceCheckUtils]: 220: Hoare triple {14527#(<= 0 (+ g_~x 2147483596))} assume !(0 == ~x); {14527#(<= 0 (+ g_~x 2147483596))} is VALID [2022-02-21 03:03:49,820 INFO L290 TraceCheckUtils]: 219: Hoare triple {14540#(<= 0 (+ |g_#in~x| 2147483596))} ~x := #in~x; {14527#(<= 0 (+ g_~x 2147483596))} is VALID [2022-02-21 03:03:49,820 INFO L272 TraceCheckUtils]: 218: Hoare triple {14544#(<= 0 (+ g_~x 2147483595))} call #t~ret0 := g(~x - 1); {14540#(<= 0 (+ |g_#in~x| 2147483596))} is VALID [2022-02-21 03:03:49,820 INFO L290 TraceCheckUtils]: 217: Hoare triple {14544#(<= 0 (+ g_~x 2147483595))} assume ~x - 1 >= -2147483648; {14544#(<= 0 (+ g_~x 2147483595))} is VALID [2022-02-21 03:03:49,821 INFO L290 TraceCheckUtils]: 216: Hoare triple {14544#(<= 0 (+ g_~x 2147483595))} assume ~x - 1 <= 2147483647; {14544#(<= 0 (+ g_~x 2147483595))} is VALID [2022-02-21 03:03:49,821 INFO L290 TraceCheckUtils]: 215: Hoare triple {14544#(<= 0 (+ g_~x 2147483595))} assume !(0 == ~x); {14544#(<= 0 (+ g_~x 2147483595))} is VALID [2022-02-21 03:03:49,821 INFO L290 TraceCheckUtils]: 214: Hoare triple {14557#(<= 0 (+ |g_#in~x| 2147483595))} ~x := #in~x; {14544#(<= 0 (+ g_~x 2147483595))} is VALID [2022-02-21 03:03:49,822 INFO L272 TraceCheckUtils]: 213: Hoare triple {14561#(<= 0 (+ 2147483594 g_~x))} call #t~ret0 := g(~x - 1); {14557#(<= 0 (+ |g_#in~x| 2147483595))} is VALID [2022-02-21 03:03:49,822 INFO L290 TraceCheckUtils]: 212: Hoare triple {14561#(<= 0 (+ 2147483594 g_~x))} assume ~x - 1 >= -2147483648; {14561#(<= 0 (+ 2147483594 g_~x))} is VALID [2022-02-21 03:03:49,822 INFO L290 TraceCheckUtils]: 211: Hoare triple {14561#(<= 0 (+ 2147483594 g_~x))} assume ~x - 1 <= 2147483647; {14561#(<= 0 (+ 2147483594 g_~x))} is VALID [2022-02-21 03:03:49,823 INFO L290 TraceCheckUtils]: 210: Hoare triple {14561#(<= 0 (+ 2147483594 g_~x))} assume !(0 == ~x); {14561#(<= 0 (+ 2147483594 g_~x))} is VALID [2022-02-21 03:03:49,823 INFO L290 TraceCheckUtils]: 209: Hoare triple {14574#(<= 0 (+ 2147483594 |g_#in~x|))} ~x := #in~x; {14561#(<= 0 (+ 2147483594 g_~x))} is VALID [2022-02-21 03:03:49,823 INFO L272 TraceCheckUtils]: 208: Hoare triple {14578#(<= 0 (+ g_~x 2147483593))} call #t~ret0 := g(~x - 1); {14574#(<= 0 (+ 2147483594 |g_#in~x|))} is VALID [2022-02-21 03:03:49,824 INFO L290 TraceCheckUtils]: 207: Hoare triple {14578#(<= 0 (+ g_~x 2147483593))} assume ~x - 1 >= -2147483648; {14578#(<= 0 (+ g_~x 2147483593))} is VALID [2022-02-21 03:03:49,824 INFO L290 TraceCheckUtils]: 206: Hoare triple {14578#(<= 0 (+ g_~x 2147483593))} assume ~x - 1 <= 2147483647; {14578#(<= 0 (+ g_~x 2147483593))} is VALID [2022-02-21 03:03:49,824 INFO L290 TraceCheckUtils]: 205: Hoare triple {14578#(<= 0 (+ g_~x 2147483593))} assume !(0 == ~x); {14578#(<= 0 (+ g_~x 2147483593))} is VALID [2022-02-21 03:03:49,824 INFO L290 TraceCheckUtils]: 204: Hoare triple {14591#(<= 0 (+ |g_#in~x| 2147483593))} ~x := #in~x; {14578#(<= 0 (+ g_~x 2147483593))} is VALID [2022-02-21 03:03:49,825 INFO L272 TraceCheckUtils]: 203: Hoare triple {14595#(<= 0 (+ 2147483592 g_~x))} call #t~ret0 := g(~x - 1); {14591#(<= 0 (+ |g_#in~x| 2147483593))} is VALID [2022-02-21 03:03:49,825 INFO L290 TraceCheckUtils]: 202: Hoare triple {14595#(<= 0 (+ 2147483592 g_~x))} assume ~x - 1 >= -2147483648; {14595#(<= 0 (+ 2147483592 g_~x))} is VALID [2022-02-21 03:03:49,825 INFO L290 TraceCheckUtils]: 201: Hoare triple {14595#(<= 0 (+ 2147483592 g_~x))} assume ~x - 1 <= 2147483647; {14595#(<= 0 (+ 2147483592 g_~x))} is VALID [2022-02-21 03:03:49,826 INFO L290 TraceCheckUtils]: 200: Hoare triple {14595#(<= 0 (+ 2147483592 g_~x))} assume !(0 == ~x); {14595#(<= 0 (+ 2147483592 g_~x))} is VALID [2022-02-21 03:03:49,826 INFO L290 TraceCheckUtils]: 199: Hoare triple {14608#(<= 0 (+ 2147483592 |g_#in~x|))} ~x := #in~x; {14595#(<= 0 (+ 2147483592 g_~x))} is VALID [2022-02-21 03:03:49,827 INFO L272 TraceCheckUtils]: 198: Hoare triple {14612#(<= 0 (+ 2147483591 g_~x))} call #t~ret0 := g(~x - 1); {14608#(<= 0 (+ 2147483592 |g_#in~x|))} is VALID [2022-02-21 03:03:49,827 INFO L290 TraceCheckUtils]: 197: Hoare triple {14612#(<= 0 (+ 2147483591 g_~x))} assume ~x - 1 >= -2147483648; {14612#(<= 0 (+ 2147483591 g_~x))} is VALID [2022-02-21 03:03:49,827 INFO L290 TraceCheckUtils]: 196: Hoare triple {14612#(<= 0 (+ 2147483591 g_~x))} assume ~x - 1 <= 2147483647; {14612#(<= 0 (+ 2147483591 g_~x))} is VALID [2022-02-21 03:03:49,827 INFO L290 TraceCheckUtils]: 195: Hoare triple {14612#(<= 0 (+ 2147483591 g_~x))} assume !(0 == ~x); {14612#(<= 0 (+ 2147483591 g_~x))} is VALID [2022-02-21 03:03:49,828 INFO L290 TraceCheckUtils]: 194: Hoare triple {14625#(<= 0 (+ 2147483591 |g_#in~x|))} ~x := #in~x; {14612#(<= 0 (+ 2147483591 g_~x))} is VALID [2022-02-21 03:03:49,828 INFO L272 TraceCheckUtils]: 193: Hoare triple {14629#(<= 0 (+ g_~x 2147483590))} call #t~ret0 := g(~x - 1); {14625#(<= 0 (+ 2147483591 |g_#in~x|))} is VALID [2022-02-21 03:03:49,828 INFO L290 TraceCheckUtils]: 192: Hoare triple {14629#(<= 0 (+ g_~x 2147483590))} assume ~x - 1 >= -2147483648; {14629#(<= 0 (+ g_~x 2147483590))} is VALID [2022-02-21 03:03:49,829 INFO L290 TraceCheckUtils]: 191: Hoare triple {14629#(<= 0 (+ g_~x 2147483590))} assume ~x - 1 <= 2147483647; {14629#(<= 0 (+ g_~x 2147483590))} is VALID [2022-02-21 03:03:49,829 INFO L290 TraceCheckUtils]: 190: Hoare triple {14629#(<= 0 (+ g_~x 2147483590))} assume !(0 == ~x); {14629#(<= 0 (+ g_~x 2147483590))} is VALID [2022-02-21 03:03:49,829 INFO L290 TraceCheckUtils]: 189: Hoare triple {14642#(<= 0 (+ |g_#in~x| 2147483590))} ~x := #in~x; {14629#(<= 0 (+ g_~x 2147483590))} is VALID [2022-02-21 03:03:49,830 INFO L272 TraceCheckUtils]: 188: Hoare triple {14646#(<= 0 (+ g_~x 2147483589))} call #t~ret0 := g(~x - 1); {14642#(<= 0 (+ |g_#in~x| 2147483590))} is VALID [2022-02-21 03:03:49,830 INFO L290 TraceCheckUtils]: 187: Hoare triple {14646#(<= 0 (+ g_~x 2147483589))} assume ~x - 1 >= -2147483648; {14646#(<= 0 (+ g_~x 2147483589))} is VALID [2022-02-21 03:03:49,830 INFO L290 TraceCheckUtils]: 186: Hoare triple {14646#(<= 0 (+ g_~x 2147483589))} assume ~x - 1 <= 2147483647; {14646#(<= 0 (+ g_~x 2147483589))} is VALID [2022-02-21 03:03:49,831 INFO L290 TraceCheckUtils]: 185: Hoare triple {14646#(<= 0 (+ g_~x 2147483589))} assume !(0 == ~x); {14646#(<= 0 (+ g_~x 2147483589))} is VALID [2022-02-21 03:03:49,831 INFO L290 TraceCheckUtils]: 184: Hoare triple {14659#(<= 0 (+ |g_#in~x| 2147483589))} ~x := #in~x; {14646#(<= 0 (+ g_~x 2147483589))} is VALID [2022-02-21 03:03:49,831 INFO L272 TraceCheckUtils]: 183: Hoare triple {14663#(<= 0 (+ 2147483588 g_~x))} call #t~ret0 := g(~x - 1); {14659#(<= 0 (+ |g_#in~x| 2147483589))} is VALID [2022-02-21 03:03:49,832 INFO L290 TraceCheckUtils]: 182: Hoare triple {14663#(<= 0 (+ 2147483588 g_~x))} assume ~x - 1 >= -2147483648; {14663#(<= 0 (+ 2147483588 g_~x))} is VALID [2022-02-21 03:03:49,832 INFO L290 TraceCheckUtils]: 181: Hoare triple {14663#(<= 0 (+ 2147483588 g_~x))} assume ~x - 1 <= 2147483647; {14663#(<= 0 (+ 2147483588 g_~x))} is VALID [2022-02-21 03:03:49,832 INFO L290 TraceCheckUtils]: 180: Hoare triple {14663#(<= 0 (+ 2147483588 g_~x))} assume !(0 == ~x); {14663#(<= 0 (+ 2147483588 g_~x))} is VALID [2022-02-21 03:03:49,833 INFO L290 TraceCheckUtils]: 179: Hoare triple {14676#(<= 0 (+ 2147483588 |g_#in~x|))} ~x := #in~x; {14663#(<= 0 (+ 2147483588 g_~x))} is VALID [2022-02-21 03:03:49,833 INFO L272 TraceCheckUtils]: 178: Hoare triple {14680#(<= 0 (+ 2147483587 g_~x))} call #t~ret0 := g(~x - 1); {14676#(<= 0 (+ 2147483588 |g_#in~x|))} is VALID [2022-02-21 03:03:49,833 INFO L290 TraceCheckUtils]: 177: Hoare triple {14680#(<= 0 (+ 2147483587 g_~x))} assume ~x - 1 >= -2147483648; {14680#(<= 0 (+ 2147483587 g_~x))} is VALID [2022-02-21 03:03:49,834 INFO L290 TraceCheckUtils]: 176: Hoare triple {14680#(<= 0 (+ 2147483587 g_~x))} assume ~x - 1 <= 2147483647; {14680#(<= 0 (+ 2147483587 g_~x))} is VALID [2022-02-21 03:03:49,834 INFO L290 TraceCheckUtils]: 175: Hoare triple {14680#(<= 0 (+ 2147483587 g_~x))} assume !(0 == ~x); {14680#(<= 0 (+ 2147483587 g_~x))} is VALID [2022-02-21 03:03:49,834 INFO L290 TraceCheckUtils]: 174: Hoare triple {14693#(<= 0 (+ 2147483587 |g_#in~x|))} ~x := #in~x; {14680#(<= 0 (+ 2147483587 g_~x))} is VALID [2022-02-21 03:03:49,835 INFO L272 TraceCheckUtils]: 173: Hoare triple {14697#(<= 0 (+ 2147483586 g_~x))} call #t~ret0 := g(~x - 1); {14693#(<= 0 (+ 2147483587 |g_#in~x|))} is VALID [2022-02-21 03:03:49,835 INFO L290 TraceCheckUtils]: 172: Hoare triple {14697#(<= 0 (+ 2147483586 g_~x))} assume ~x - 1 >= -2147483648; {14697#(<= 0 (+ 2147483586 g_~x))} is VALID [2022-02-21 03:03:49,835 INFO L290 TraceCheckUtils]: 171: Hoare triple {14697#(<= 0 (+ 2147483586 g_~x))} assume ~x - 1 <= 2147483647; {14697#(<= 0 (+ 2147483586 g_~x))} is VALID [2022-02-21 03:03:49,836 INFO L290 TraceCheckUtils]: 170: Hoare triple {14697#(<= 0 (+ 2147483586 g_~x))} assume !(0 == ~x); {14697#(<= 0 (+ 2147483586 g_~x))} is VALID [2022-02-21 03:03:49,836 INFO L290 TraceCheckUtils]: 169: Hoare triple {14710#(<= 0 (+ 2147483586 |g_#in~x|))} ~x := #in~x; {14697#(<= 0 (+ 2147483586 g_~x))} is VALID [2022-02-21 03:03:49,836 INFO L272 TraceCheckUtils]: 168: Hoare triple {14714#(<= 0 (+ g_~x 2147483585))} call #t~ret0 := g(~x - 1); {14710#(<= 0 (+ 2147483586 |g_#in~x|))} is VALID [2022-02-21 03:03:49,837 INFO L290 TraceCheckUtils]: 167: Hoare triple {14714#(<= 0 (+ g_~x 2147483585))} assume ~x - 1 >= -2147483648; {14714#(<= 0 (+ g_~x 2147483585))} is VALID [2022-02-21 03:03:49,837 INFO L290 TraceCheckUtils]: 166: Hoare triple {14714#(<= 0 (+ g_~x 2147483585))} assume ~x - 1 <= 2147483647; {14714#(<= 0 (+ g_~x 2147483585))} is VALID [2022-02-21 03:03:49,837 INFO L290 TraceCheckUtils]: 165: Hoare triple {14714#(<= 0 (+ g_~x 2147483585))} assume !(0 == ~x); {14714#(<= 0 (+ g_~x 2147483585))} is VALID [2022-02-21 03:03:49,837 INFO L290 TraceCheckUtils]: 164: Hoare triple {14727#(<= 0 (+ |g_#in~x| 2147483585))} ~x := #in~x; {14714#(<= 0 (+ g_~x 2147483585))} is VALID [2022-02-21 03:03:49,838 INFO L272 TraceCheckUtils]: 163: Hoare triple {14731#(<= 0 (+ 2147483584 g_~x))} call #t~ret0 := g(~x - 1); {14727#(<= 0 (+ |g_#in~x| 2147483585))} is VALID [2022-02-21 03:03:49,838 INFO L290 TraceCheckUtils]: 162: Hoare triple {14731#(<= 0 (+ 2147483584 g_~x))} assume ~x - 1 >= -2147483648; {14731#(<= 0 (+ 2147483584 g_~x))} is VALID [2022-02-21 03:03:49,838 INFO L290 TraceCheckUtils]: 161: Hoare triple {14731#(<= 0 (+ 2147483584 g_~x))} assume ~x - 1 <= 2147483647; {14731#(<= 0 (+ 2147483584 g_~x))} is VALID [2022-02-21 03:03:49,839 INFO L290 TraceCheckUtils]: 160: Hoare triple {14731#(<= 0 (+ 2147483584 g_~x))} assume !(0 == ~x); {14731#(<= 0 (+ 2147483584 g_~x))} is VALID [2022-02-21 03:03:49,839 INFO L290 TraceCheckUtils]: 159: Hoare triple {14744#(<= 0 (+ 2147483584 |g_#in~x|))} ~x := #in~x; {14731#(<= 0 (+ 2147483584 g_~x))} is VALID [2022-02-21 03:03:49,839 INFO L272 TraceCheckUtils]: 158: Hoare triple {14748#(<= 0 (+ 2147483583 g_~x))} call #t~ret0 := g(~x - 1); {14744#(<= 0 (+ 2147483584 |g_#in~x|))} is VALID [2022-02-21 03:03:49,840 INFO L290 TraceCheckUtils]: 157: Hoare triple {14748#(<= 0 (+ 2147483583 g_~x))} assume ~x - 1 >= -2147483648; {14748#(<= 0 (+ 2147483583 g_~x))} is VALID [2022-02-21 03:03:49,840 INFO L290 TraceCheckUtils]: 156: Hoare triple {14748#(<= 0 (+ 2147483583 g_~x))} assume ~x - 1 <= 2147483647; {14748#(<= 0 (+ 2147483583 g_~x))} is VALID [2022-02-21 03:03:49,840 INFO L290 TraceCheckUtils]: 155: Hoare triple {14748#(<= 0 (+ 2147483583 g_~x))} assume !(0 == ~x); {14748#(<= 0 (+ 2147483583 g_~x))} is VALID [2022-02-21 03:03:49,841 INFO L290 TraceCheckUtils]: 154: Hoare triple {14761#(<= 0 (+ 2147483583 |g_#in~x|))} ~x := #in~x; {14748#(<= 0 (+ 2147483583 g_~x))} is VALID [2022-02-21 03:03:49,841 INFO L272 TraceCheckUtils]: 153: Hoare triple {14765#(<= 0 (+ g_~x 2147483582))} call #t~ret0 := g(~x - 1); {14761#(<= 0 (+ 2147483583 |g_#in~x|))} is VALID [2022-02-21 03:03:49,841 INFO L290 TraceCheckUtils]: 152: Hoare triple {14765#(<= 0 (+ g_~x 2147483582))} assume ~x - 1 >= -2147483648; {14765#(<= 0 (+ g_~x 2147483582))} is VALID [2022-02-21 03:03:49,842 INFO L290 TraceCheckUtils]: 151: Hoare triple {14765#(<= 0 (+ g_~x 2147483582))} assume ~x - 1 <= 2147483647; {14765#(<= 0 (+ g_~x 2147483582))} is VALID [2022-02-21 03:03:49,842 INFO L290 TraceCheckUtils]: 150: Hoare triple {14765#(<= 0 (+ g_~x 2147483582))} assume !(0 == ~x); {14765#(<= 0 (+ g_~x 2147483582))} is VALID [2022-02-21 03:03:49,842 INFO L290 TraceCheckUtils]: 149: Hoare triple {14778#(<= 0 (+ |g_#in~x| 2147483582))} ~x := #in~x; {14765#(<= 0 (+ g_~x 2147483582))} is VALID [2022-02-21 03:03:49,843 INFO L272 TraceCheckUtils]: 148: Hoare triple {14782#(<= 0 (+ g_~x 2147483581))} call #t~ret0 := g(~x - 1); {14778#(<= 0 (+ |g_#in~x| 2147483582))} is VALID [2022-02-21 03:03:49,843 INFO L290 TraceCheckUtils]: 147: Hoare triple {14782#(<= 0 (+ g_~x 2147483581))} assume ~x - 1 >= -2147483648; {14782#(<= 0 (+ g_~x 2147483581))} is VALID [2022-02-21 03:03:49,843 INFO L290 TraceCheckUtils]: 146: Hoare triple {14782#(<= 0 (+ g_~x 2147483581))} assume ~x - 1 <= 2147483647; {14782#(<= 0 (+ g_~x 2147483581))} is VALID [2022-02-21 03:03:49,843 INFO L290 TraceCheckUtils]: 145: Hoare triple {14782#(<= 0 (+ g_~x 2147483581))} assume !(0 == ~x); {14782#(<= 0 (+ g_~x 2147483581))} is VALID [2022-02-21 03:03:49,844 INFO L290 TraceCheckUtils]: 144: Hoare triple {14795#(<= 0 (+ |g_#in~x| 2147483581))} ~x := #in~x; {14782#(<= 0 (+ g_~x 2147483581))} is VALID [2022-02-21 03:03:49,844 INFO L272 TraceCheckUtils]: 143: Hoare triple {14799#(<= 0 (+ 2147483580 g_~x))} call #t~ret0 := g(~x - 1); {14795#(<= 0 (+ |g_#in~x| 2147483581))} is VALID [2022-02-21 03:03:49,844 INFO L290 TraceCheckUtils]: 142: Hoare triple {14799#(<= 0 (+ 2147483580 g_~x))} assume ~x - 1 >= -2147483648; {14799#(<= 0 (+ 2147483580 g_~x))} is VALID [2022-02-21 03:03:49,845 INFO L290 TraceCheckUtils]: 141: Hoare triple {14799#(<= 0 (+ 2147483580 g_~x))} assume ~x - 1 <= 2147483647; {14799#(<= 0 (+ 2147483580 g_~x))} is VALID [2022-02-21 03:03:49,845 INFO L290 TraceCheckUtils]: 140: Hoare triple {14799#(<= 0 (+ 2147483580 g_~x))} assume !(0 == ~x); {14799#(<= 0 (+ 2147483580 g_~x))} is VALID [2022-02-21 03:03:49,845 INFO L290 TraceCheckUtils]: 139: Hoare triple {14812#(<= 0 (+ 2147483580 |g_#in~x|))} ~x := #in~x; {14799#(<= 0 (+ 2147483580 g_~x))} is VALID [2022-02-21 03:03:49,846 INFO L272 TraceCheckUtils]: 138: Hoare triple {14816#(<= 0 (+ 2147483579 g_~x))} call #t~ret0 := g(~x - 1); {14812#(<= 0 (+ 2147483580 |g_#in~x|))} is VALID [2022-02-21 03:03:49,846 INFO L290 TraceCheckUtils]: 137: Hoare triple {14816#(<= 0 (+ 2147483579 g_~x))} assume ~x - 1 >= -2147483648; {14816#(<= 0 (+ 2147483579 g_~x))} is VALID [2022-02-21 03:03:49,846 INFO L290 TraceCheckUtils]: 136: Hoare triple {14816#(<= 0 (+ 2147483579 g_~x))} assume ~x - 1 <= 2147483647; {14816#(<= 0 (+ 2147483579 g_~x))} is VALID [2022-02-21 03:03:49,847 INFO L290 TraceCheckUtils]: 135: Hoare triple {14816#(<= 0 (+ 2147483579 g_~x))} assume !(0 == ~x); {14816#(<= 0 (+ 2147483579 g_~x))} is VALID [2022-02-21 03:03:49,847 INFO L290 TraceCheckUtils]: 134: Hoare triple {14829#(<= 0 (+ |g_#in~x| 2147483579))} ~x := #in~x; {14816#(<= 0 (+ 2147483579 g_~x))} is VALID [2022-02-21 03:03:49,847 INFO L272 TraceCheckUtils]: 133: Hoare triple {14833#(<= 0 (+ 2147483578 g_~x))} call #t~ret0 := g(~x - 1); {14829#(<= 0 (+ |g_#in~x| 2147483579))} is VALID [2022-02-21 03:03:49,848 INFO L290 TraceCheckUtils]: 132: Hoare triple {14833#(<= 0 (+ 2147483578 g_~x))} assume ~x - 1 >= -2147483648; {14833#(<= 0 (+ 2147483578 g_~x))} is VALID [2022-02-21 03:03:49,848 INFO L290 TraceCheckUtils]: 131: Hoare triple {14833#(<= 0 (+ 2147483578 g_~x))} assume ~x - 1 <= 2147483647; {14833#(<= 0 (+ 2147483578 g_~x))} is VALID [2022-02-21 03:03:49,848 INFO L290 TraceCheckUtils]: 130: Hoare triple {14833#(<= 0 (+ 2147483578 g_~x))} assume !(0 == ~x); {14833#(<= 0 (+ 2147483578 g_~x))} is VALID [2022-02-21 03:03:49,849 INFO L290 TraceCheckUtils]: 129: Hoare triple {14846#(<= 0 (+ |g_#in~x| 2147483578))} ~x := #in~x; {14833#(<= 0 (+ 2147483578 g_~x))} is VALID [2022-02-21 03:03:49,849 INFO L272 TraceCheckUtils]: 128: Hoare triple {14850#(<= 0 (+ g_~x 2147483577))} call #t~ret0 := g(~x - 1); {14846#(<= 0 (+ |g_#in~x| 2147483578))} is VALID [2022-02-21 03:03:49,849 INFO L290 TraceCheckUtils]: 127: Hoare triple {14850#(<= 0 (+ g_~x 2147483577))} assume ~x - 1 >= -2147483648; {14850#(<= 0 (+ g_~x 2147483577))} is VALID [2022-02-21 03:03:49,850 INFO L290 TraceCheckUtils]: 126: Hoare triple {14850#(<= 0 (+ g_~x 2147483577))} assume ~x - 1 <= 2147483647; {14850#(<= 0 (+ g_~x 2147483577))} is VALID [2022-02-21 03:03:49,850 INFO L290 TraceCheckUtils]: 125: Hoare triple {14850#(<= 0 (+ g_~x 2147483577))} assume !(0 == ~x); {14850#(<= 0 (+ g_~x 2147483577))} is VALID [2022-02-21 03:03:49,850 INFO L290 TraceCheckUtils]: 124: Hoare triple {14863#(<= 0 (+ |g_#in~x| 2147483577))} ~x := #in~x; {14850#(<= 0 (+ g_~x 2147483577))} is VALID [2022-02-21 03:03:49,851 INFO L272 TraceCheckUtils]: 123: Hoare triple {14867#(<= 0 (+ g_~x 2147483576))} call #t~ret0 := g(~x - 1); {14863#(<= 0 (+ |g_#in~x| 2147483577))} is VALID [2022-02-21 03:03:49,851 INFO L290 TraceCheckUtils]: 122: Hoare triple {14867#(<= 0 (+ g_~x 2147483576))} assume ~x - 1 >= -2147483648; {14867#(<= 0 (+ g_~x 2147483576))} is VALID [2022-02-21 03:03:49,851 INFO L290 TraceCheckUtils]: 121: Hoare triple {14867#(<= 0 (+ g_~x 2147483576))} assume ~x - 1 <= 2147483647; {14867#(<= 0 (+ g_~x 2147483576))} is VALID [2022-02-21 03:03:49,851 INFO L290 TraceCheckUtils]: 120: Hoare triple {14867#(<= 0 (+ g_~x 2147483576))} assume !(0 == ~x); {14867#(<= 0 (+ g_~x 2147483576))} is VALID [2022-02-21 03:03:49,852 INFO L290 TraceCheckUtils]: 119: Hoare triple {14880#(<= 0 (+ |g_#in~x| 2147483576))} ~x := #in~x; {14867#(<= 0 (+ g_~x 2147483576))} is VALID [2022-02-21 03:03:49,852 INFO L272 TraceCheckUtils]: 118: Hoare triple {14884#(<= 0 (+ g_~x 2147483575))} call #t~ret0 := g(~x - 1); {14880#(<= 0 (+ |g_#in~x| 2147483576))} is VALID [2022-02-21 03:03:49,853 INFO L290 TraceCheckUtils]: 117: Hoare triple {14884#(<= 0 (+ g_~x 2147483575))} assume ~x - 1 >= -2147483648; {14884#(<= 0 (+ g_~x 2147483575))} is VALID [2022-02-21 03:03:49,853 INFO L290 TraceCheckUtils]: 116: Hoare triple {14884#(<= 0 (+ g_~x 2147483575))} assume ~x - 1 <= 2147483647; {14884#(<= 0 (+ g_~x 2147483575))} is VALID [2022-02-21 03:03:49,853 INFO L290 TraceCheckUtils]: 115: Hoare triple {14884#(<= 0 (+ g_~x 2147483575))} assume !(0 == ~x); {14884#(<= 0 (+ g_~x 2147483575))} is VALID [2022-02-21 03:03:49,853 INFO L290 TraceCheckUtils]: 114: Hoare triple {14897#(<= 0 (+ |g_#in~x| 2147483575))} ~x := #in~x; {14884#(<= 0 (+ g_~x 2147483575))} is VALID [2022-02-21 03:03:49,854 INFO L272 TraceCheckUtils]: 113: Hoare triple {14901#(<= 0 (+ 2147483574 g_~x))} call #t~ret0 := g(~x - 1); {14897#(<= 0 (+ |g_#in~x| 2147483575))} is VALID [2022-02-21 03:03:49,854 INFO L290 TraceCheckUtils]: 112: Hoare triple {14901#(<= 0 (+ 2147483574 g_~x))} assume ~x - 1 >= -2147483648; {14901#(<= 0 (+ 2147483574 g_~x))} is VALID [2022-02-21 03:03:49,854 INFO L290 TraceCheckUtils]: 111: Hoare triple {14901#(<= 0 (+ 2147483574 g_~x))} assume ~x - 1 <= 2147483647; {14901#(<= 0 (+ 2147483574 g_~x))} is VALID [2022-02-21 03:03:49,855 INFO L290 TraceCheckUtils]: 110: Hoare triple {14901#(<= 0 (+ 2147483574 g_~x))} assume !(0 == ~x); {14901#(<= 0 (+ 2147483574 g_~x))} is VALID [2022-02-21 03:03:49,855 INFO L290 TraceCheckUtils]: 109: Hoare triple {14914#(<= 0 (+ 2147483574 |g_#in~x|))} ~x := #in~x; {14901#(<= 0 (+ 2147483574 g_~x))} is VALID [2022-02-21 03:03:49,855 INFO L272 TraceCheckUtils]: 108: Hoare triple {14918#(<= 0 (+ 2147483573 g_~x))} call #t~ret0 := g(~x - 1); {14914#(<= 0 (+ 2147483574 |g_#in~x|))} is VALID [2022-02-21 03:03:49,856 INFO L290 TraceCheckUtils]: 107: Hoare triple {14918#(<= 0 (+ 2147483573 g_~x))} assume ~x - 1 >= -2147483648; {14918#(<= 0 (+ 2147483573 g_~x))} is VALID [2022-02-21 03:03:49,856 INFO L290 TraceCheckUtils]: 106: Hoare triple {14918#(<= 0 (+ 2147483573 g_~x))} assume ~x - 1 <= 2147483647; {14918#(<= 0 (+ 2147483573 g_~x))} is VALID [2022-02-21 03:03:49,856 INFO L290 TraceCheckUtils]: 105: Hoare triple {14918#(<= 0 (+ 2147483573 g_~x))} assume !(0 == ~x); {14918#(<= 0 (+ 2147483573 g_~x))} is VALID [2022-02-21 03:03:49,857 INFO L290 TraceCheckUtils]: 104: Hoare triple {14931#(<= 0 (+ |g_#in~x| 2147483573))} ~x := #in~x; {14918#(<= 0 (+ 2147483573 g_~x))} is VALID [2022-02-21 03:03:49,857 INFO L272 TraceCheckUtils]: 103: Hoare triple {14935#(<= 0 (+ g_~x 2147483572))} call #t~ret0 := g(~x - 1); {14931#(<= 0 (+ |g_#in~x| 2147483573))} is VALID [2022-02-21 03:03:49,857 INFO L290 TraceCheckUtils]: 102: Hoare triple {14935#(<= 0 (+ g_~x 2147483572))} assume ~x - 1 >= -2147483648; {14935#(<= 0 (+ g_~x 2147483572))} is VALID [2022-02-21 03:03:49,858 INFO L290 TraceCheckUtils]: 101: Hoare triple {14935#(<= 0 (+ g_~x 2147483572))} assume ~x - 1 <= 2147483647; {14935#(<= 0 (+ g_~x 2147483572))} is VALID [2022-02-21 03:03:49,858 INFO L290 TraceCheckUtils]: 100: Hoare triple {14935#(<= 0 (+ g_~x 2147483572))} assume !(0 == ~x); {14935#(<= 0 (+ g_~x 2147483572))} is VALID [2022-02-21 03:03:49,858 INFO L290 TraceCheckUtils]: 99: Hoare triple {14948#(<= 0 (+ |g_#in~x| 2147483572))} ~x := #in~x; {14935#(<= 0 (+ g_~x 2147483572))} is VALID [2022-02-21 03:03:49,859 INFO L272 TraceCheckUtils]: 98: Hoare triple {14952#(<= 0 (+ g_~x 2147483571))} call #t~ret0 := g(~x - 1); {14948#(<= 0 (+ |g_#in~x| 2147483572))} is VALID [2022-02-21 03:03:49,859 INFO L290 TraceCheckUtils]: 97: Hoare triple {14952#(<= 0 (+ g_~x 2147483571))} assume ~x - 1 >= -2147483648; {14952#(<= 0 (+ g_~x 2147483571))} is VALID [2022-02-21 03:03:49,859 INFO L290 TraceCheckUtils]: 96: Hoare triple {14952#(<= 0 (+ g_~x 2147483571))} assume ~x - 1 <= 2147483647; {14952#(<= 0 (+ g_~x 2147483571))} is VALID [2022-02-21 03:03:49,860 INFO L290 TraceCheckUtils]: 95: Hoare triple {14952#(<= 0 (+ g_~x 2147483571))} assume !(0 == ~x); {14952#(<= 0 (+ g_~x 2147483571))} is VALID [2022-02-21 03:03:49,860 INFO L290 TraceCheckUtils]: 94: Hoare triple {14965#(<= 0 (+ |g_#in~x| 2147483571))} ~x := #in~x; {14952#(<= 0 (+ g_~x 2147483571))} is VALID [2022-02-21 03:03:49,860 INFO L272 TraceCheckUtils]: 93: Hoare triple {14969#(<= 0 (+ 2147483570 g_~x))} call #t~ret0 := g(~x - 1); {14965#(<= 0 (+ |g_#in~x| 2147483571))} is VALID [2022-02-21 03:03:49,861 INFO L290 TraceCheckUtils]: 92: Hoare triple {14969#(<= 0 (+ 2147483570 g_~x))} assume ~x - 1 >= -2147483648; {14969#(<= 0 (+ 2147483570 g_~x))} is VALID [2022-02-21 03:03:49,861 INFO L290 TraceCheckUtils]: 91: Hoare triple {14969#(<= 0 (+ 2147483570 g_~x))} assume ~x - 1 <= 2147483647; {14969#(<= 0 (+ 2147483570 g_~x))} is VALID [2022-02-21 03:03:49,861 INFO L290 TraceCheckUtils]: 90: Hoare triple {14969#(<= 0 (+ 2147483570 g_~x))} assume !(0 == ~x); {14969#(<= 0 (+ 2147483570 g_~x))} is VALID [2022-02-21 03:03:49,862 INFO L290 TraceCheckUtils]: 89: Hoare triple {14982#(<= 0 (+ 2147483570 |g_#in~x|))} ~x := #in~x; {14969#(<= 0 (+ 2147483570 g_~x))} is VALID [2022-02-21 03:03:49,866 INFO L272 TraceCheckUtils]: 88: Hoare triple {14986#(<= 0 (+ 2147483569 g_~x))} call #t~ret0 := g(~x - 1); {14982#(<= 0 (+ 2147483570 |g_#in~x|))} is VALID [2022-02-21 03:03:49,866 INFO L290 TraceCheckUtils]: 87: Hoare triple {14986#(<= 0 (+ 2147483569 g_~x))} assume ~x - 1 >= -2147483648; {14986#(<= 0 (+ 2147483569 g_~x))} is VALID [2022-02-21 03:03:49,866 INFO L290 TraceCheckUtils]: 86: Hoare triple {14986#(<= 0 (+ 2147483569 g_~x))} assume ~x - 1 <= 2147483647; {14986#(<= 0 (+ 2147483569 g_~x))} is VALID [2022-02-21 03:03:49,867 INFO L290 TraceCheckUtils]: 85: Hoare triple {14986#(<= 0 (+ 2147483569 g_~x))} assume !(0 == ~x); {14986#(<= 0 (+ 2147483569 g_~x))} is VALID [2022-02-21 03:03:49,867 INFO L290 TraceCheckUtils]: 84: Hoare triple {14999#(<= 0 (+ |g_#in~x| 2147483569))} ~x := #in~x; {14986#(<= 0 (+ 2147483569 g_~x))} is VALID [2022-02-21 03:03:49,867 INFO L272 TraceCheckUtils]: 83: Hoare triple {15003#(<= 0 (+ g_~x 2147483568))} call #t~ret0 := g(~x - 1); {14999#(<= 0 (+ |g_#in~x| 2147483569))} is VALID [2022-02-21 03:03:49,868 INFO L290 TraceCheckUtils]: 82: Hoare triple {15003#(<= 0 (+ g_~x 2147483568))} assume ~x - 1 >= -2147483648; {15003#(<= 0 (+ g_~x 2147483568))} is VALID [2022-02-21 03:03:49,868 INFO L290 TraceCheckUtils]: 81: Hoare triple {15003#(<= 0 (+ g_~x 2147483568))} assume ~x - 1 <= 2147483647; {15003#(<= 0 (+ g_~x 2147483568))} is VALID [2022-02-21 03:03:49,868 INFO L290 TraceCheckUtils]: 80: Hoare triple {15003#(<= 0 (+ g_~x 2147483568))} assume !(0 == ~x); {15003#(<= 0 (+ g_~x 2147483568))} is VALID [2022-02-21 03:03:49,869 INFO L290 TraceCheckUtils]: 79: Hoare triple {15016#(<= 0 (+ |g_#in~x| 2147483568))} ~x := #in~x; {15003#(<= 0 (+ g_~x 2147483568))} is VALID [2022-02-21 03:03:49,869 INFO L272 TraceCheckUtils]: 78: Hoare triple {15020#(<= 0 (+ 2147483567 g_~x))} call #t~ret0 := g(~x - 1); {15016#(<= 0 (+ |g_#in~x| 2147483568))} is VALID [2022-02-21 03:03:49,869 INFO L290 TraceCheckUtils]: 77: Hoare triple {15020#(<= 0 (+ 2147483567 g_~x))} assume ~x - 1 >= -2147483648; {15020#(<= 0 (+ 2147483567 g_~x))} is VALID [2022-02-21 03:03:49,870 INFO L290 TraceCheckUtils]: 76: Hoare triple {15020#(<= 0 (+ 2147483567 g_~x))} assume ~x - 1 <= 2147483647; {15020#(<= 0 (+ 2147483567 g_~x))} is VALID [2022-02-21 03:03:49,870 INFO L290 TraceCheckUtils]: 75: Hoare triple {15020#(<= 0 (+ 2147483567 g_~x))} assume !(0 == ~x); {15020#(<= 0 (+ 2147483567 g_~x))} is VALID [2022-02-21 03:03:49,870 INFO L290 TraceCheckUtils]: 74: Hoare triple {15033#(<= 0 (+ 2147483567 |g_#in~x|))} ~x := #in~x; {15020#(<= 0 (+ 2147483567 g_~x))} is VALID [2022-02-21 03:03:49,871 INFO L272 TraceCheckUtils]: 73: Hoare triple {15037#(<= 0 (+ g_~x 2147483566))} call #t~ret0 := g(~x - 1); {15033#(<= 0 (+ 2147483567 |g_#in~x|))} is VALID [2022-02-21 03:03:49,871 INFO L290 TraceCheckUtils]: 72: Hoare triple {15037#(<= 0 (+ g_~x 2147483566))} assume ~x - 1 >= -2147483648; {15037#(<= 0 (+ g_~x 2147483566))} is VALID [2022-02-21 03:03:49,871 INFO L290 TraceCheckUtils]: 71: Hoare triple {15037#(<= 0 (+ g_~x 2147483566))} assume ~x - 1 <= 2147483647; {15037#(<= 0 (+ g_~x 2147483566))} is VALID [2022-02-21 03:03:49,872 INFO L290 TraceCheckUtils]: 70: Hoare triple {15037#(<= 0 (+ g_~x 2147483566))} assume !(0 == ~x); {15037#(<= 0 (+ g_~x 2147483566))} is VALID [2022-02-21 03:03:49,872 INFO L290 TraceCheckUtils]: 69: Hoare triple {15050#(<= 0 (+ |g_#in~x| 2147483566))} ~x := #in~x; {15037#(<= 0 (+ g_~x 2147483566))} is VALID [2022-02-21 03:03:49,872 INFO L272 TraceCheckUtils]: 68: Hoare triple {15054#(<= 0 (+ 2147483565 g_~x))} call #t~ret0 := g(~x - 1); {15050#(<= 0 (+ |g_#in~x| 2147483566))} is VALID [2022-02-21 03:03:49,873 INFO L290 TraceCheckUtils]: 67: Hoare triple {15054#(<= 0 (+ 2147483565 g_~x))} assume ~x - 1 >= -2147483648; {15054#(<= 0 (+ 2147483565 g_~x))} is VALID [2022-02-21 03:03:49,873 INFO L290 TraceCheckUtils]: 66: Hoare triple {15054#(<= 0 (+ 2147483565 g_~x))} assume ~x - 1 <= 2147483647; {15054#(<= 0 (+ 2147483565 g_~x))} is VALID [2022-02-21 03:03:49,873 INFO L290 TraceCheckUtils]: 65: Hoare triple {15054#(<= 0 (+ 2147483565 g_~x))} assume !(0 == ~x); {15054#(<= 0 (+ 2147483565 g_~x))} is VALID [2022-02-21 03:03:49,874 INFO L290 TraceCheckUtils]: 64: Hoare triple {15067#(<= 0 (+ |g_#in~x| 2147483565))} ~x := #in~x; {15054#(<= 0 (+ 2147483565 g_~x))} is VALID [2022-02-21 03:03:49,874 INFO L272 TraceCheckUtils]: 63: Hoare triple {15071#(<= 0 (+ 2147483564 g_~x))} call #t~ret0 := g(~x - 1); {15067#(<= 0 (+ |g_#in~x| 2147483565))} is VALID [2022-02-21 03:03:49,874 INFO L290 TraceCheckUtils]: 62: Hoare triple {15071#(<= 0 (+ 2147483564 g_~x))} assume ~x - 1 >= -2147483648; {15071#(<= 0 (+ 2147483564 g_~x))} is VALID [2022-02-21 03:03:49,875 INFO L290 TraceCheckUtils]: 61: Hoare triple {15071#(<= 0 (+ 2147483564 g_~x))} assume ~x - 1 <= 2147483647; {15071#(<= 0 (+ 2147483564 g_~x))} is VALID [2022-02-21 03:03:49,875 INFO L290 TraceCheckUtils]: 60: Hoare triple {15071#(<= 0 (+ 2147483564 g_~x))} assume !(0 == ~x); {15071#(<= 0 (+ 2147483564 g_~x))} is VALID [2022-02-21 03:03:49,875 INFO L290 TraceCheckUtils]: 59: Hoare triple {15084#(<= 0 (+ 2147483564 |g_#in~x|))} ~x := #in~x; {15071#(<= 0 (+ 2147483564 g_~x))} is VALID [2022-02-21 03:03:49,876 INFO L272 TraceCheckUtils]: 58: Hoare triple {15088#(<= 0 (+ 2147483563 g_~x))} call #t~ret0 := g(~x - 1); {15084#(<= 0 (+ 2147483564 |g_#in~x|))} is VALID [2022-02-21 03:03:49,876 INFO L290 TraceCheckUtils]: 57: Hoare triple {15088#(<= 0 (+ 2147483563 g_~x))} assume ~x - 1 >= -2147483648; {15088#(<= 0 (+ 2147483563 g_~x))} is VALID [2022-02-21 03:03:49,876 INFO L290 TraceCheckUtils]: 56: Hoare triple {15088#(<= 0 (+ 2147483563 g_~x))} assume ~x - 1 <= 2147483647; {15088#(<= 0 (+ 2147483563 g_~x))} is VALID [2022-02-21 03:03:49,877 INFO L290 TraceCheckUtils]: 55: Hoare triple {15088#(<= 0 (+ 2147483563 g_~x))} assume !(0 == ~x); {15088#(<= 0 (+ 2147483563 g_~x))} is VALID [2022-02-21 03:03:49,877 INFO L290 TraceCheckUtils]: 54: Hoare triple {15101#(<= 0 (+ 2147483563 |g_#in~x|))} ~x := #in~x; {15088#(<= 0 (+ 2147483563 g_~x))} is VALID [2022-02-21 03:03:49,877 INFO L272 TraceCheckUtils]: 53: Hoare triple {15105#(<= 0 (+ g_~x 2147483562))} call #t~ret0 := g(~x - 1); {15101#(<= 0 (+ 2147483563 |g_#in~x|))} is VALID [2022-02-21 03:03:49,878 INFO L290 TraceCheckUtils]: 52: Hoare triple {15105#(<= 0 (+ g_~x 2147483562))} assume ~x - 1 >= -2147483648; {15105#(<= 0 (+ g_~x 2147483562))} is VALID [2022-02-21 03:03:49,878 INFO L290 TraceCheckUtils]: 51: Hoare triple {15105#(<= 0 (+ g_~x 2147483562))} assume ~x - 1 <= 2147483647; {15105#(<= 0 (+ g_~x 2147483562))} is VALID [2022-02-21 03:03:49,878 INFO L290 TraceCheckUtils]: 50: Hoare triple {15105#(<= 0 (+ g_~x 2147483562))} assume !(0 == ~x); {15105#(<= 0 (+ g_~x 2147483562))} is VALID [2022-02-21 03:03:49,878 INFO L290 TraceCheckUtils]: 49: Hoare triple {15118#(<= 0 (+ |g_#in~x| 2147483562))} ~x := #in~x; {15105#(<= 0 (+ g_~x 2147483562))} is VALID [2022-02-21 03:03:49,879 INFO L272 TraceCheckUtils]: 48: Hoare triple {15122#(<= 0 (+ g_~x 2147483561))} call #t~ret0 := g(~x - 1); {15118#(<= 0 (+ |g_#in~x| 2147483562))} is VALID [2022-02-21 03:03:49,879 INFO L290 TraceCheckUtils]: 47: Hoare triple {15122#(<= 0 (+ g_~x 2147483561))} assume ~x - 1 >= -2147483648; {15122#(<= 0 (+ g_~x 2147483561))} is VALID [2022-02-21 03:03:49,879 INFO L290 TraceCheckUtils]: 46: Hoare triple {15122#(<= 0 (+ g_~x 2147483561))} assume ~x - 1 <= 2147483647; {15122#(<= 0 (+ g_~x 2147483561))} is VALID [2022-02-21 03:03:49,880 INFO L290 TraceCheckUtils]: 45: Hoare triple {15122#(<= 0 (+ g_~x 2147483561))} assume !(0 == ~x); {15122#(<= 0 (+ g_~x 2147483561))} is VALID [2022-02-21 03:03:49,880 INFO L290 TraceCheckUtils]: 44: Hoare triple {15135#(<= 0 (+ |g_#in~x| 2147483561))} ~x := #in~x; {15122#(<= 0 (+ g_~x 2147483561))} is VALID [2022-02-21 03:03:49,880 INFO L272 TraceCheckUtils]: 43: Hoare triple {15139#(<= 0 (+ g_~x 2147483560))} call #t~ret0 := g(~x - 1); {15135#(<= 0 (+ |g_#in~x| 2147483561))} is VALID [2022-02-21 03:03:49,881 INFO L290 TraceCheckUtils]: 42: Hoare triple {15139#(<= 0 (+ g_~x 2147483560))} assume ~x - 1 >= -2147483648; {15139#(<= 0 (+ g_~x 2147483560))} is VALID [2022-02-21 03:03:49,881 INFO L290 TraceCheckUtils]: 41: Hoare triple {15139#(<= 0 (+ g_~x 2147483560))} assume ~x - 1 <= 2147483647; {15139#(<= 0 (+ g_~x 2147483560))} is VALID [2022-02-21 03:03:49,881 INFO L290 TraceCheckUtils]: 40: Hoare triple {15139#(<= 0 (+ g_~x 2147483560))} assume !(0 == ~x); {15139#(<= 0 (+ g_~x 2147483560))} is VALID [2022-02-21 03:03:49,882 INFO L290 TraceCheckUtils]: 39: Hoare triple {15152#(<= 0 (+ |g_#in~x| 2147483560))} ~x := #in~x; {15139#(<= 0 (+ g_~x 2147483560))} is VALID [2022-02-21 03:03:49,882 INFO L272 TraceCheckUtils]: 38: Hoare triple {15156#(<= 0 (+ g_~x 2147483559))} call #t~ret0 := g(~x - 1); {15152#(<= 0 (+ |g_#in~x| 2147483560))} is VALID [2022-02-21 03:03:49,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {15156#(<= 0 (+ g_~x 2147483559))} assume ~x - 1 >= -2147483648; {15156#(<= 0 (+ g_~x 2147483559))} is VALID [2022-02-21 03:03:49,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {15156#(<= 0 (+ g_~x 2147483559))} assume ~x - 1 <= 2147483647; {15156#(<= 0 (+ g_~x 2147483559))} is VALID [2022-02-21 03:03:49,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {15156#(<= 0 (+ g_~x 2147483559))} assume !(0 == ~x); {15156#(<= 0 (+ g_~x 2147483559))} is VALID [2022-02-21 03:03:49,883 INFO L290 TraceCheckUtils]: 34: Hoare triple {15169#(<= 0 (+ |g_#in~x| 2147483559))} ~x := #in~x; {15156#(<= 0 (+ g_~x 2147483559))} is VALID [2022-02-21 03:03:49,884 INFO L272 TraceCheckUtils]: 33: Hoare triple {15173#(<= 0 (+ 2147483558 g_~x))} call #t~ret0 := g(~x - 1); {15169#(<= 0 (+ |g_#in~x| 2147483559))} is VALID [2022-02-21 03:03:49,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {15173#(<= 0 (+ 2147483558 g_~x))} assume ~x - 1 >= -2147483648; {15173#(<= 0 (+ 2147483558 g_~x))} is VALID [2022-02-21 03:03:49,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {15173#(<= 0 (+ 2147483558 g_~x))} assume ~x - 1 <= 2147483647; {15173#(<= 0 (+ 2147483558 g_~x))} is VALID [2022-02-21 03:03:49,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {15173#(<= 0 (+ 2147483558 g_~x))} assume !(0 == ~x); {15173#(<= 0 (+ 2147483558 g_~x))} is VALID [2022-02-21 03:03:49,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {15186#(<= 0 (+ 2147483558 |g_#in~x|))} ~x := #in~x; {15173#(<= 0 (+ 2147483558 g_~x))} is VALID [2022-02-21 03:03:49,885 INFO L272 TraceCheckUtils]: 28: Hoare triple {15190#(<= 0 (+ g_~x 2147483557))} call #t~ret0 := g(~x - 1); {15186#(<= 0 (+ 2147483558 |g_#in~x|))} is VALID [2022-02-21 03:03:49,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {15190#(<= 0 (+ g_~x 2147483557))} assume ~x - 1 >= -2147483648; {15190#(<= 0 (+ g_~x 2147483557))} is VALID [2022-02-21 03:03:49,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {15190#(<= 0 (+ g_~x 2147483557))} assume ~x - 1 <= 2147483647; {15190#(<= 0 (+ g_~x 2147483557))} is VALID [2022-02-21 03:03:49,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {15190#(<= 0 (+ g_~x 2147483557))} assume !(0 == ~x); {15190#(<= 0 (+ g_~x 2147483557))} is VALID [2022-02-21 03:03:49,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {15203#(<= 0 (+ |g_#in~x| 2147483557))} ~x := #in~x; {15190#(<= 0 (+ g_~x 2147483557))} is VALID [2022-02-21 03:03:49,887 INFO L272 TraceCheckUtils]: 23: Hoare triple {15207#(<= 0 (+ g_~x 2147483556))} call #t~ret0 := g(~x - 1); {15203#(<= 0 (+ |g_#in~x| 2147483557))} is VALID [2022-02-21 03:03:49,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {15207#(<= 0 (+ g_~x 2147483556))} assume ~x - 1 >= -2147483648; {15207#(<= 0 (+ g_~x 2147483556))} is VALID [2022-02-21 03:03:49,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {15207#(<= 0 (+ g_~x 2147483556))} assume ~x - 1 <= 2147483647; {15207#(<= 0 (+ g_~x 2147483556))} is VALID [2022-02-21 03:03:49,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {15207#(<= 0 (+ g_~x 2147483556))} assume !(0 == ~x); {15207#(<= 0 (+ g_~x 2147483556))} is VALID [2022-02-21 03:03:49,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {15220#(<= 0 (+ |g_#in~x| 2147483556))} ~x := #in~x; {15207#(<= 0 (+ g_~x 2147483556))} is VALID [2022-02-21 03:03:49,890 INFO L272 TraceCheckUtils]: 18: Hoare triple {15224#(<= 0 (+ 2147483555 g_~x))} call #t~ret0 := g(~x - 1); {15220#(<= 0 (+ |g_#in~x| 2147483556))} is VALID [2022-02-21 03:03:49,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {15224#(<= 0 (+ 2147483555 g_~x))} assume ~x - 1 >= -2147483648; {15224#(<= 0 (+ 2147483555 g_~x))} is VALID [2022-02-21 03:03:49,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {15224#(<= 0 (+ 2147483555 g_~x))} assume ~x - 1 <= 2147483647; {15224#(<= 0 (+ 2147483555 g_~x))} is VALID [2022-02-21 03:03:49,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {15224#(<= 0 (+ 2147483555 g_~x))} assume !(0 == ~x); {15224#(<= 0 (+ 2147483555 g_~x))} is VALID [2022-02-21 03:03:49,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {15237#(<= 0 (+ 2147483555 |g_#in~x|))} ~x := #in~x; {15224#(<= 0 (+ 2147483555 g_~x))} is VALID [2022-02-21 03:03:49,891 INFO L272 TraceCheckUtils]: 13: Hoare triple {15241#(<= 0 (+ g_~x 2147483554))} call #t~ret0 := g(~x - 1); {15237#(<= 0 (+ 2147483555 |g_#in~x|))} is VALID [2022-02-21 03:03:49,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {15241#(<= 0 (+ g_~x 2147483554))} assume ~x - 1 >= -2147483648; {15241#(<= 0 (+ g_~x 2147483554))} is VALID [2022-02-21 03:03:49,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {15241#(<= 0 (+ g_~x 2147483554))} assume ~x - 1 <= 2147483647; {15241#(<= 0 (+ g_~x 2147483554))} is VALID [2022-02-21 03:03:49,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {15241#(<= 0 (+ g_~x 2147483554))} assume !(0 == ~x); {15241#(<= 0 (+ g_~x 2147483554))} is VALID [2022-02-21 03:03:49,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {15254#(<= 0 (+ |g_#in~x| 2147483554))} ~x := #in~x; {15241#(<= 0 (+ g_~x 2147483554))} is VALID [2022-02-21 03:03:49,893 INFO L272 TraceCheckUtils]: 8: Hoare triple {15258#(<= 0 (+ g_~x 2147483553))} call #t~ret0 := g(~x - 1); {15254#(<= 0 (+ |g_#in~x| 2147483554))} is VALID [2022-02-21 03:03:49,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {15258#(<= 0 (+ g_~x 2147483553))} assume ~x - 1 >= -2147483648; {15258#(<= 0 (+ g_~x 2147483553))} is VALID [2022-02-21 03:03:49,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {15258#(<= 0 (+ g_~x 2147483553))} assume ~x - 1 <= 2147483647; {15258#(<= 0 (+ g_~x 2147483553))} is VALID [2022-02-21 03:03:49,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {15258#(<= 0 (+ g_~x 2147483553))} assume !(0 == ~x); {15258#(<= 0 (+ g_~x 2147483553))} is VALID [2022-02-21 03:03:49,894 INFO L290 TraceCheckUtils]: 4: Hoare triple {15271#(<= 0 (+ |g_#in~x| 2147483553))} ~x := #in~x; {15258#(<= 0 (+ g_~x 2147483553))} is VALID [2022-02-21 03:03:49,894 INFO L272 TraceCheckUtils]: 3: Hoare triple {15275#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483553))} call main_#t~ret3#1 := g(main_~x~0#1); {15271#(<= 0 (+ |g_#in~x| 2147483553))} is VALID [2022-02-21 03:03:49,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {12036#true} assume !(main_~x~0#1 < 0); {15275#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483553))} is VALID [2022-02-21 03:03:49,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {12036#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {12036#true} is VALID [2022-02-21 03:03:49,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {12036#true} assume { :begin_inline_ULTIMATE.init } true; {12036#true} is VALID [2022-02-21 03:03:49,899 INFO L134 CoverageAnalysis]: Checked inductivity of 22231 backedges. 0 proven. 22231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:49,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751887211] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:49,899 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:49,899 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2022-02-21 03:03:49,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446811016] [2022-02-21 03:03:49,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:49,901 INFO L78 Accepts]: Start accepts. Automaton has has 384 states, 381 states have (on average 2.005249343832021) internal successors, (764), 194 states have internal predecessors, (764), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 478 [2022-02-21 03:03:49,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:49,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 384 states, 381 states have (on average 2.005249343832021) internal successors, (764), 194 states have internal predecessors, (764), 190 states have call successors, (190), 190 states have call predecessors, (190), 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 L122 InductivityCheck]: Floyd-Hoare automaton has 954 edges. 954 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:50,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2022-02-21 03:03:50,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:50,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2022-02-21 03:03:50,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36676, Invalid=110396, Unknown=0, NotChecked=0, Total=147072 [2022-02-21 03:03:50,553 INFO L87 Difference]: Start difference. First operand 479 states and 479 transitions. Second operand has 384 states, 381 states have (on average 2.005249343832021) internal successors, (764), 194 states have internal predecessors, (764), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)