/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:54:10,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:54:10,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:54:10,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:54:10,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:54:10,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:54:10,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:54:10,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:54:10,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:54:10,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:54:10,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:54:10,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:54:10,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:54:10,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:54:10,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:54:10,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:54:10,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:54:10,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:54:10,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:54:10,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:54:10,943 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:54:10,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:54:10,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:54:10,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:54:10,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:54:10,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:54:10,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:54:10,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:54:10,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:54:10,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:54:10,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:54:10,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:54:10,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:54:10,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:54:10,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:54:10,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:54:10,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:54:10,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:54:10,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:54:10,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:54:10,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:54:10,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:54:10,957 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:54:10,984 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:54:10,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:54:10,985 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:54:10,985 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:54:10,986 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:54:10,986 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:54:10,986 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:54:10,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:54:10,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:54:10,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:54:10,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:54:10,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:54:10,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:54:10,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:54:10,988 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:54:10,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:54:10,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:54:10,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:54:10,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:54:10,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:54:10,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:54:10,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:54:10,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:54:10,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:54:10,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:54:10,990 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:54:10,990 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:54:10,990 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:54:10,991 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:54:10,991 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:54:11,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:54:11,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:54:11,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:54:11,265 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:54:11,266 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:54:11,266 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2022-04-27 21:54:11,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb074e5f6/b94c3cf13d3740c98629510f3b630fc9/FLAG9d07a30a5 [2022-04-27 21:54:11,719 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:54:11,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2022-04-27 21:54:11,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb074e5f6/b94c3cf13d3740c98629510f3b630fc9/FLAG9d07a30a5 [2022-04-27 21:54:12,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb074e5f6/b94c3cf13d3740c98629510f3b630fc9 [2022-04-27 21:54:12,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:54:12,145 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:54:12,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:54:12,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:54:12,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:54:12,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:54:12" (1/1) ... [2022-04-27 21:54:12,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf6d154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:12, skipping insertion in model container [2022-04-27 21:54:12,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:54:12" (1/1) ... [2022-04-27 21:54:12,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:54:12,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:54:12,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c[311,324] [2022-04-27 21:54:12,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:54:12,345 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:54:12,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c[311,324] [2022-04-27 21:54:12,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:54:12,380 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:54:12,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:12 WrapperNode [2022-04-27 21:54:12,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:54:12,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:54:12,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:54:12,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:54:12,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:12" (1/1) ... [2022-04-27 21:54:12,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:12" (1/1) ... [2022-04-27 21:54:12,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:12" (1/1) ... [2022-04-27 21:54:12,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:12" (1/1) ... [2022-04-27 21:54:12,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:12" (1/1) ... [2022-04-27 21:54:12,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:12" (1/1) ... [2022-04-27 21:54:12,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:12" (1/1) ... [2022-04-27 21:54:12,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:54:12,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:54:12,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:54:12,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:54:12,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:12" (1/1) ... [2022-04-27 21:54:12,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:54:12,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:54:12,444 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-04-27 21:54:12,468 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-04-27 21:54:12,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:54:12,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:54:12,483 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:54:12,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:54:12,483 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:54:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:54:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:54:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:54:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:54:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:54:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:54:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:54:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:54:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:54:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:54:12,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:54:12,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:54:12,544 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:54:12,548 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:54:12,703 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:54:12,709 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:54:12,709 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:54:12,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:54:12 BoogieIcfgContainer [2022-04-27 21:54:12,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:54:12,711 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:54:12,711 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:54:12,712 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:54:12,716 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:54:12" (1/1) ... [2022-04-27 21:54:12,720 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:54:12,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:54:12 BasicIcfg [2022-04-27 21:54:12,757 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:54:12,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:54:12,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:54:12,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:54:12,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:54:12" (1/4) ... [2022-04-27 21:54:12,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cba10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:54:12, skipping insertion in model container [2022-04-27 21:54:12,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:54:12" (2/4) ... [2022-04-27 21:54:12,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cba10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:54:12, skipping insertion in model container [2022-04-27 21:54:12,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:54:12" (3/4) ... [2022-04-27 21:54:12,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cba10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:54:12, skipping insertion in model container [2022-04-27 21:54:12,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:54:12" (4/4) ... [2022-04-27 21:54:12,764 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono6_1.cqvasr [2022-04-27 21:54:12,774 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:54:12,774 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:54:12,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:54:12,861 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4cd31556, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e71427c [2022-04-27 21:54:12,861 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:54:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:54:12,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:54:12,873 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:54:12,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:54:12,874 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:54:12,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:54:12,879 INFO L85 PathProgramCache]: Analyzing trace with hash 447419557, now seen corresponding path program 1 times [2022-04-27 21:54:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:54:12,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283781461] [2022-04-27 21:54:12,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:54:12,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:54:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:13,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:54:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:13,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 21:54:13,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:54:13,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:54:13,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:54:13,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 21:54:13,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:54:13,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:54:13,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:54:13,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {24#true} is VALID [2022-04-27 21:54:13,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [53] L10-2-->L10-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:54:13,091 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {25#false} is VALID [2022-04-27 21:54:13,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-27 21:54:13,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:54:13,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:54:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:54:13,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:54:13,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283781461] [2022-04-27 21:54:13,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283781461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:54:13,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:54:13,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:54:13,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725010550] [2022-04-27 21:54:13,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:54:13,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 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 11 [2022-04-27 21:54:13,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:54:13,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:54:13,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:54:13,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:54:13,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:54:13,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:54:13,140 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:13,195 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-27 21:54:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:54:13,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 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 11 [2022-04-27 21:54:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:54:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 21:54:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 21:54:13,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-27 21:54:13,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:54:13,253 INFO L225 Difference]: With dead ends: 33 [2022-04-27 21:54:13,253 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 21:54:13,256 INFO L412 NwaCegarLoop]: 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-04-27 21:54:13,258 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:54:13,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:54:13,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 21:54:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 21:54:13,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:54:13,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,290 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,290 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:13,292 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 21:54:13,292 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 21:54:13,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:54:13,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:54:13,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 21:54:13,293 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 21:54:13,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:13,296 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 21:54:13,296 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 21:54:13,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:54:13,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:54:13,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:54:13,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:54:13,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 21:54:13,301 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-27 21:54:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:54:13,302 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 21:54:13,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 21:54:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:54:13,303 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:54:13,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:54:13,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:54:13,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:54:13,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:54:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash 448343078, now seen corresponding path program 1 times [2022-04-27 21:54:13,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:54:13,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367679512] [2022-04-27 21:54:13,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:54:13,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:54:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:13,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:54:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:13,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {129#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {123#true} is VALID [2022-04-27 21:54:13,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:54:13,464 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123#true} {123#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:54:13,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {123#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:54:13,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {123#true} is VALID [2022-04-27 21:54:13,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:54:13,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123#true} {123#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:54:13,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {123#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:54:13,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {123#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {128#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 21:54:13,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-27 21:54:13,469 INFO L272 TraceCheckUtils]: 7: Hoare triple {124#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {124#false} is VALID [2022-04-27 21:54:13,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {124#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {124#false} is VALID [2022-04-27 21:54:13,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {124#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-27 21:54:13,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {124#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-27 21:54:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:54:13,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:54:13,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367679512] [2022-04-27 21:54:13,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367679512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:54:13,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:54:13,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:54:13,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396675157] [2022-04-27 21:54:13,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:54:13,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 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 11 [2022-04-27 21:54:13,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:54:13,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:54:13,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:54:13,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:54:13,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:54:13,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:54:13,492 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:13,600 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 21:54:13,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:54:13,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 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 11 [2022-04-27 21:54:13,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:54:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-27 21:54:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-27 21:54:13,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-04-27 21:54:13,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:54:13,635 INFO L225 Difference]: With dead ends: 25 [2022-04-27 21:54:13,635 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 21:54:13,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:54:13,637 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:54:13,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:54:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 21:54:13,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-27 21:54:13,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:54:13,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,642 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,643 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:13,644 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 21:54:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 21:54:13,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:54:13,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:54:13,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 21:54:13,645 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 21:54:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:13,647 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 21:54:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 21:54:13,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:54:13,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:54:13,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:54:13,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:54:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-27 21:54:13,649 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-27 21:54:13,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:54:13,649 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-27 21:54:13,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 21:54:13,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:54:13,650 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:54:13,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:54:13,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:54:13,650 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:54:13,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:54:13,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1516694440, now seen corresponding path program 1 times [2022-04-27 21:54:13,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:54:13,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176276323] [2022-04-27 21:54:13,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:54:13,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:54:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:13,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:54:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:13,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {228#true} is VALID [2022-04-27 21:54:13,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-27 21:54:13,846 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-27 21:54:13,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:54:13,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {228#true} is VALID [2022-04-27 21:54:13,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-27 21:54:13,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-27 21:54:13,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-27 21:54:13,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {233#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} is VALID [2022-04-27 21:54:13,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {233#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {233#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} is VALID [2022-04-27 21:54:13,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {233#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} is VALID [2022-04-27 21:54:13,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {233#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {234#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-27 21:54:13,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999999 main_~x~0) main_~y~0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-27 21:54:13,865 INFO L272 TraceCheckUtils]: 10: Hoare triple {229#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {229#false} is VALID [2022-04-27 21:54:13,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {229#false} is VALID [2022-04-27 21:54:13,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {229#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-27 21:54:13,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-27 21:54:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:54:13,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:54:13,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176276323] [2022-04-27 21:54:13,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176276323] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:54:13,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737930798] [2022-04-27 21:54:13,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:54:13,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:54:13,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:54:13,875 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-04-27 21:54:13,886 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-04-27 21:54:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:13,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 21:54:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:13,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:54:14,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-27 21:54:14,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {228#true} is VALID [2022-04-27 21:54:14,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-27 21:54:14,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-27 21:54:14,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-27 21:54:14,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {254#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:14,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {254#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {254#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:14,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {254#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:14,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {254#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {264#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:14,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {264#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:14,143 INFO L272 TraceCheckUtils]: 10: Hoare triple {264#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {271#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:54:14,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {271#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {275#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:54:14,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {275#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-27 21:54:14,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-27 21:54:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:54:14,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:54:14,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-27 21:54:14,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {275#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {229#false} is VALID [2022-04-27 21:54:14,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {271#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {275#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:54:14,307 INFO L272 TraceCheckUtils]: 10: Hoare triple {291#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {271#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:54:14,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {291#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {291#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:54:14,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {298#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {291#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:54:14,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {298#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {298#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:54:14,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {298#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {298#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:54:14,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {298#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:54:14,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-27 21:54:14,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-27 21:54:14,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-27 21:54:14,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {228#true} is VALID [2022-04-27 21:54:14,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#true} is VALID [2022-04-27 21:54:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:54:14,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737930798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:54:14,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:54:14,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-04-27 21:54:14,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155588736] [2022-04-27 21:54:14,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:54:14,318 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:54:14,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:54:14,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:14,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:54:14,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 21:54:14,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:54:14,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 21:54:14,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 21:54:14,347 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:14,788 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-27 21:54:14,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 21:54:14,788 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:54:14,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:54:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-27 21:54:14,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-27 21:54:14,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2022-04-27 21:54:14,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:54:14,864 INFO L225 Difference]: With dead ends: 39 [2022-04-27 21:54:14,864 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 21:54:14,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-04-27 21:54:14,865 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:54:14,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 41 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:54:14,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 21:54:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-27 21:54:14,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:54:14,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:14,873 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:14,873 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:14,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:14,875 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 21:54:14,875 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 21:54:14,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:54:14,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:54:14,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-27 21:54:14,876 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-27 21:54:14,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:14,878 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 21:54:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 21:54:14,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:54:14,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:54:14,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:54:14,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:54:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-27 21:54:14,880 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-04-27 21:54:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:54:14,880 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-27 21:54:14,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 21:54:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 21:54:14,881 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:54:14,881 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:54:14,910 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-04-27 21:54:15,095 WARN L477 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-04-27 21:54:15,096 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:54:15,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:54:15,096 INFO L85 PathProgramCache]: Analyzing trace with hash -691789689, now seen corresponding path program 1 times [2022-04-27 21:54:15,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:54:15,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571669697] [2022-04-27 21:54:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:54:15,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:54:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:15,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:54:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:15,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {485#true} is VALID [2022-04-27 21:54:15,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-27 21:54:15,222 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {485#true} {485#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-27 21:54:15,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {485#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:54:15,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {485#true} is VALID [2022-04-27 21:54:15,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-27 21:54:15,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-27 21:54:15,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {485#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-27 21:54:15,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {490#(= main_~x~0 0)} is VALID [2022-04-27 21:54:15,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {490#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {490#(= main_~x~0 0)} is VALID [2022-04-27 21:54:15,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {490#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {490#(= main_~x~0 0)} is VALID [2022-04-27 21:54:15,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {490#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:54:15,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:54:15,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:54:15,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {492#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 21:54:15,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {492#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {492#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 21:54:15,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {492#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {486#false} is VALID [2022-04-27 21:54:15,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {486#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {486#false} is VALID [2022-04-27 21:54:15,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {486#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-27 21:54:15,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {486#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-27 21:54:15,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {486#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {486#false} is VALID [2022-04-27 21:54:15,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {486#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-27 21:54:15,229 INFO L272 TraceCheckUtils]: 19: Hoare triple {486#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {486#false} is VALID [2022-04-27 21:54:15,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {486#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {486#false} is VALID [2022-04-27 21:54:15,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {486#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-27 21:54:15,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {486#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-27 21:54:15,230 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 21:54:15,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:54:15,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571669697] [2022-04-27 21:54:15,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571669697] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:54:15,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490031346] [2022-04-27 21:54:15,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:54:15,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:54:15,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:54:15,232 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-04-27 21:54:15,233 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-04-27 21:54:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:15,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 21:54:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:15,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:54:15,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {485#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-27 21:54:15,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {485#true} is VALID [2022-04-27 21:54:15,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-27 21:54:15,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-27 21:54:15,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {485#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-27 21:54:15,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {490#(= main_~x~0 0)} is VALID [2022-04-27 21:54:15,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {490#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {490#(= main_~x~0 0)} is VALID [2022-04-27 21:54:15,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {490#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {490#(= main_~x~0 0)} is VALID [2022-04-27 21:54:15,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {490#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:54:15,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:54:15,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:54:15,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {530#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:54:15,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {530#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {530#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:54:15,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {530#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {486#false} is VALID [2022-04-27 21:54:15,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {486#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {486#false} is VALID [2022-04-27 21:54:15,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {486#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-27 21:54:15,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {486#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-27 21:54:15,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {486#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {486#false} is VALID [2022-04-27 21:54:15,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {486#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-27 21:54:15,624 INFO L272 TraceCheckUtils]: 19: Hoare triple {486#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {486#false} is VALID [2022-04-27 21:54:15,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {486#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {486#false} is VALID [2022-04-27 21:54:15,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {486#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-27 21:54:15,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {486#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-27 21:54:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 21:54:15,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:54:15,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {486#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-27 21:54:15,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {486#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-27 21:54:15,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {486#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {486#false} is VALID [2022-04-27 21:54:15,923 INFO L272 TraceCheckUtils]: 19: Hoare triple {486#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {486#false} is VALID [2022-04-27 21:54:15,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {486#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-27 21:54:15,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {486#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {486#false} is VALID [2022-04-27 21:54:15,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {486#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-27 21:54:15,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {486#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-27 21:54:15,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {486#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {486#false} is VALID [2022-04-27 21:54:15,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {591#(not (<= 5000000 (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {486#false} is VALID [2022-04-27 21:54:15,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {595#(or (<= 4294967295 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod main_~x~0 4294967296))))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {591#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:54:15,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {599#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {595#(or (<= 4294967295 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 21:54:15,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {599#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {599#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:54:15,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {599#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {599#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:54:15,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {599#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:54:15,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {609#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-27 21:54:15,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {609#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {609#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-27 21:54:15,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {609#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-27 21:54:15,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {485#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-27 21:54:15,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-27 21:54:15,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-27 21:54:15,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {485#true} is VALID [2022-04-27 21:54:15,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {485#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-27 21:54:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 21:54:15,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490031346] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:54:15,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:54:15,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-04-27 21:54:15,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149495182] [2022-04-27 21:54:15,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:54:15,939 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 21:54:15,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:54:15,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:15,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:54:15,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 21:54:15,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:54:15,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 21:54:15,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-27 21:54:15,990 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:16,343 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-04-27 21:54:16,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:54:16,343 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 21:54:16,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:54:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 21:54:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 21:54:16,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-27 21:54:16,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:54:16,404 INFO L225 Difference]: With dead ends: 45 [2022-04-27 21:54:16,404 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 21:54:16,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-04-27 21:54:16,405 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 44 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:54:16,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 28 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:54:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 21:54:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-27 21:54:16,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:54:16,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:16,420 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:16,421 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:16,422 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 21:54:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-27 21:54:16,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:54:16,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:54:16,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-27 21:54:16,423 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-27 21:54:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:16,425 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 21:54:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-27 21:54:16,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:54:16,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:54:16,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:54:16,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:54:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-27 21:54:16,427 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2022-04-27 21:54:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:54:16,427 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-27 21:54:16,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 21:54:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 21:54:16,428 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:54:16,428 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:54:16,453 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-04-27 21:54:16,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 21:54:16,652 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:54:16,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:54:16,652 INFO L85 PathProgramCache]: Analyzing trace with hash -888303194, now seen corresponding path program 2 times [2022-04-27 21:54:16,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:54:16,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958119400] [2022-04-27 21:54:16,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:54:16,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:54:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:16,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:54:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:16,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {824#true} is VALID [2022-04-27 21:54:16,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {824#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {824#true} is VALID [2022-04-27 21:54:16,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {824#true} {824#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {824#true} is VALID [2022-04-27 21:54:16,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {824#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:54:16,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {824#true} is VALID [2022-04-27 21:54:16,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {824#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {824#true} is VALID [2022-04-27 21:54:16,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {824#true} {824#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {824#true} is VALID [2022-04-27 21:54:16,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {824#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {824#true} is VALID [2022-04-27 21:54:16,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {824#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {829#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 21:54:16,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {829#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {829#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 21:54:16,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {829#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {829#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 21:54:16,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {829#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {830#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-27 21:54:16,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {830#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {830#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-27 21:54:16,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {830#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {830#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-27 21:54:16,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {830#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {831#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} is VALID [2022-04-27 21:54:16,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {831#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} is VALID [2022-04-27 21:54:16,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {831#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} is VALID [2022-04-27 21:54:16,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {832#(and (or (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= main_~y~0 (+ main_~x~0 9999997))) (<= (+ main_~x~0 9999997) main_~y~0))} is VALID [2022-04-27 21:54:16,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {832#(and (or (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= main_~y~0 (+ main_~x~0 9999997))) (<= (+ main_~x~0 9999997) main_~y~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {833#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 9999997) main_~y~0))} is VALID [2022-04-27 21:54:16,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {833#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 9999997) main_~y~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {833#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 9999997) main_~y~0))} is VALID [2022-04-27 21:54:16,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {833#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 9999997) main_~y~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {834#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999996 main_~x~0) main_~y~0))} is VALID [2022-04-27 21:54:16,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {834#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999996 main_~x~0) main_~y~0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {825#false} is VALID [2022-04-27 21:54:16,869 INFO L272 TraceCheckUtils]: 19: Hoare triple {825#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {825#false} is VALID [2022-04-27 21:54:16,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {825#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {825#false} is VALID [2022-04-27 21:54:16,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {825#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {825#false} is VALID [2022-04-27 21:54:16,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {825#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {825#false} is VALID [2022-04-27 21:54:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:54:16,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:54:16,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958119400] [2022-04-27 21:54:16,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958119400] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:54:16,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654229778] [2022-04-27 21:54:16,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:54:16,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:54:16,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:54:16,876 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-04-27 21:54:16,877 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-04-27 21:54:16,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 21:54:16,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:54:16,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 21:54:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:16,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:54:17,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {824#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {824#true} is VALID [2022-04-27 21:54:17,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {824#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {824#true} is VALID [2022-04-27 21:54:17,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {824#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {824#true} is VALID [2022-04-27 21:54:17,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {824#true} {824#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {824#true} is VALID [2022-04-27 21:54:17,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {824#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {824#true} is VALID [2022-04-27 21:54:17,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {824#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:17,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:17,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:17,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:17,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:17,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:17,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:17,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:17,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:17,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:17,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:17,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:17,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:17,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {894#(and (not (< (mod main_~x~0 4294967296) 10000000)) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:17,201 INFO L272 TraceCheckUtils]: 19: Hoare triple {894#(and (not (< (mod main_~x~0 4294967296) 10000000)) (= 5000000 main_~z~0))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {898#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:54:17,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {898#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {902#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:54:17,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {902#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {825#false} is VALID [2022-04-27 21:54:17,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {825#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {825#false} is VALID [2022-04-27 21:54:17,202 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 21:54:17,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 21:54:17,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654229778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:54:17,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 21:54:17,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-04-27 21:54:17,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077697171] [2022-04-27 21:54:17,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:54:17,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 23 [2022-04-27 21:54:17,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:54:17,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-04-27 21:54:17,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:54:17,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:54:17,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:54:17,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:54:17,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-04-27 21:54:17,218 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-04-27 21:54:17,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:17,315 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 21:54:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:54:17,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 23 [2022-04-27 21:54:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:54:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-04-27 21:54:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 21:54:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-04-27 21:54:17,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 21:54:17,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-27 21:54:17,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:54:17,342 INFO L225 Difference]: With dead ends: 39 [2022-04-27 21:54:17,342 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 21:54:17,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-27 21:54:17,343 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:54:17,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:54:17,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 21:54:17,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 21:54:17,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:54:17,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:17,357 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:17,357 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:17,359 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 21:54:17,359 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 21:54:17,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:54:17,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:54:17,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-27 21:54:17,360 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-27 21:54:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:17,365 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 21:54:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 21:54:17,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:54:17,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:54:17,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:54:17,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:54:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-04-27 21:54:17,368 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 23 [2022-04-27 21:54:17,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:54:17,370 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-04-27 21:54:17,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-04-27 21:54:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 21:54:17,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 21:54:17,372 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:54:17,372 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:54:17,398 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-04-27 21:54:17,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:54:17,580 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:54:17,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:54:17,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1647316777, now seen corresponding path program 2 times [2022-04-27 21:54:17,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:54:17,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700267784] [2022-04-27 21:54:17,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:54:17,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:54:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:17,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:54:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:17,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {1095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1083#true} is VALID [2022-04-27 21:54:17,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {1083#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1083#true} is VALID [2022-04-27 21:54:17,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1083#true} {1083#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1083#true} is VALID [2022-04-27 21:54:17,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {1083#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:54:17,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {1095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1083#true} is VALID [2022-04-27 21:54:17,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {1083#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1083#true} is VALID [2022-04-27 21:54:17,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1083#true} {1083#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1083#true} is VALID [2022-04-27 21:54:17,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {1083#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1083#true} is VALID [2022-04-27 21:54:17,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {1083#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1088#(= main_~x~0 0)} is VALID [2022-04-27 21:54:17,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {1088#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1088#(= main_~x~0 0)} is VALID [2022-04-27 21:54:17,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {1088#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1088#(= main_~x~0 0)} is VALID [2022-04-27 21:54:17,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {1088#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1089#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:54:17,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {1089#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1089#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:54:17,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {1089#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1089#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:54:17,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {1089#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1090#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:54:17,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {1090#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1090#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:54:17,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {1090#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1090#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:54:17,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {1090#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1091#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:54:17,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {1091#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1091#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:54:17,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {1091#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1091#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:54:17,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {1091#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1092#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:54:17,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {1092#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1092#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:54:17,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {1092#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1092#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:54:17,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {1092#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1093#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:54:17,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {1093#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1093#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:54:17,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {1093#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1093#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:54:17,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {1093#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1094#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-27 21:54:17,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {1094#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1094#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-27 21:54:17,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {1094#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1084#false} is VALID [2022-04-27 21:54:17,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {1084#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1084#false} is VALID [2022-04-27 21:54:17,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {1084#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1084#false} is VALID [2022-04-27 21:54:17,780 INFO L272 TraceCheckUtils]: 28: Hoare triple {1084#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {1084#false} is VALID [2022-04-27 21:54:17,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {1084#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1084#false} is VALID [2022-04-27 21:54:17,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {1084#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1084#false} is VALID [2022-04-27 21:54:17,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {1084#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1084#false} is VALID [2022-04-27 21:54:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:54:17,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:54:17,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700267784] [2022-04-27 21:54:17,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700267784] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:54:17,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854890124] [2022-04-27 21:54:17,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:54:17,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:54:17,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:54:17,782 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-04-27 21:54:17,783 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-04-27 21:54:17,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 21:54:17,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:54:17,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 21:54:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:54:17,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:54:18,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {1083#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1083#true} is VALID [2022-04-27 21:54:18,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {1083#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1083#true} is VALID [2022-04-27 21:54:18,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {1083#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1083#true} is VALID [2022-04-27 21:54:18,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1083#true} {1083#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1083#true} is VALID [2022-04-27 21:54:18,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {1083#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1083#true} is VALID [2022-04-27 21:54:18,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {1083#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1114#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:18,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {1114#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1114#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:18,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {1114#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1114#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:18,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {1114#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1124#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:18,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {1124#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1124#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:18,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {1124#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1124#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:18,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {1124#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1134#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 21:54:18,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {1134#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1134#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 21:54:18,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {1134#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1134#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 21:54:18,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {1134#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1144#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} is VALID [2022-04-27 21:54:18,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {1144#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1144#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} is VALID [2022-04-27 21:54:18,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {1144#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1144#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} is VALID [2022-04-27 21:54:18,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {1144#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1154#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 21:54:18,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {1154#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1154#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 21:54:18,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {1154#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1154#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 21:54:18,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {1154#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1164#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:18,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {1164#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1164#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:18,213 INFO L290 TraceCheckUtils]: 22: Hoare triple {1164#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1164#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:18,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {1164#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1174#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:18,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {1174#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1174#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:54:18,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {1174#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1181#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 21:54:18,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {1181#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 (+ (- 1) main_~z~0)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1185#(and (= (+ main_~x~0 (- 3)) 4) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 21:54:18,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {1185#(and (= (+ main_~x~0 (- 3)) 4) (= 5000000 (+ (- 1) main_~z~0)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1185#(and (= (+ main_~x~0 (- 3)) 4) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 21:54:18,220 INFO L272 TraceCheckUtils]: 28: Hoare triple {1185#(and (= (+ main_~x~0 (- 3)) 4) (= 5000000 (+ (- 1) main_~z~0)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {1192#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:54:18,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {1192#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1196#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:54:18,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {1196#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1084#false} is VALID [2022-04-27 21:54:18,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {1084#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1084#false} is VALID [2022-04-27 21:54:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:54:18,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:54:18,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {1084#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1084#false} is VALID [2022-04-27 21:54:18,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {1196#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1084#false} is VALID [2022-04-27 21:54:18,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {1192#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1196#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:54:18,579 INFO L272 TraceCheckUtils]: 28: Hoare triple {1212#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {1192#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:54:18,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1212#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:54:18,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {1219#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1212#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:54:18,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {1212#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1219#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:54:18,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {1212#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1212#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:54:18,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {1219#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1212#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:54:18,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {1219#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1219#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:54:18,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {1219#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1219#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:54:18,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {1238#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1219#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:54:18,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {1238#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1238#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:54:18,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {1238#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1238#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:54:18,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {1248#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1238#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:54:18,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {1248#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1248#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:54:18,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {1248#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1248#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:54:18,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {1258#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1248#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:54:18,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {1258#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1258#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 21:54:18,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {1258#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1258#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 21:54:18,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {1268#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1258#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 21:54:18,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {1268#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1268#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:54:18,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {1268#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1268#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:54:18,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {1278#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1268#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:54:18,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {1278#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1278#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 21:54:18,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {1278#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1278#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 21:54:18,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {1083#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1278#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 21:54:18,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {1083#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1083#true} is VALID [2022-04-27 21:54:18,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1083#true} {1083#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1083#true} is VALID [2022-04-27 21:54:18,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {1083#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1083#true} is VALID [2022-04-27 21:54:18,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {1083#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1083#true} is VALID [2022-04-27 21:54:18,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {1083#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1083#true} is VALID [2022-04-27 21:54:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 21:54:18,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854890124] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:54:18,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:54:18,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 28 [2022-04-27 21:54:18,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241732335] [2022-04-27 21:54:18,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:54:18,600 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 21:54:18,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:54:18,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:18,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:54:18,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 21:54:18,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:54:18,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 21:54:18,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2022-04-27 21:54:18,679 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:22,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:54:25,516 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:54:28,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:54:32,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:54:36,699 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:54:41,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:54:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:54:51,105 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2022-04-27 21:54:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-27 21:54:51,105 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 21:54:51,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:54:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 115 transitions. [2022-04-27 21:54:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:54:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 115 transitions. [2022-04-27 21:54:51,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 115 transitions. [2022-04-27 21:55:03,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 110 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-27 21:55:03,313 INFO L225 Difference]: With dead ends: 108 [2022-04-27 21:55:03,313 INFO L226 Difference]: Without dead ends: 91 [2022-04-27 21:55:03,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=573, Invalid=2397, Unknown=0, NotChecked=0, Total=2970 [2022-04-27 21:55:03,315 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 54 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 45 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:55:03,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 99 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 600 Invalid, 5 Unknown, 0 Unchecked, 17.3s Time] [2022-04-27 21:55:03,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-27 21:55:03,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2022-04-27 21:55:03,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:55:03,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 82 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 77 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:55:03,358 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 82 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 77 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:55:03,359 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 82 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 77 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:55:03,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:55:03,362 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2022-04-27 21:55:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2022-04-27 21:55:03,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:55:03,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:55:03,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 77 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-27 21:55:03,363 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 77 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-27 21:55:03,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:55:03,365 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2022-04-27 21:55:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2022-04-27 21:55:03,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:55:03,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:55:03,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:55:03,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:55:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 77 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:55:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2022-04-27 21:55:03,368 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 32 [2022-04-27 21:55:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:55:03,369 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2022-04-27 21:55:03,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:55:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2022-04-27 21:55:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 21:55:03,370 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:55:03,370 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:55:03,397 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-04-27 21:55:03,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:55:03,594 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:55:03,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:55:03,595 INFO L85 PathProgramCache]: Analyzing trace with hash -784123847, now seen corresponding path program 3 times [2022-04-27 21:55:03,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:55:03,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160662096] [2022-04-27 21:55:03,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:55:03,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:55:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:55:03,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:55:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:55:03,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {1816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1803#true} is VALID [2022-04-27 21:55:03,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {1803#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1803#true} is VALID [2022-04-27 21:55:03,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1803#true} {1803#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1803#true} is VALID [2022-04-27 21:55:03,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {1803#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:55:03,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {1816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1803#true} is VALID [2022-04-27 21:55:03,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {1803#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1803#true} is VALID [2022-04-27 21:55:03,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1803#true} {1803#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1803#true} is VALID [2022-04-27 21:55:03,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {1803#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1803#true} is VALID [2022-04-27 21:55:03,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {1803#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1808#(= main_~x~0 0)} is VALID [2022-04-27 21:55:03,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {1808#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1808#(= main_~x~0 0)} is VALID [2022-04-27 21:55:03,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {1808#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1808#(= main_~x~0 0)} is VALID [2022-04-27 21:55:03,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {1808#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1809#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:55:03,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {1809#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1809#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:55:03,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {1809#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1809#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:55:03,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {1809#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1810#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:55:03,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {1810#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1810#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:55:03,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {1810#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1810#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:55:03,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {1810#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1811#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:55:03,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {1811#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1811#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:55:03,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {1811#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1811#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:55:03,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {1811#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1812#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:55:03,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {1812#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1812#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:55:03,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {1812#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1812#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:55:03,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {1812#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1813#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:55:03,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {1813#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1813#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:55:03,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {1813#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1813#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:55:03,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {1813#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1814#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:55:03,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {1814#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1814#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:55:03,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {1814#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1814#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:55:03,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {1814#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1815#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 21:55:03,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {1815#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1815#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 21:55:03,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {1815#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1804#false} is VALID [2022-04-27 21:55:03,821 INFO L290 TraceCheckUtils]: 29: Hoare triple {1804#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1804#false} is VALID [2022-04-27 21:55:03,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {1804#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1804#false} is VALID [2022-04-27 21:55:03,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {1804#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1804#false} is VALID [2022-04-27 21:55:03,822 INFO L290 TraceCheckUtils]: 32: Hoare triple {1804#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1804#false} is VALID [2022-04-27 21:55:03,822 INFO L290 TraceCheckUtils]: 33: Hoare triple {1804#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1804#false} is VALID [2022-04-27 21:55:03,822 INFO L272 TraceCheckUtils]: 34: Hoare triple {1804#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {1804#false} is VALID [2022-04-27 21:55:03,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {1804#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1804#false} is VALID [2022-04-27 21:55:03,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {1804#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1804#false} is VALID [2022-04-27 21:55:03,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {1804#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1804#false} is VALID [2022-04-27 21:55:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 38 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 21:55:03,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:55:03,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160662096] [2022-04-27 21:55:03,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160662096] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:55:03,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119753003] [2022-04-27 21:55:03,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 21:55:03,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:55:03,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:55:03,828 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-04-27 21:55:03,830 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-04-27 21:55:03,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 21:55:03,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:55:03,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 21:55:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:55:03,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:55:04,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {1803#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1803#true} is VALID [2022-04-27 21:55:04,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {1803#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1803#true} is VALID [2022-04-27 21:55:04,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {1803#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1803#true} is VALID [2022-04-27 21:55:04,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1803#true} {1803#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1803#true} is VALID [2022-04-27 21:55:04,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {1803#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1803#true} is VALID [2022-04-27 21:55:04,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {1803#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {1835#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {1835#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {1835#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {1835#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {1835#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {1835#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {1835#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {1835#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {1835#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {1835#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {1835#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {1835#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {1835#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {1835#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {1835#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {1835#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {1835#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {1835#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {1835#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {1835#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {1835#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {1835#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {1835#(= main_~y~0 10000000)} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {1835#(= main_~y~0 10000000)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {1835#(= main_~y~0 10000000)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1835#(= main_~y~0 10000000)} is VALID [2022-04-27 21:55:04,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {1835#(= main_~y~0 10000000)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {1914#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 21:55:04,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {1914#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1918#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-27 21:55:04,417 INFO L290 TraceCheckUtils]: 33: Hoare triple {1918#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1804#false} is VALID [2022-04-27 21:55:04,417 INFO L272 TraceCheckUtils]: 34: Hoare triple {1804#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {1804#false} is VALID [2022-04-27 21:55:04,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {1804#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1804#false} is VALID [2022-04-27 21:55:04,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {1804#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1804#false} is VALID [2022-04-27 21:55:04,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {1804#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1804#false} is VALID [2022-04-27 21:55:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-27 21:55:04,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 21:55:04,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119753003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:55:04,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 21:55:04,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-04-27 21:55:04,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113636989] [2022-04-27 21:55:04,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:55:04,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 38 [2022-04-27 21:55:04,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:55:04,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-04-27 21:55:04,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:55:04,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:55:04,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:55:04,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:55:04,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-27 21:55:04,439 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-04-27 21:55:04,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:55:04,532 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2022-04-27 21:55:04,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:55:04,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 38 [2022-04-27 21:55:04,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:55:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-04-27 21:55:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-27 21:55:04,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-04-27 21:55:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-27 21:55:04,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-27 21:55:04,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:55:04,562 INFO L225 Difference]: With dead ends: 122 [2022-04-27 21:55:04,562 INFO L226 Difference]: Without dead ends: 117 [2022-04-27 21:55:04,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 21:55:04,563 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:55:04,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 19 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:55:04,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-27 21:55:04,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 71. [2022-04-27 21:55:04,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:55:04,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 71 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 66 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:55:04,591 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 71 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 66 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:55:04,591 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 71 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 66 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:55:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:55:04,594 INFO L93 Difference]: Finished difference Result 117 states and 142 transitions. [2022-04-27 21:55:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 142 transitions. [2022-04-27 21:55:04,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:55:04,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:55:04,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 66 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-27 21:55:04,595 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 66 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-27 21:55:04,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:55:04,598 INFO L93 Difference]: Finished difference Result 117 states and 142 transitions. [2022-04-27 21:55:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 142 transitions. [2022-04-27 21:55:04,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:55:04,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:55:04,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:55:04,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:55:04,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 66 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:55:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2022-04-27 21:55:04,600 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 38 [2022-04-27 21:55:04,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:55:04,601 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2022-04-27 21:55:04,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-04-27 21:55:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-27 21:55:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 21:55:04,601 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:55:04,602 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:55:04,629 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-04-27 21:55:04,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:55:04,802 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:55:04,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:55:04,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1150947292, now seen corresponding path program 4 times [2022-04-27 21:55:04,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:55:04,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640395043] [2022-04-27 21:55:04,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:55:04,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:55:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:55:04,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:55:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:55:04,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {2441#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2428#true} is VALID [2022-04-27 21:55:04,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {2428#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 21:55:04,996 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2428#true} {2428#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 21:55:04,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {2428#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2441#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:55:04,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {2441#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2428#true} is VALID [2022-04-27 21:55:04,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {2428#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 21:55:04,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2428#true} {2428#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 21:55:04,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {2428#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 21:55:04,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {2428#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {2433#(= main_~x~0 0)} is VALID [2022-04-27 21:55:04,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {2433#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2433#(= main_~x~0 0)} is VALID [2022-04-27 21:55:04,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {2433#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2433#(= main_~x~0 0)} is VALID [2022-04-27 21:55:04,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {2433#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2434#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:55:04,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {2434#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2434#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:55:04,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {2434#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2434#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:55:05,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {2434#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:55:05,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {2435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:55:05,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {2435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:55:05,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {2435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:55:05,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {2436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:55:05,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {2436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:55:05,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {2436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2437#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:55:05,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {2437#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2437#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:55:05,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {2437#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2437#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:55:05,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {2437#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:55:05,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {2438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:55:05,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {2438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:55:05,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {2438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2439#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:55:05,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {2439#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2439#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:55:05,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {2439#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2439#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:55:05,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {2439#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2440#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 21:55:05,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {2440#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2440#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 21:55:05,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {2440#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2429#false} is VALID [2022-04-27 21:55:05,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {2429#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2429#false} is VALID [2022-04-27 21:55:05,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {2429#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2429#false} is VALID [2022-04-27 21:55:05,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {2429#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2429#false} is VALID [2022-04-27 21:55:05,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {2429#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2429#false} is VALID [2022-04-27 21:55:05,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {2429#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2429#false} is VALID [2022-04-27 21:55:05,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {2429#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2429#false} is VALID [2022-04-27 21:55:05,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {2429#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2429#false} is VALID [2022-04-27 21:55:05,009 INFO L290 TraceCheckUtils]: 36: Hoare triple {2429#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2429#false} is VALID [2022-04-27 21:55:05,009 INFO L272 TraceCheckUtils]: 37: Hoare triple {2429#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {2429#false} is VALID [2022-04-27 21:55:05,009 INFO L290 TraceCheckUtils]: 38: Hoare triple {2429#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2429#false} is VALID [2022-04-27 21:55:05,010 INFO L290 TraceCheckUtils]: 39: Hoare triple {2429#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2429#false} is VALID [2022-04-27 21:55:05,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {2429#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2429#false} is VALID [2022-04-27 21:55:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 61 proven. 77 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 21:55:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:55:05,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640395043] [2022-04-27 21:55:05,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640395043] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:55:05,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597153012] [2022-04-27 21:55:05,010 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 21:55:05,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:55:05,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:55:05,012 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-04-27 21:55:05,024 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-04-27 21:55:05,070 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 21:55:05,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:55:05,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-27 21:55:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:55:05,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:55:05,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {2428#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 21:55:05,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {2428#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2428#true} is VALID [2022-04-27 21:55:05,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {2428#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 21:55:05,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2428#true} {2428#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 21:55:05,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {2428#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 21:55:05,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {2428#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {2460#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {2460#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2460#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {2460#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2460#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {2460#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2470#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {2470#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2470#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {2470#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2470#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {2470#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2480#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {2480#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2480#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {2480#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2480#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {2480#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2490#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {2490#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2490#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {2490#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2490#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {2490#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2500#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {2500#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2500#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {2500#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2500#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {2500#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2510#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 21:55:05,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {2510#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2510#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 21:55:05,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {2510#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2510#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 21:55:05,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {2510#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2520#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {2520#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2520#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {2520#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2520#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:55:05,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {2520#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2530#(and (= 5000000 main_~z~0) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 21:55:05,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {2530#(and (= 5000000 main_~z~0) (= 5 (+ (- 2) main_~x~0)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2530#(and (= 5000000 main_~z~0) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 21:55:05,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {2530#(and (= 5000000 main_~z~0) (= 5 (+ (- 2) main_~x~0)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2537#(and (= main_~z~0 5000001) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 21:55:05,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {2537#(and (= main_~z~0 5000001) (= 5 (+ (- 2) main_~x~0)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2541#(and (= main_~z~0 5000001) (= main_~x~0 8))} is VALID [2022-04-27 21:55:05,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {2541#(and (= main_~z~0 5000001) (= main_~x~0 8))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2541#(and (= main_~z~0 5000001) (= main_~x~0 8))} is VALID [2022-04-27 21:55:05,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {2541#(and (= main_~z~0 5000001) (= main_~x~0 8))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2541#(and (= main_~z~0 5000001) (= main_~x~0 8))} is VALID [2022-04-27 21:55:05,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {2541#(and (= main_~z~0 5000001) (= main_~x~0 8))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2551#(and (= (+ (- 1) main_~x~0) 8) (= main_~z~0 5000001))} is VALID [2022-04-27 21:55:05,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {2551#(and (= (+ (- 1) main_~x~0) 8) (= main_~z~0 5000001))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2551#(and (= (+ (- 1) main_~x~0) 8) (= main_~z~0 5000001))} is VALID [2022-04-27 21:55:05,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {2551#(and (= (+ (- 1) main_~x~0) 8) (= main_~z~0 5000001))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2558#(and (= (+ (- 1) main_~x~0) 8) (= 5000001 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 21:55:05,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {2558#(and (= (+ (- 1) main_~x~0) 8) (= 5000001 (+ (- 1) main_~z~0)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2562#(and (= main_~x~0 10) (= 5000001 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 21:55:05,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {2562#(and (= main_~x~0 10) (= 5000001 (+ (- 1) main_~z~0)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2562#(and (= main_~x~0 10) (= 5000001 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 21:55:05,580 INFO L272 TraceCheckUtils]: 37: Hoare triple {2562#(and (= main_~x~0 10) (= 5000001 (+ (- 1) main_~z~0)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {2569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:55:05,580 INFO L290 TraceCheckUtils]: 38: Hoare triple {2569#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:55:05,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {2573#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2429#false} is VALID [2022-04-27 21:55:05,581 INFO L290 TraceCheckUtils]: 40: Hoare triple {2429#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2429#false} is VALID [2022-04-27 21:55:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:55:05,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:55:06,117 INFO L290 TraceCheckUtils]: 40: Hoare triple {2429#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2429#false} is VALID [2022-04-27 21:55:06,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {2573#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2429#false} is VALID [2022-04-27 21:55:06,118 INFO L290 TraceCheckUtils]: 38: Hoare triple {2569#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2573#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:55:06,119 INFO L272 TraceCheckUtils]: 37: Hoare triple {2589#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {2569#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:55:06,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {2589#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2589#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:55:06,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {2596#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2589#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:55:06,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {2589#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2596#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:55:06,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {2589#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2589#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:55:06,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {2596#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2589#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:55:06,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {2596#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2596#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:55:06,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {2596#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2596#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:55:06,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {2615#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2596#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:55:06,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {2596#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {2615#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:55:06,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {2596#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2596#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:55:06,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {2615#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2596#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:55:06,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {2615#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2615#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:55:06,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {2615#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2615#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:55:06,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {2634#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2615#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:55:06,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {2634#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2634#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:55:06,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {2634#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2634#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:55:06,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {2644#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2634#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:55:06,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {2644#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2644#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 21:55:06,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {2644#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2644#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 21:55:06,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {2654#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2644#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 21:55:06,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {2654#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2654#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:55:06,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {2654#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2654#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:55:06,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {2664#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2654#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:55:06,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {2664#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2664#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 21:55:06,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {2664#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2664#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 21:55:06,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {2674#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2664#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 21:55:06,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {2674#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2674#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:55:06,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {2674#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2674#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:55:06,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {2684#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2674#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:55:06,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {2684#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {2684#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 21:55:06,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {2684#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2684#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 21:55:06,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {2428#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {2684#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 21:55:06,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {2428#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 21:55:06,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2428#true} {2428#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 21:55:06,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {2428#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 21:55:06,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {2428#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2428#true} is VALID [2022-04-27 21:55:06,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {2428#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2428#true} is VALID [2022-04-27 21:55:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 21:55:06,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597153012] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:55:06,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:55:06,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 13] total 35 [2022-04-27 21:55:06,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610044273] [2022-04-27 21:55:06,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:55:06,169 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 21:55:06,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:55:06,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:55:06,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:55:06,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-27 21:55:06,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:55:06,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-27 21:55:06,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 21:55:06,311 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:55:15,212 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:55:17,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:55:21,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:55:23,895 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:55:26,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:55:28,768 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:55:30,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:55:39,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:55:41,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:55:45,391 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:55:47,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:55:49,402 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:55:55,586 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:56:00,510 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:56:02,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:56:10,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:56:10,898 INFO L93 Difference]: Finished difference Result 212 states and 265 transitions. [2022-04-27 21:56:10,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-27 21:56:10,899 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 21:56:10,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:56:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:10,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 165 transitions. [2022-04-27 21:56:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 165 transitions. [2022-04-27 21:56:10,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 165 transitions. [2022-04-27 21:56:36,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 155 inductive. 0 not inductive. 10 times theorem prover too weak to decide inductivity. [2022-04-27 21:56:36,825 INFO L225 Difference]: With dead ends: 212 [2022-04-27 21:56:36,825 INFO L226 Difference]: Without dead ends: 194 [2022-04-27 21:56:36,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=1078, Invalid=4928, Unknown=0, NotChecked=0, Total=6006 [2022-04-27 21:56:36,827 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 56 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 52 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:56:36,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 106 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 779 Invalid, 11 Unknown, 0 Unchecked, 32.2s Time] [2022-04-27 21:56:36,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-27 21:56:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 126. [2022-04-27 21:56:36,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:56:36,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 126 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 121 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:36,879 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 126 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 121 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:36,880 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 126 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 121 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:56:36,886 INFO L93 Difference]: Finished difference Result 194 states and 240 transitions. [2022-04-27 21:56:36,886 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 240 transitions. [2022-04-27 21:56:36,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:56:36,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:56:36,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 121 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-27 21:56:36,887 INFO L87 Difference]: Start difference. First operand has 126 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 121 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-27 21:56:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:56:36,893 INFO L93 Difference]: Finished difference Result 194 states and 240 transitions. [2022-04-27 21:56:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 240 transitions. [2022-04-27 21:56:36,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:56:36,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:56:36,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:56:36,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:56:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 121 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 157 transitions. [2022-04-27 21:56:36,897 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 157 transitions. Word has length 41 [2022-04-27 21:56:36,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:56:36,897 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 157 transitions. [2022-04-27 21:56:36,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:36,897 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 157 transitions. [2022-04-27 21:56:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 21:56:36,898 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:56:36,898 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:56:36,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 21:56:37,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:56:37,122 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:56:37,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:56:37,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1586771670, now seen corresponding path program 5 times [2022-04-27 21:56:37,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:56:37,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228391159] [2022-04-27 21:56:37,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:56:37,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:56:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:56:37,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:56:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:56:37,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {3659#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3645#true} is VALID [2022-04-27 21:56:37,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {3645#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:37,339 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3645#true} {3645#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:37,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {3645#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3659#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:56:37,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {3659#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3645#true} is VALID [2022-04-27 21:56:37,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {3645#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:37,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3645#true} {3645#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:37,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {3645#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:37,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {3645#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {3650#(= main_~x~0 0)} is VALID [2022-04-27 21:56:37,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {3650#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3650#(= main_~x~0 0)} is VALID [2022-04-27 21:56:37,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {3650#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3650#(= main_~x~0 0)} is VALID [2022-04-27 21:56:37,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {3650#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3651#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:56:37,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {3651#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3651#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:56:37,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {3651#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3651#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:56:37,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {3651#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3652#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:56:37,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {3652#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3652#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:56:37,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {3652#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3652#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:56:37,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {3652#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3653#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:56:37,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {3653#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3653#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:56:37,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {3653#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3653#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:56:37,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {3653#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3654#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:56:37,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {3654#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3654#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:56:37,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {3654#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3654#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:56:37,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {3654#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3655#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:56:37,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {3655#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3655#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:56:37,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {3655#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3655#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:56:37,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {3655#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3656#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:56:37,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {3656#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3656#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:56:37,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {3656#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3656#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:56:37,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {3656#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3657#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:56:37,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {3657#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3657#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:56:37,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {3657#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3657#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:56:37,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {3657#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3658#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:56:37,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {3658#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3658#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:56:37,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {3658#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {3646#false} is VALID [2022-04-27 21:56:37,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {3646#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3646#false} is VALID [2022-04-27 21:56:37,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {3646#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:37,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {3646#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:37,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {3646#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3646#false} is VALID [2022-04-27 21:56:37,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {3646#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:37,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {3646#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:37,353 INFO L290 TraceCheckUtils]: 38: Hoare triple {3646#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3646#false} is VALID [2022-04-27 21:56:37,353 INFO L290 TraceCheckUtils]: 39: Hoare triple {3646#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:37,353 INFO L290 TraceCheckUtils]: 40: Hoare triple {3646#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:37,353 INFO L290 TraceCheckUtils]: 41: Hoare triple {3646#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3646#false} is VALID [2022-04-27 21:56:37,353 INFO L290 TraceCheckUtils]: 42: Hoare triple {3646#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:37,353 INFO L290 TraceCheckUtils]: 43: Hoare triple {3646#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {3646#false} is VALID [2022-04-27 21:56:37,354 INFO L290 TraceCheckUtils]: 44: Hoare triple {3646#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3646#false} is VALID [2022-04-27 21:56:37,354 INFO L290 TraceCheckUtils]: 45: Hoare triple {3646#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:37,354 INFO L272 TraceCheckUtils]: 46: Hoare triple {3646#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {3646#false} is VALID [2022-04-27 21:56:37,354 INFO L290 TraceCheckUtils]: 47: Hoare triple {3646#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3646#false} is VALID [2022-04-27 21:56:37,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {3646#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:37,354 INFO L290 TraceCheckUtils]: 49: Hoare triple {3646#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 121 proven. 100 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 21:56:37,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:56:37,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228391159] [2022-04-27 21:56:37,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228391159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:56:37,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739927525] [2022-04-27 21:56:37,355 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 21:56:37,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:56:37,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:56:37,360 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-04-27 21:56:37,361 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-04-27 21:56:37,483 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-04-27 21:56:37,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:56:37,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 21:56:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:56:37,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:56:38,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {3645#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {3645#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3645#true} is VALID [2022-04-27 21:56:38,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {3645#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3645#true} {3645#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {3645#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {3645#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {3645#true} is VALID [2022-04-27 21:56:38,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {3645#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {3645#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3645#true} is VALID [2022-04-27 21:56:38,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {3645#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {3645#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3645#true} is VALID [2022-04-27 21:56:38,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {3645#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {3645#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3645#true} is VALID [2022-04-27 21:56:38,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {3645#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {3645#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3645#true} is VALID [2022-04-27 21:56:38,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {3645#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {3645#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3645#true} is VALID [2022-04-27 21:56:38,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {3645#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {3645#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3645#true} is VALID [2022-04-27 21:56:38,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {3645#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {3645#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3645#true} is VALID [2022-04-27 21:56:38,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {3645#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {3645#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3645#true} is VALID [2022-04-27 21:56:38,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3753#(< (mod main_~x~0 4294967296) 4294967295)} is VALID [2022-04-27 21:56:38,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {3753#(< (mod main_~x~0 4294967296) 4294967295)} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {3757#(and (<= 5000000 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 4294967295))} is VALID [2022-04-27 21:56:38,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {3757#(and (<= 5000000 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 4294967295))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3761#(and (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)) (< (mod (+ main_~x~0 4294967295) 4294967296) 4294967295))} is VALID [2022-04-27 21:56:38,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {3761#(and (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)) (< (mod (+ main_~x~0 4294967295) 4294967296) 4294967295))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3761#(and (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)) (< (mod (+ main_~x~0 4294967295) 4294967296) 4294967295))} is VALID [2022-04-27 21:56:38,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {3761#(and (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)) (< (mod (+ main_~x~0 4294967295) 4294967296) 4294967295))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {3646#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3646#false} is VALID [2022-04-27 21:56:38,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {3646#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {3646#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {3646#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3646#false} is VALID [2022-04-27 21:56:38,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {3646#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {3646#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {3646#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3646#false} is VALID [2022-04-27 21:56:38,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {3646#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {3646#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {3646#false} is VALID [2022-04-27 21:56:38,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {3646#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3646#false} is VALID [2022-04-27 21:56:38,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {3646#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,056 INFO L272 TraceCheckUtils]: 46: Hoare triple {3646#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {3646#false} is VALID [2022-04-27 21:56:38,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {3646#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3646#false} is VALID [2022-04-27 21:56:38,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {3646#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {3646#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 139 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-04-27 21:56:38,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:56:38,473 INFO L290 TraceCheckUtils]: 49: Hoare triple {3646#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,473 INFO L290 TraceCheckUtils]: 48: Hoare triple {3646#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {3646#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3646#false} is VALID [2022-04-27 21:56:38,473 INFO L272 TraceCheckUtils]: 46: Hoare triple {3646#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {3646#false} is VALID [2022-04-27 21:56:38,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {3646#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,473 INFO L290 TraceCheckUtils]: 44: Hoare triple {3646#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3646#false} is VALID [2022-04-27 21:56:38,473 INFO L290 TraceCheckUtils]: 43: Hoare triple {3646#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {3646#false} is VALID [2022-04-27 21:56:38,473 INFO L290 TraceCheckUtils]: 42: Hoare triple {3646#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,474 INFO L290 TraceCheckUtils]: 41: Hoare triple {3646#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3646#false} is VALID [2022-04-27 21:56:38,474 INFO L290 TraceCheckUtils]: 40: Hoare triple {3646#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,474 INFO L290 TraceCheckUtils]: 39: Hoare triple {3646#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {3646#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3646#false} is VALID [2022-04-27 21:56:38,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {3646#false} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {3646#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {3646#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3646#false} is VALID [2022-04-27 21:56:38,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {3858#(<= 5000000 (mod main_~x~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3646#false} is VALID [2022-04-27 21:56:38,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {3858#(<= 5000000 (mod main_~x~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3858#(<= 5000000 (mod main_~x~0 4294967296))} is VALID [2022-04-27 21:56:38,476 INFO L290 TraceCheckUtils]: 32: Hoare triple {3865#(<= 5000000 (mod (+ main_~x~0 1) 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3858#(<= 5000000 (mod main_~x~0 4294967296))} is VALID [2022-04-27 21:56:38,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {3753#(< (mod main_~x~0 4294967296) 4294967295)} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {3865#(<= 5000000 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 21:56:38,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3753#(< (mod main_~x~0 4294967296) 4294967295)} is VALID [2022-04-27 21:56:38,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {3645#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3645#true} is VALID [2022-04-27 21:56:38,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {3645#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {3645#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3645#true} is VALID [2022-04-27 21:56:38,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {3645#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {3645#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3645#true} is VALID [2022-04-27 21:56:38,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {3645#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {3645#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3645#true} is VALID [2022-04-27 21:56:38,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {3645#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {3645#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3645#true} is VALID [2022-04-27 21:56:38,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {3645#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {3645#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3645#true} is VALID [2022-04-27 21:56:38,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {3645#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {3645#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3645#true} is VALID [2022-04-27 21:56:38,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {3645#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {3645#true} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3645#true} is VALID [2022-04-27 21:56:38,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {3645#true} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {3645#true} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {3645#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {3645#true} is VALID [2022-04-27 21:56:38,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {3645#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3645#true} {3645#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {3645#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {3645#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3645#true} is VALID [2022-04-27 21:56:38,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {3645#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3645#true} is VALID [2022-04-27 21:56:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 139 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-04-27 21:56:38,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739927525] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:56:38,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:56:38,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 17 [2022-04-27 21:56:38,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999679115] [2022-04-27 21:56:38,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:56:38,482 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-27 21:56:38,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:56:38,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:38,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:56:38,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 21:56:38,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:56:38,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 21:56:38,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-04-27 21:56:38,556 INFO L87 Difference]: Start difference. First operand 126 states and 157 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:56:39,348 INFO L93 Difference]: Finished difference Result 173 states and 215 transitions. [2022-04-27 21:56:39,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 21:56:39,348 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-27 21:56:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:56:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 58 transitions. [2022-04-27 21:56:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 58 transitions. [2022-04-27 21:56:39,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 58 transitions. [2022-04-27 21:56:39,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:56:39,410 INFO L225 Difference]: With dead ends: 173 [2022-04-27 21:56:39,410 INFO L226 Difference]: Without dead ends: 68 [2022-04-27 21:56:39,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2022-04-27 21:56:39,412 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:56:39,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 27 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 21:56:39,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-27 21:56:39,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-04-27 21:56:39,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:56:39,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:39,444 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:39,444 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:56:39,446 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2022-04-27 21:56:39,446 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-04-27 21:56:39,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:56:39,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:56:39,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-27 21:56:39,446 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-27 21:56:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:56:39,448 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2022-04-27 21:56:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-04-27 21:56:39,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:56:39,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:56:39,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:56:39,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:56:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-04-27 21:56:39,450 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 50 [2022-04-27 21:56:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:56:39,450 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-04-27 21:56:39,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-04-27 21:56:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-27 21:56:39,451 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:56:39,451 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:56:39,462 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-04-27 21:56:39,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:56:39,656 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:56:39,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:56:39,656 INFO L85 PathProgramCache]: Analyzing trace with hash -748666459, now seen corresponding path program 6 times [2022-04-27 21:56:39,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:56:39,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755566999] [2022-04-27 21:56:39,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:56:39,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:56:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:56:40,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:56:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:56:40,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {4475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4452#true} is VALID [2022-04-27 21:56:40,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {4452#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4452#true} is VALID [2022-04-27 21:56:40,077 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4452#true} {4452#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4452#true} is VALID [2022-04-27 21:56:40,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {4452#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:56:40,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {4475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4452#true} is VALID [2022-04-27 21:56:40,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4452#true} is VALID [2022-04-27 21:56:40,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#true} {4452#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4452#true} is VALID [2022-04-27 21:56:40,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4452#true} is VALID [2022-04-27 21:56:40,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {4457#(= main_~x~0 0)} is VALID [2022-04-27 21:56:40,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {4457#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4457#(= main_~x~0 0)} is VALID [2022-04-27 21:56:40,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {4457#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4457#(= main_~x~0 0)} is VALID [2022-04-27 21:56:40,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {4457#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4458#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:56:40,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {4458#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4458#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:56:40,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {4458#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4458#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:56:40,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {4458#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:56:40,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:56:40,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:56:40,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:56:40,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:56:40,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:56:40,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4461#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:56:40,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {4461#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4461#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:56:40,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {4461#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4461#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:56:40,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {4461#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:56:40,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:56:40,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:56:40,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4463#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:56:40,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {4463#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4463#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:56:40,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {4463#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4463#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:56:40,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {4463#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:56:40,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:56:40,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:56:40,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4465#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:56:40,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {4465#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4465#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:56:40,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {4465#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4465#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:56:40,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {4465#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4466#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:56:40,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {4466#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4466#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:56:40,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {4466#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4466#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:56:40,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {4466#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:56:40,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {4467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:56:40,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {4467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:56:40,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {4467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4468#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:56:40,097 INFO L290 TraceCheckUtils]: 39: Hoare triple {4468#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4468#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:56:40,097 INFO L290 TraceCheckUtils]: 40: Hoare triple {4468#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4468#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:56:40,098 INFO L290 TraceCheckUtils]: 41: Hoare triple {4468#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:56:40,098 INFO L290 TraceCheckUtils]: 42: Hoare triple {4469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:56:40,099 INFO L290 TraceCheckUtils]: 43: Hoare triple {4469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:56:40,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {4469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:56:40,100 INFO L290 TraceCheckUtils]: 45: Hoare triple {4470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:56:40,100 INFO L290 TraceCheckUtils]: 46: Hoare triple {4470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:56:40,100 INFO L290 TraceCheckUtils]: 47: Hoare triple {4470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:56:40,101 INFO L290 TraceCheckUtils]: 48: Hoare triple {4471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:56:40,101 INFO L290 TraceCheckUtils]: 49: Hoare triple {4471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:56:40,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {4471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:56:40,117 INFO L290 TraceCheckUtils]: 51: Hoare triple {4472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:56:40,117 INFO L290 TraceCheckUtils]: 52: Hoare triple {4472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:56:40,118 INFO L290 TraceCheckUtils]: 53: Hoare triple {4472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:56:40,119 INFO L290 TraceCheckUtils]: 54: Hoare triple {4473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:56:40,119 INFO L290 TraceCheckUtils]: 55: Hoare triple {4473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:56:40,120 INFO L290 TraceCheckUtils]: 56: Hoare triple {4473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4474#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-27 21:56:40,120 INFO L290 TraceCheckUtils]: 57: Hoare triple {4474#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4474#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-27 21:56:40,121 INFO L290 TraceCheckUtils]: 58: Hoare triple {4474#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4453#false} is VALID [2022-04-27 21:56:40,121 INFO L290 TraceCheckUtils]: 59: Hoare triple {4453#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4453#false} is VALID [2022-04-27 21:56:40,121 INFO L290 TraceCheckUtils]: 60: Hoare triple {4453#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4453#false} is VALID [2022-04-27 21:56:40,121 INFO L272 TraceCheckUtils]: 61: Hoare triple {4453#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {4453#false} is VALID [2022-04-27 21:56:40,121 INFO L290 TraceCheckUtils]: 62: Hoare triple {4453#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4453#false} is VALID [2022-04-27 21:56:40,121 INFO L290 TraceCheckUtils]: 63: Hoare triple {4453#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4453#false} is VALID [2022-04-27 21:56:40,121 INFO L290 TraceCheckUtils]: 64: Hoare triple {4453#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4453#false} is VALID [2022-04-27 21:56:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 35 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:56:40,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:56:40,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755566999] [2022-04-27 21:56:40,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755566999] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:56:40,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229617207] [2022-04-27 21:56:40,122 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 21:56:40,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:56:40,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:56:40,124 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-04-27 21:56:40,147 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-04-27 21:56:40,177 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-27 21:56:40,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:56:40,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 21:56:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:56:40,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:56:40,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {4452#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4452#true} is VALID [2022-04-27 21:56:40,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {4452#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4452#true} is VALID [2022-04-27 21:56:40,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4452#true} is VALID [2022-04-27 21:56:40,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#true} {4452#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4452#true} is VALID [2022-04-27 21:56:40,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4452#true} is VALID [2022-04-27 21:56:40,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,724 INFO L290 TraceCheckUtils]: 37: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,727 INFO L290 TraceCheckUtils]: 43: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,728 INFO L290 TraceCheckUtils]: 45: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,728 INFO L290 TraceCheckUtils]: 46: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,730 INFO L290 TraceCheckUtils]: 49: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,730 INFO L290 TraceCheckUtils]: 50: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,731 INFO L290 TraceCheckUtils]: 51: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,731 INFO L290 TraceCheckUtils]: 52: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,732 INFO L290 TraceCheckUtils]: 53: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,732 INFO L290 TraceCheckUtils]: 54: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,732 INFO L290 TraceCheckUtils]: 55: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,733 INFO L290 TraceCheckUtils]: 56: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:56:40,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {4494#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4654#(and (= main_~y~0 10000000) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 21:56:40,734 INFO L290 TraceCheckUtils]: 59: Hoare triple {4654#(and (= main_~y~0 10000000) (= 5000000 (+ (- 1) main_~z~0)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4654#(and (= main_~y~0 10000000) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 21:56:40,735 INFO L290 TraceCheckUtils]: 60: Hoare triple {4654#(and (= main_~y~0 10000000) (= 5000000 (+ (- 1) main_~z~0)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4661#(and (= 5000000 (+ (- 1) main_~z~0)) (not (< (mod main_~x~0 4294967296) 10000000)))} is VALID [2022-04-27 21:56:40,736 INFO L272 TraceCheckUtils]: 61: Hoare triple {4661#(and (= 5000000 (+ (- 1) main_~z~0)) (not (< (mod main_~x~0 4294967296) 10000000)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {4665#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:56:40,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {4665#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4669#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:56:40,736 INFO L290 TraceCheckUtils]: 63: Hoare triple {4669#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4453#false} is VALID [2022-04-27 21:56:40,737 INFO L290 TraceCheckUtils]: 64: Hoare triple {4453#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4453#false} is VALID [2022-04-27 21:56:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-04-27 21:56:40,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:56:41,210 INFO L290 TraceCheckUtils]: 64: Hoare triple {4453#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4453#false} is VALID [2022-04-27 21:56:41,211 INFO L290 TraceCheckUtils]: 63: Hoare triple {4669#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4453#false} is VALID [2022-04-27 21:56:41,212 INFO L290 TraceCheckUtils]: 62: Hoare triple {4665#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4669#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:56:41,212 INFO L272 TraceCheckUtils]: 61: Hoare triple {4685#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {4665#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:56:41,213 INFO L290 TraceCheckUtils]: 60: Hoare triple {4689#(< (mod main_~z~0 4294967296) (mod main_~y~0 4294967296))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4685#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:56:41,213 INFO L290 TraceCheckUtils]: 59: Hoare triple {4689#(< (mod main_~z~0 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4689#(< (mod main_~z~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,214 INFO L290 TraceCheckUtils]: 58: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {4689#(< (mod main_~z~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,215 INFO L290 TraceCheckUtils]: 55: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,215 INFO L290 TraceCheckUtils]: 54: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,215 INFO L290 TraceCheckUtils]: 53: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,216 INFO L290 TraceCheckUtils]: 51: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,216 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,217 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,217 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,218 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,218 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,219 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,220 INFO L290 TraceCheckUtils]: 41: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {4696#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:56:41,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4452#true} is VALID [2022-04-27 21:56:41,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#true} {4452#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4452#true} is VALID [2022-04-27 21:56:41,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4452#true} is VALID [2022-04-27 21:56:41,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {4452#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4452#true} is VALID [2022-04-27 21:56:41,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {4452#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4452#true} is VALID [2022-04-27 21:56:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-04-27 21:56:41,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229617207] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:56:41,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:56:41,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 29 [2022-04-27 21:56:41,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295120044] [2022-04-27 21:56:41,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:56:41,237 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-27 21:56:41,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:56:41,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:41,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:56:41,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-27 21:56:41,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:56:41,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-27 21:56:41,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-04-27 21:56:41,307 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:56:43,963 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-04-27 21:56:43,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 21:56:43,963 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-27 21:56:43,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:56:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:43,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 101 transitions. [2022-04-27 21:56:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 101 transitions. [2022-04-27 21:56:43,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 101 transitions. [2022-04-27 21:56:44,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:56:44,068 INFO L225 Difference]: With dead ends: 95 [2022-04-27 21:56:44,068 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 21:56:44,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=439, Invalid=2753, Unknown=0, NotChecked=0, Total=3192 [2022-04-27 21:56:44,069 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 162 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:56:44,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 67 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 21:56:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 21:56:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-04-27 21:56:44,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:56:44,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:44,134 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:44,134 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:56:44,136 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2022-04-27 21:56:44,136 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-04-27 21:56:44,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:56:44,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:56:44,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-27 21:56:44,137 INFO L87 Difference]: Start difference. First operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-27 21:56:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:56:44,138 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2022-04-27 21:56:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-04-27 21:56:44,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:56:44,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:56:44,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:56:44,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:56:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-04-27 21:56:44,140 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 65 [2022-04-27 21:56:44,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:56:44,140 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-04-27 21:56:44,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-04-27 21:56:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 21:56:44,141 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:56:44,141 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 18, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:56:44,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 21:56:44,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 21:56:44,342 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:56:44,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:56:44,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1474088538, now seen corresponding path program 7 times [2022-04-27 21:56:44,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:56:44,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023061219] [2022-04-27 21:56:44,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:56:44,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:56:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:56:44,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:56:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:56:44,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {5356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5332#true} is VALID [2022-04-27 21:56:44,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {5332#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5332#true} is VALID [2022-04-27 21:56:44,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5332#true} {5332#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5332#true} is VALID [2022-04-27 21:56:44,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {5332#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:56:44,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {5356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5332#true} is VALID [2022-04-27 21:56:44,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {5332#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5332#true} is VALID [2022-04-27 21:56:44,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5332#true} {5332#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5332#true} is VALID [2022-04-27 21:56:44,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {5332#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5332#true} is VALID [2022-04-27 21:56:44,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {5332#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {5337#(= main_~x~0 0)} is VALID [2022-04-27 21:56:44,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {5337#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5337#(= main_~x~0 0)} is VALID [2022-04-27 21:56:44,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {5337#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5337#(= main_~x~0 0)} is VALID [2022-04-27 21:56:44,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {5337#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:56:44,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {5338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:56:44,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {5338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:56:44,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {5338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5339#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:56:44,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {5339#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5339#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:56:44,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {5339#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5339#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:56:44,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {5339#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5340#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:56:44,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {5340#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5340#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:56:44,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {5340#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5340#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:56:44,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {5340#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5341#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:56:44,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {5341#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5341#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:56:44,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {5341#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5341#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:56:44,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {5341#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5342#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:56:44,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {5342#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5342#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:56:44,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {5342#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5342#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:56:44,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {5342#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5343#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:56:44,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {5343#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5343#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:56:44,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {5343#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5343#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:56:44,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {5343#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5344#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:56:44,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {5344#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5344#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:56:44,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {5344#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5344#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:56:44,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {5344#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5345#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:56:44,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {5345#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5345#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:56:44,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {5345#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5345#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:56:44,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {5345#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5346#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:56:44,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {5346#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5346#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:56:44,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {5346#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5346#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:56:44,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {5346#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5347#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:56:44,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {5347#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5347#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:56:44,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {5347#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5347#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:56:44,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {5347#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5348#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:56:44,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {5348#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5348#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:56:44,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {5348#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5348#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:56:44,763 INFO L290 TraceCheckUtils]: 41: Hoare triple {5348#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5349#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:56:44,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {5349#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5349#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:56:44,764 INFO L290 TraceCheckUtils]: 43: Hoare triple {5349#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5349#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:56:44,764 INFO L290 TraceCheckUtils]: 44: Hoare triple {5349#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5350#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:56:44,765 INFO L290 TraceCheckUtils]: 45: Hoare triple {5350#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5350#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:56:44,765 INFO L290 TraceCheckUtils]: 46: Hoare triple {5350#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5350#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:56:44,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {5350#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5351#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:56:44,766 INFO L290 TraceCheckUtils]: 48: Hoare triple {5351#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5351#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:56:44,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {5351#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5351#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:56:44,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {5351#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5352#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:56:44,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {5352#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5352#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:56:44,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {5352#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5352#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:56:44,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {5352#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5353#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:56:44,769 INFO L290 TraceCheckUtils]: 54: Hoare triple {5353#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5353#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:56:44,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {5353#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5353#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:56:44,770 INFO L290 TraceCheckUtils]: 56: Hoare triple {5353#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5354#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:56:44,770 INFO L290 TraceCheckUtils]: 57: Hoare triple {5354#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5354#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:56:44,771 INFO L290 TraceCheckUtils]: 58: Hoare triple {5354#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5354#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:56:44,771 INFO L290 TraceCheckUtils]: 59: Hoare triple {5354#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5355#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:56:44,772 INFO L290 TraceCheckUtils]: 60: Hoare triple {5355#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5355#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:56:44,773 INFO L290 TraceCheckUtils]: 61: Hoare triple {5355#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5333#false} is VALID [2022-04-27 21:56:44,773 INFO L290 TraceCheckUtils]: 62: Hoare triple {5333#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5333#false} is VALID [2022-04-27 21:56:44,773 INFO L290 TraceCheckUtils]: 63: Hoare triple {5333#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5333#false} is VALID [2022-04-27 21:56:44,773 INFO L290 TraceCheckUtils]: 64: Hoare triple {5333#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5333#false} is VALID [2022-04-27 21:56:44,773 INFO L290 TraceCheckUtils]: 65: Hoare triple {5333#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5333#false} is VALID [2022-04-27 21:56:44,773 INFO L290 TraceCheckUtils]: 66: Hoare triple {5333#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5333#false} is VALID [2022-04-27 21:56:44,773 INFO L290 TraceCheckUtils]: 67: Hoare triple {5333#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5333#false} is VALID [2022-04-27 21:56:44,773 INFO L290 TraceCheckUtils]: 68: Hoare triple {5333#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5333#false} is VALID [2022-04-27 21:56:44,773 INFO L290 TraceCheckUtils]: 69: Hoare triple {5333#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5333#false} is VALID [2022-04-27 21:56:44,773 INFO L290 TraceCheckUtils]: 70: Hoare triple {5333#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5333#false} is VALID [2022-04-27 21:56:44,773 INFO L290 TraceCheckUtils]: 71: Hoare triple {5333#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5333#false} is VALID [2022-04-27 21:56:44,774 INFO L290 TraceCheckUtils]: 72: Hoare triple {5333#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {5333#false} is VALID [2022-04-27 21:56:44,774 INFO L272 TraceCheckUtils]: 73: Hoare triple {5333#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {5333#false} is VALID [2022-04-27 21:56:44,774 INFO L290 TraceCheckUtils]: 74: Hoare triple {5333#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5333#false} is VALID [2022-04-27 21:56:44,774 INFO L290 TraceCheckUtils]: 75: Hoare triple {5333#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {5333#false} is VALID [2022-04-27 21:56:44,774 INFO L290 TraceCheckUtils]: 76: Hoare triple {5333#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5333#false} is VALID [2022-04-27 21:56:44,774 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 205 proven. 495 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 21:56:44,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:56:44,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023061219] [2022-04-27 21:56:44,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023061219] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:56:44,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173473273] [2022-04-27 21:56:44,775 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 21:56:44,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:56:44,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:56:44,780 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:56:44,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 21:56:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:56:44,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-27 21:56:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:56:44,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:56:45,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {5332#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5332#true} is VALID [2022-04-27 21:56:45,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {5332#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5332#true} is VALID [2022-04-27 21:56:45,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {5332#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5332#true} is VALID [2022-04-27 21:56:45,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5332#true} {5332#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5332#true} is VALID [2022-04-27 21:56:45,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {5332#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5332#true} is VALID [2022-04-27 21:56:45,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {5332#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {5337#(= main_~x~0 0)} is VALID [2022-04-27 21:56:45,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {5337#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5337#(= main_~x~0 0)} is VALID [2022-04-27 21:56:45,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {5337#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5337#(= main_~x~0 0)} is VALID [2022-04-27 21:56:45,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {5337#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:56:45,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {5338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:56:45,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {5338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:56:45,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {5338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5339#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:56:45,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {5339#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5339#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:56:45,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {5339#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5339#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:56:45,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {5339#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5340#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:56:45,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {5340#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5340#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:56:45,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {5340#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5340#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:56:45,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {5340#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5341#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:56:45,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {5341#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5341#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:56:45,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {5341#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5341#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:56:45,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {5341#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5342#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:56:45,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {5342#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5342#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:56:45,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {5342#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5342#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:56:45,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {5342#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5343#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:56:45,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {5343#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5343#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:56:45,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {5343#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5343#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:56:45,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {5343#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5344#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:56:45,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {5344#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5344#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:56:45,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {5344#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5344#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:56:45,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {5344#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5345#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:56:45,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {5345#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5345#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:56:45,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {5345#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5345#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:56:45,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {5345#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5346#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:56:45,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {5346#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5346#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:56:45,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {5346#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5346#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:56:45,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {5346#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5347#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:56:45,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {5347#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5347#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:56:45,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {5347#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5347#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:56:45,556 INFO L290 TraceCheckUtils]: 38: Hoare triple {5347#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5348#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:56:45,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {5348#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5348#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:56:45,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {5348#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5348#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:56:45,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {5348#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5349#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:56:45,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {5349#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5349#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:56:45,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {5349#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5349#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:56:45,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {5349#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5350#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:56:45,560 INFO L290 TraceCheckUtils]: 45: Hoare triple {5350#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5350#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:56:45,560 INFO L290 TraceCheckUtils]: 46: Hoare triple {5350#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5350#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:56:45,561 INFO L290 TraceCheckUtils]: 47: Hoare triple {5350#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5351#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:56:45,561 INFO L290 TraceCheckUtils]: 48: Hoare triple {5351#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5351#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:56:45,562 INFO L290 TraceCheckUtils]: 49: Hoare triple {5351#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5351#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:56:45,562 INFO L290 TraceCheckUtils]: 50: Hoare triple {5351#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5352#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:56:45,563 INFO L290 TraceCheckUtils]: 51: Hoare triple {5352#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5352#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:56:45,563 INFO L290 TraceCheckUtils]: 52: Hoare triple {5352#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5352#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:56:45,563 INFO L290 TraceCheckUtils]: 53: Hoare triple {5352#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5353#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:56:45,564 INFO L290 TraceCheckUtils]: 54: Hoare triple {5353#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5353#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:56:45,564 INFO L290 TraceCheckUtils]: 55: Hoare triple {5353#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5353#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:56:45,564 INFO L290 TraceCheckUtils]: 56: Hoare triple {5353#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5354#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:56:45,565 INFO L290 TraceCheckUtils]: 57: Hoare triple {5354#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5354#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:56:45,565 INFO L290 TraceCheckUtils]: 58: Hoare triple {5354#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5354#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:56:45,565 INFO L290 TraceCheckUtils]: 59: Hoare triple {5354#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5537#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 21:56:45,566 INFO L290 TraceCheckUtils]: 60: Hoare triple {5537#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5537#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 21:56:45,566 INFO L290 TraceCheckUtils]: 61: Hoare triple {5537#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5537#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 21:56:45,567 INFO L290 TraceCheckUtils]: 62: Hoare triple {5537#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5547#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:56:45,567 INFO L290 TraceCheckUtils]: 63: Hoare triple {5547#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5547#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:56:45,567 INFO L290 TraceCheckUtils]: 64: Hoare triple {5547#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5333#false} is VALID [2022-04-27 21:56:45,567 INFO L290 TraceCheckUtils]: 65: Hoare triple {5333#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5333#false} is VALID [2022-04-27 21:56:45,568 INFO L290 TraceCheckUtils]: 66: Hoare triple {5333#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5333#false} is VALID [2022-04-27 21:56:45,568 INFO L290 TraceCheckUtils]: 67: Hoare triple {5333#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5333#false} is VALID [2022-04-27 21:56:45,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {5333#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5333#false} is VALID [2022-04-27 21:56:45,568 INFO L290 TraceCheckUtils]: 69: Hoare triple {5333#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5333#false} is VALID [2022-04-27 21:56:45,568 INFO L290 TraceCheckUtils]: 70: Hoare triple {5333#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5333#false} is VALID [2022-04-27 21:56:45,568 INFO L290 TraceCheckUtils]: 71: Hoare triple {5333#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5333#false} is VALID [2022-04-27 21:56:45,568 INFO L290 TraceCheckUtils]: 72: Hoare triple {5333#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {5333#false} is VALID [2022-04-27 21:56:45,568 INFO L272 TraceCheckUtils]: 73: Hoare triple {5333#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {5333#false} is VALID [2022-04-27 21:56:45,568 INFO L290 TraceCheckUtils]: 74: Hoare triple {5333#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5333#false} is VALID [2022-04-27 21:56:45,568 INFO L290 TraceCheckUtils]: 75: Hoare triple {5333#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {5333#false} is VALID [2022-04-27 21:56:45,568 INFO L290 TraceCheckUtils]: 76: Hoare triple {5333#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5333#false} is VALID [2022-04-27 21:56:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 157 proven. 551 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 21:56:45,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:56:46,434 INFO L290 TraceCheckUtils]: 76: Hoare triple {5333#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5333#false} is VALID [2022-04-27 21:56:46,434 INFO L290 TraceCheckUtils]: 75: Hoare triple {5333#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {5333#false} is VALID [2022-04-27 21:56:46,434 INFO L290 TraceCheckUtils]: 74: Hoare triple {5333#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5333#false} is VALID [2022-04-27 21:56:46,434 INFO L272 TraceCheckUtils]: 73: Hoare triple {5333#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {5333#false} is VALID [2022-04-27 21:56:46,434 INFO L290 TraceCheckUtils]: 72: Hoare triple {5333#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {5333#false} is VALID [2022-04-27 21:56:46,434 INFO L290 TraceCheckUtils]: 71: Hoare triple {5333#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5333#false} is VALID [2022-04-27 21:56:46,434 INFO L290 TraceCheckUtils]: 70: Hoare triple {5333#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5333#false} is VALID [2022-04-27 21:56:46,434 INFO L290 TraceCheckUtils]: 69: Hoare triple {5333#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5333#false} is VALID [2022-04-27 21:56:46,434 INFO L290 TraceCheckUtils]: 68: Hoare triple {5333#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5333#false} is VALID [2022-04-27 21:56:46,434 INFO L290 TraceCheckUtils]: 67: Hoare triple {5333#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5333#false} is VALID [2022-04-27 21:56:46,435 INFO L290 TraceCheckUtils]: 66: Hoare triple {5333#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5333#false} is VALID [2022-04-27 21:56:46,435 INFO L290 TraceCheckUtils]: 65: Hoare triple {5333#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5333#false} is VALID [2022-04-27 21:56:46,435 INFO L290 TraceCheckUtils]: 64: Hoare triple {5626#(not (<= 5000000 (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5333#false} is VALID [2022-04-27 21:56:46,436 INFO L290 TraceCheckUtils]: 63: Hoare triple {5626#(not (<= 5000000 (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5626#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:56:46,436 INFO L290 TraceCheckUtils]: 62: Hoare triple {5633#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5626#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:56:46,437 INFO L290 TraceCheckUtils]: 61: Hoare triple {5633#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {5633#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:56:46,437 INFO L290 TraceCheckUtils]: 60: Hoare triple {5633#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5633#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:56:46,437 INFO L290 TraceCheckUtils]: 59: Hoare triple {5643#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5633#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:56:46,438 INFO L290 TraceCheckUtils]: 58: Hoare triple {5643#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5643#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 21:56:46,438 INFO L290 TraceCheckUtils]: 57: Hoare triple {5643#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5643#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 21:56:46,439 INFO L290 TraceCheckUtils]: 56: Hoare triple {5653#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5643#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 21:56:46,439 INFO L290 TraceCheckUtils]: 55: Hoare triple {5653#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5653#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-27 21:56:46,439 INFO L290 TraceCheckUtils]: 54: Hoare triple {5653#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5653#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-27 21:56:46,440 INFO L290 TraceCheckUtils]: 53: Hoare triple {5663#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5653#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-27 21:56:46,440 INFO L290 TraceCheckUtils]: 52: Hoare triple {5663#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5663#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 21:56:46,440 INFO L290 TraceCheckUtils]: 51: Hoare triple {5663#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5663#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 21:56:46,441 INFO L290 TraceCheckUtils]: 50: Hoare triple {5673#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5663#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 21:56:46,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {5673#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5673#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:56:46,442 INFO L290 TraceCheckUtils]: 48: Hoare triple {5673#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5673#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:56:46,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {5683#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5673#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:56:46,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {5683#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5683#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 21:56:46,443 INFO L290 TraceCheckUtils]: 45: Hoare triple {5683#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5683#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 21:56:46,443 INFO L290 TraceCheckUtils]: 44: Hoare triple {5693#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5683#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 21:56:46,444 INFO L290 TraceCheckUtils]: 43: Hoare triple {5693#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5693#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:56:46,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {5693#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5693#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:56:46,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {5703#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5693#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:56:46,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {5703#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5703#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 21:56:46,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {5703#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5703#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 21:56:46,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {5713#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5703#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 21:56:46,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {5713#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5713#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 21:56:46,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {5713#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5713#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 21:56:46,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {5723#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5713#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 21:56:46,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {5723#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5723#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-27 21:56:46,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {5723#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5723#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-27 21:56:46,448 INFO L290 TraceCheckUtils]: 32: Hoare triple {5733#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5723#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-27 21:56:46,448 INFO L290 TraceCheckUtils]: 31: Hoare triple {5733#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5733#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-27 21:56:46,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {5733#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5733#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-27 21:56:46,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {5743#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5733#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-27 21:56:46,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {5743#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5743#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 21:56:46,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {5743#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5743#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 21:56:46,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {5753#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5743#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 21:56:46,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {5753#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5753#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 21:56:46,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {5753#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5753#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 21:56:46,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {5763#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5753#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 21:56:46,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {5763#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5763#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} is VALID [2022-04-27 21:56:46,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {5763#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5763#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} is VALID [2022-04-27 21:56:46,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {5773#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5763#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} is VALID [2022-04-27 21:56:46,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {5773#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5773#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 21:56:46,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {5773#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5773#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 21:56:46,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {5783#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5773#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 21:56:46,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {5783#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5783#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-27 21:56:46,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {5783#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5783#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-27 21:56:46,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {5793#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5783#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-27 21:56:46,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {5793#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5793#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 21:56:46,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {5793#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5793#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 21:56:46,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {5803#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5793#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 21:56:46,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {5803#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5803#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-27 21:56:46,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {5803#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5803#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-27 21:56:46,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {5813#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5803#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-27 21:56:46,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {5813#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {5813#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:56:46,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {5813#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5813#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:56:46,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {5332#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {5813#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:56:46,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {5332#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5332#true} is VALID [2022-04-27 21:56:46,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5332#true} {5332#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5332#true} is VALID [2022-04-27 21:56:46,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {5332#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5332#true} is VALID [2022-04-27 21:56:46,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {5332#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {5332#true} is VALID [2022-04-27 21:56:46,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {5332#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5332#true} is VALID [2022-04-27 21:56:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 157 proven. 551 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 21:56:46,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173473273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:56:46,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:56:46,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2022-04-27 21:56:46,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736437814] [2022-04-27 21:56:46,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:56:46,472 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-27 21:56:46,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:56:46,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:56:46,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:56:46,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-27 21:56:46,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:56:46,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-27 21:56:46,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=1368, Unknown=0, NotChecked=0, Total=1892 [2022-04-27 21:56:46,570 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:57:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:57:54,881 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2022-04-27 21:57:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-27 21:57:54,881 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-27 21:57:54,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:57:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:57:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 165 transitions. [2022-04-27 21:57:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:57:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 165 transitions. [2022-04-27 21:57:54,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 165 transitions. [2022-04-27 21:57:55,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:57:55,115 INFO L225 Difference]: With dead ends: 160 [2022-04-27 21:57:55,115 INFO L226 Difference]: Without dead ends: 144 [2022-04-27 21:57:55,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 66.7s TimeCoverageRelationStatistics Valid=1882, Invalid=5089, Unknown=1, NotChecked=0, Total=6972 [2022-04-27 21:57:55,117 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 169 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:57:55,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 114 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 21:57:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-27 21:57:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-04-27 21:57:55,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:57:55,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:57:55,196 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:57:55,197 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:57:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:57:55,198 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-04-27 21:57:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-04-27 21:57:55,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:57:55,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:57:55,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-27 21:57:55,199 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-27 21:57:55,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:57:55,201 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-04-27 21:57:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-04-27 21:57:55,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:57:55,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:57:55,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:57:55,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:57:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:57:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2022-04-27 21:57:55,205 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 77 [2022-04-27 21:57:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:57:55,205 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2022-04-27 21:57:55,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:57:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-04-27 21:57:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-27 21:57:55,206 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:57:55,206 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 40, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:57:55,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 21:57:55,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:57:55,429 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:57:55,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:57:55,429 INFO L85 PathProgramCache]: Analyzing trace with hash 439564262, now seen corresponding path program 8 times [2022-04-27 21:57:55,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:57:55,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227612150] [2022-04-27 21:57:55,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:57:55,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:57:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:57:56,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:57:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:57:56,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {6666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6620#true} is VALID [2022-04-27 21:57:56,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {6620#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6620#true} is VALID [2022-04-27 21:57:56,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6620#true} {6620#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6620#true} is VALID [2022-04-27 21:57:56,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {6620#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:57:56,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {6666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6620#true} is VALID [2022-04-27 21:57:56,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {6620#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6620#true} is VALID [2022-04-27 21:57:56,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6620#true} {6620#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6620#true} is VALID [2022-04-27 21:57:56,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {6620#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6620#true} is VALID [2022-04-27 21:57:56,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {6620#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {6625#(= main_~x~0 0)} is VALID [2022-04-27 21:57:56,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {6625#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6625#(= main_~x~0 0)} is VALID [2022-04-27 21:57:56,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {6625#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6625#(= main_~x~0 0)} is VALID [2022-04-27 21:57:56,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {6625#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6626#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:57:56,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {6626#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6626#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:57:56,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {6626#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6626#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:57:56,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {6626#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:57:56,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {6627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:57:56,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {6627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:57:56,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {6627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6628#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:57:56,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {6628#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6628#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:57:56,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {6628#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6628#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:57:56,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {6628#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6629#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:57:56,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {6629#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6629#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:57:56,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {6629#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6629#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:57:56,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {6629#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6630#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:57:56,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {6630#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6630#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:57:56,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {6630#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6630#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:57:56,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {6630#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6631#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:57:56,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {6631#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6631#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:57:56,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {6631#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6631#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:57:56,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {6631#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6632#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:57:56,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {6632#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6632#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:57:56,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {6632#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6632#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:57:56,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {6632#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6633#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:57:56,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {6633#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6633#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:57:56,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {6633#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6633#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:57:56,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {6633#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6634#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:57:56,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {6634#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6634#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:57:56,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {6634#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6634#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:57:56,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {6634#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6635#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:57:56,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {6635#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6635#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:57:56,560 INFO L290 TraceCheckUtils]: 37: Hoare triple {6635#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6635#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:57:56,560 INFO L290 TraceCheckUtils]: 38: Hoare triple {6635#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6636#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:57:56,561 INFO L290 TraceCheckUtils]: 39: Hoare triple {6636#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6636#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:57:56,561 INFO L290 TraceCheckUtils]: 40: Hoare triple {6636#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6636#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:57:56,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {6636#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:57:56,562 INFO L290 TraceCheckUtils]: 42: Hoare triple {6637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:57:56,563 INFO L290 TraceCheckUtils]: 43: Hoare triple {6637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:57:56,563 INFO L290 TraceCheckUtils]: 44: Hoare triple {6637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6638#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:57:56,564 INFO L290 TraceCheckUtils]: 45: Hoare triple {6638#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6638#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:57:56,564 INFO L290 TraceCheckUtils]: 46: Hoare triple {6638#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6638#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:57:56,565 INFO L290 TraceCheckUtils]: 47: Hoare triple {6638#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6639#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:57:56,566 INFO L290 TraceCheckUtils]: 48: Hoare triple {6639#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6639#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:57:56,566 INFO L290 TraceCheckUtils]: 49: Hoare triple {6639#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6639#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:57:56,567 INFO L290 TraceCheckUtils]: 50: Hoare triple {6639#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6640#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:57:56,567 INFO L290 TraceCheckUtils]: 51: Hoare triple {6640#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6640#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:57:56,568 INFO L290 TraceCheckUtils]: 52: Hoare triple {6640#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6640#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:57:56,568 INFO L290 TraceCheckUtils]: 53: Hoare triple {6640#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6641#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:57:56,569 INFO L290 TraceCheckUtils]: 54: Hoare triple {6641#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6641#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:57:56,569 INFO L290 TraceCheckUtils]: 55: Hoare triple {6641#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6641#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:57:56,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {6641#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6642#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:57:56,570 INFO L290 TraceCheckUtils]: 57: Hoare triple {6642#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6642#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:57:56,571 INFO L290 TraceCheckUtils]: 58: Hoare triple {6642#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6642#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:57:56,571 INFO L290 TraceCheckUtils]: 59: Hoare triple {6642#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6643#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 21:57:56,572 INFO L290 TraceCheckUtils]: 60: Hoare triple {6643#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6643#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 21:57:56,572 INFO L290 TraceCheckUtils]: 61: Hoare triple {6643#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6643#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 21:57:56,573 INFO L290 TraceCheckUtils]: 62: Hoare triple {6643#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6644#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:57:56,573 INFO L290 TraceCheckUtils]: 63: Hoare triple {6644#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6644#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:57:56,574 INFO L290 TraceCheckUtils]: 64: Hoare triple {6644#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6644#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:57:56,574 INFO L290 TraceCheckUtils]: 65: Hoare triple {6644#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6645#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 21:57:56,575 INFO L290 TraceCheckUtils]: 66: Hoare triple {6645#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6645#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 21:57:56,575 INFO L290 TraceCheckUtils]: 67: Hoare triple {6645#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6645#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 21:57:56,576 INFO L290 TraceCheckUtils]: 68: Hoare triple {6645#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6646#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 21:57:56,576 INFO L290 TraceCheckUtils]: 69: Hoare triple {6646#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6646#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 21:57:56,576 INFO L290 TraceCheckUtils]: 70: Hoare triple {6646#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6646#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 21:57:56,577 INFO L290 TraceCheckUtils]: 71: Hoare triple {6646#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6647#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 21:57:56,577 INFO L290 TraceCheckUtils]: 72: Hoare triple {6647#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6647#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 21:57:56,578 INFO L290 TraceCheckUtils]: 73: Hoare triple {6647#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6647#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 21:57:56,578 INFO L290 TraceCheckUtils]: 74: Hoare triple {6647#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6648#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 21:57:56,579 INFO L290 TraceCheckUtils]: 75: Hoare triple {6648#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6648#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 21:57:56,579 INFO L290 TraceCheckUtils]: 76: Hoare triple {6648#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6648#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 21:57:56,580 INFO L290 TraceCheckUtils]: 77: Hoare triple {6648#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6649#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 21:57:56,580 INFO L290 TraceCheckUtils]: 78: Hoare triple {6649#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6649#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 21:57:56,581 INFO L290 TraceCheckUtils]: 79: Hoare triple {6649#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6649#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 21:57:56,581 INFO L290 TraceCheckUtils]: 80: Hoare triple {6649#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6650#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 21:57:56,582 INFO L290 TraceCheckUtils]: 81: Hoare triple {6650#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6650#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 21:57:56,582 INFO L290 TraceCheckUtils]: 82: Hoare triple {6650#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6650#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 21:57:56,583 INFO L290 TraceCheckUtils]: 83: Hoare triple {6650#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6651#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 21:57:56,583 INFO L290 TraceCheckUtils]: 84: Hoare triple {6651#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6651#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 21:57:56,583 INFO L290 TraceCheckUtils]: 85: Hoare triple {6651#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6651#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 21:57:56,584 INFO L290 TraceCheckUtils]: 86: Hoare triple {6651#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6652#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 21:57:56,584 INFO L290 TraceCheckUtils]: 87: Hoare triple {6652#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6652#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 21:57:56,585 INFO L290 TraceCheckUtils]: 88: Hoare triple {6652#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6652#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 21:57:56,585 INFO L290 TraceCheckUtils]: 89: Hoare triple {6652#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6653#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 21:57:56,586 INFO L290 TraceCheckUtils]: 90: Hoare triple {6653#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6653#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 21:57:56,586 INFO L290 TraceCheckUtils]: 91: Hoare triple {6653#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6653#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 21:57:56,587 INFO L290 TraceCheckUtils]: 92: Hoare triple {6653#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6654#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 21:57:56,587 INFO L290 TraceCheckUtils]: 93: Hoare triple {6654#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6654#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 21:57:56,588 INFO L290 TraceCheckUtils]: 94: Hoare triple {6654#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6654#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 21:57:56,588 INFO L290 TraceCheckUtils]: 95: Hoare triple {6654#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6655#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 21:57:56,589 INFO L290 TraceCheckUtils]: 96: Hoare triple {6655#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6655#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 21:57:56,589 INFO L290 TraceCheckUtils]: 97: Hoare triple {6655#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6655#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 21:57:56,590 INFO L290 TraceCheckUtils]: 98: Hoare triple {6655#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6656#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 21:57:56,590 INFO L290 TraceCheckUtils]: 99: Hoare triple {6656#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6656#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 21:57:56,591 INFO L290 TraceCheckUtils]: 100: Hoare triple {6656#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6656#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 21:57:56,591 INFO L290 TraceCheckUtils]: 101: Hoare triple {6656#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6657#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 21:57:56,592 INFO L290 TraceCheckUtils]: 102: Hoare triple {6657#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6657#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 21:57:56,592 INFO L290 TraceCheckUtils]: 103: Hoare triple {6657#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6657#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 21:57:56,593 INFO L290 TraceCheckUtils]: 104: Hoare triple {6657#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6658#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 21:57:56,593 INFO L290 TraceCheckUtils]: 105: Hoare triple {6658#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6658#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 21:57:56,593 INFO L290 TraceCheckUtils]: 106: Hoare triple {6658#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6658#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 21:57:56,594 INFO L290 TraceCheckUtils]: 107: Hoare triple {6658#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6659#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 21:57:56,594 INFO L290 TraceCheckUtils]: 108: Hoare triple {6659#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6659#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 21:57:56,595 INFO L290 TraceCheckUtils]: 109: Hoare triple {6659#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6659#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 21:57:56,595 INFO L290 TraceCheckUtils]: 110: Hoare triple {6659#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6660#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 21:57:56,596 INFO L290 TraceCheckUtils]: 111: Hoare triple {6660#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6660#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 21:57:56,596 INFO L290 TraceCheckUtils]: 112: Hoare triple {6660#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6660#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 21:57:56,597 INFO L290 TraceCheckUtils]: 113: Hoare triple {6660#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6661#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 21:57:56,597 INFO L290 TraceCheckUtils]: 114: Hoare triple {6661#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6661#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 21:57:56,597 INFO L290 TraceCheckUtils]: 115: Hoare triple {6661#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6661#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 21:57:56,598 INFO L290 TraceCheckUtils]: 116: Hoare triple {6661#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6662#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 21:57:56,598 INFO L290 TraceCheckUtils]: 117: Hoare triple {6662#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6662#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 21:57:56,598 INFO L290 TraceCheckUtils]: 118: Hoare triple {6662#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6662#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 21:57:56,599 INFO L290 TraceCheckUtils]: 119: Hoare triple {6662#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6663#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 21:57:56,599 INFO L290 TraceCheckUtils]: 120: Hoare triple {6663#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6663#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 21:57:56,600 INFO L290 TraceCheckUtils]: 121: Hoare triple {6663#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6663#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 21:57:56,600 INFO L290 TraceCheckUtils]: 122: Hoare triple {6663#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6664#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-27 21:57:56,600 INFO L290 TraceCheckUtils]: 123: Hoare triple {6664#(and (<= main_~x~0 39) (<= 39 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6664#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-27 21:57:56,601 INFO L290 TraceCheckUtils]: 124: Hoare triple {6664#(and (<= main_~x~0 39) (<= 39 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6664#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-27 21:57:56,601 INFO L290 TraceCheckUtils]: 125: Hoare triple {6664#(and (<= main_~x~0 39) (<= 39 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6665#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} is VALID [2022-04-27 21:57:56,601 INFO L290 TraceCheckUtils]: 126: Hoare triple {6665#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6665#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} is VALID [2022-04-27 21:57:56,602 INFO L290 TraceCheckUtils]: 127: Hoare triple {6665#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {6621#false} is VALID [2022-04-27 21:57:56,602 INFO L290 TraceCheckUtils]: 128: Hoare triple {6621#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6621#false} is VALID [2022-04-27 21:57:56,602 INFO L290 TraceCheckUtils]: 129: Hoare triple {6621#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6621#false} is VALID [2022-04-27 21:57:56,602 INFO L290 TraceCheckUtils]: 130: Hoare triple {6621#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {6621#false} is VALID [2022-04-27 21:57:56,602 INFO L290 TraceCheckUtils]: 131: Hoare triple {6621#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6621#false} is VALID [2022-04-27 21:57:56,602 INFO L290 TraceCheckUtils]: 132: Hoare triple {6621#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6621#false} is VALID [2022-04-27 21:57:56,602 INFO L290 TraceCheckUtils]: 133: Hoare triple {6621#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {6621#false} is VALID [2022-04-27 21:57:56,602 INFO L290 TraceCheckUtils]: 134: Hoare triple {6621#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6621#false} is VALID [2022-04-27 21:57:56,602 INFO L290 TraceCheckUtils]: 135: Hoare triple {6621#false} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6621#false} is VALID [2022-04-27 21:57:56,602 INFO L290 TraceCheckUtils]: 136: Hoare triple {6621#false} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {6621#false} is VALID [2022-04-27 21:57:56,602 INFO L290 TraceCheckUtils]: 137: Hoare triple {6621#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6621#false} is VALID [2022-04-27 21:57:56,603 INFO L290 TraceCheckUtils]: 138: Hoare triple {6621#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {6621#false} is VALID [2022-04-27 21:57:56,603 INFO L272 TraceCheckUtils]: 139: Hoare triple {6621#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {6621#false} is VALID [2022-04-27 21:57:56,603 INFO L290 TraceCheckUtils]: 140: Hoare triple {6621#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6621#false} is VALID [2022-04-27 21:57:56,603 INFO L290 TraceCheckUtils]: 141: Hoare triple {6621#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6621#false} is VALID [2022-04-27 21:57:56,603 INFO L290 TraceCheckUtils]: 142: Hoare triple {6621#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6621#false} is VALID [2022-04-27 21:57:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 447 proven. 2420 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 21:57:56,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:57:56,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227612150] [2022-04-27 21:57:56,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227612150] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:57:56,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348473347] [2022-04-27 21:57:56,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:57:56,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:57:56,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:57:56,605 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:57:56,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 21:57:56,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 21:57:56,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:57:56,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 103 conjunts are in the unsatisfiable core [2022-04-27 21:57:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:57:56,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:57:59,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {6620#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6620#true} is VALID [2022-04-27 21:57:59,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {6620#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6620#true} is VALID [2022-04-27 21:57:59,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {6620#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6620#true} is VALID [2022-04-27 21:57:59,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6620#true} {6620#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6620#true} is VALID [2022-04-27 21:57:59,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {6620#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6620#true} is VALID [2022-04-27 21:57:59,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {6620#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {6685#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {6685#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6685#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {6685#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6685#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {6685#(and (= main_~x~0 0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6695#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {6695#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6695#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {6695#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6695#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {6695#(and (= main_~x~0 1) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6705#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 21:57:59,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {6705#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6705#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 21:57:59,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {6705#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6705#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 21:57:59,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {6705#(and (= 5000000 main_~z~0) (= main_~x~0 2))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6715#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {6715#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6715#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {6715#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6715#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {6715#(and (= main_~x~0 3) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6725#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 21:57:59,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {6725#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6725#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 21:57:59,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {6725#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6725#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 21:57:59,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {6725#(and (= 5000000 main_~z~0) (= main_~x~0 4))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6735#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 21:57:59,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {6735#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6735#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 21:57:59,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {6735#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6735#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 21:57:59,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {6735#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6745#(and (= main_~x~0 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {6745#(and (= main_~x~0 6) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6745#(and (= main_~x~0 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {6745#(and (= main_~x~0 6) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6745#(and (= main_~x~0 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {6745#(and (= main_~x~0 6) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6755#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {6755#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6755#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {6755#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6755#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {6755#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6765#(and (= 5000000 main_~z~0) (= main_~x~0 8))} is VALID [2022-04-27 21:57:59,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {6765#(and (= 5000000 main_~z~0) (= main_~x~0 8))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6765#(and (= 5000000 main_~z~0) (= main_~x~0 8))} is VALID [2022-04-27 21:57:59,448 INFO L290 TraceCheckUtils]: 31: Hoare triple {6765#(and (= 5000000 main_~z~0) (= main_~x~0 8))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6765#(and (= 5000000 main_~z~0) (= main_~x~0 8))} is VALID [2022-04-27 21:57:59,448 INFO L290 TraceCheckUtils]: 32: Hoare triple {6765#(and (= 5000000 main_~z~0) (= main_~x~0 8))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6775#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {6775#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6775#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,449 INFO L290 TraceCheckUtils]: 34: Hoare triple {6775#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6775#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {6775#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6785#(and (= main_~x~0 10) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,449 INFO L290 TraceCheckUtils]: 36: Hoare triple {6785#(and (= main_~x~0 10) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6785#(and (= main_~x~0 10) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,450 INFO L290 TraceCheckUtils]: 37: Hoare triple {6785#(and (= main_~x~0 10) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6785#(and (= main_~x~0 10) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,450 INFO L290 TraceCheckUtils]: 38: Hoare triple {6785#(and (= main_~x~0 10) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6795#(and (= main_~x~0 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,450 INFO L290 TraceCheckUtils]: 39: Hoare triple {6795#(and (= main_~x~0 11) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6795#(and (= main_~x~0 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,451 INFO L290 TraceCheckUtils]: 40: Hoare triple {6795#(and (= main_~x~0 11) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6795#(and (= main_~x~0 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,451 INFO L290 TraceCheckUtils]: 41: Hoare triple {6795#(and (= main_~x~0 11) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6805#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {6805#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6805#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,452 INFO L290 TraceCheckUtils]: 43: Hoare triple {6805#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6805#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,452 INFO L290 TraceCheckUtils]: 44: Hoare triple {6805#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6815#(and (= main_~x~0 13) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,452 INFO L290 TraceCheckUtils]: 45: Hoare triple {6815#(and (= main_~x~0 13) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6815#(and (= main_~x~0 13) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,453 INFO L290 TraceCheckUtils]: 46: Hoare triple {6815#(and (= main_~x~0 13) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6815#(and (= main_~x~0 13) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,454 INFO L290 TraceCheckUtils]: 47: Hoare triple {6815#(and (= main_~x~0 13) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6825#(and (= main_~x~0 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,454 INFO L290 TraceCheckUtils]: 48: Hoare triple {6825#(and (= main_~x~0 14) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6825#(and (= main_~x~0 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,454 INFO L290 TraceCheckUtils]: 49: Hoare triple {6825#(and (= main_~x~0 14) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6825#(and (= main_~x~0 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,455 INFO L290 TraceCheckUtils]: 50: Hoare triple {6825#(and (= main_~x~0 14) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6835#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,455 INFO L290 TraceCheckUtils]: 51: Hoare triple {6835#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6835#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,455 INFO L290 TraceCheckUtils]: 52: Hoare triple {6835#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6835#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,456 INFO L290 TraceCheckUtils]: 53: Hoare triple {6835#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6845#(and (= 5000000 main_~z~0) (= main_~x~0 16))} is VALID [2022-04-27 21:57:59,456 INFO L290 TraceCheckUtils]: 54: Hoare triple {6845#(and (= 5000000 main_~z~0) (= main_~x~0 16))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6845#(and (= 5000000 main_~z~0) (= main_~x~0 16))} is VALID [2022-04-27 21:57:59,456 INFO L290 TraceCheckUtils]: 55: Hoare triple {6845#(and (= 5000000 main_~z~0) (= main_~x~0 16))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6845#(and (= 5000000 main_~z~0) (= main_~x~0 16))} is VALID [2022-04-27 21:57:59,457 INFO L290 TraceCheckUtils]: 56: Hoare triple {6845#(and (= 5000000 main_~z~0) (= main_~x~0 16))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6855#(and (= main_~x~0 17) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,457 INFO L290 TraceCheckUtils]: 57: Hoare triple {6855#(and (= main_~x~0 17) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6855#(and (= main_~x~0 17) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,457 INFO L290 TraceCheckUtils]: 58: Hoare triple {6855#(and (= main_~x~0 17) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6855#(and (= main_~x~0 17) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,458 INFO L290 TraceCheckUtils]: 59: Hoare triple {6855#(and (= main_~x~0 17) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6865#(and (= main_~x~0 18) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,458 INFO L290 TraceCheckUtils]: 60: Hoare triple {6865#(and (= main_~x~0 18) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6865#(and (= main_~x~0 18) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,458 INFO L290 TraceCheckUtils]: 61: Hoare triple {6865#(and (= main_~x~0 18) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6865#(and (= main_~x~0 18) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,459 INFO L290 TraceCheckUtils]: 62: Hoare triple {6865#(and (= main_~x~0 18) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6875#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,459 INFO L290 TraceCheckUtils]: 63: Hoare triple {6875#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6875#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,459 INFO L290 TraceCheckUtils]: 64: Hoare triple {6875#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6875#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,460 INFO L290 TraceCheckUtils]: 65: Hoare triple {6875#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6885#(and (= main_~x~0 20) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,460 INFO L290 TraceCheckUtils]: 66: Hoare triple {6885#(and (= main_~x~0 20) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6885#(and (= main_~x~0 20) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,460 INFO L290 TraceCheckUtils]: 67: Hoare triple {6885#(and (= main_~x~0 20) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6885#(and (= main_~x~0 20) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,461 INFO L290 TraceCheckUtils]: 68: Hoare triple {6885#(and (= main_~x~0 20) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6895#(and (= 5000000 main_~z~0) (= main_~x~0 21))} is VALID [2022-04-27 21:57:59,461 INFO L290 TraceCheckUtils]: 69: Hoare triple {6895#(and (= 5000000 main_~z~0) (= main_~x~0 21))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6895#(and (= 5000000 main_~z~0) (= main_~x~0 21))} is VALID [2022-04-27 21:57:59,461 INFO L290 TraceCheckUtils]: 70: Hoare triple {6895#(and (= 5000000 main_~z~0) (= main_~x~0 21))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6895#(and (= 5000000 main_~z~0) (= main_~x~0 21))} is VALID [2022-04-27 21:57:59,462 INFO L290 TraceCheckUtils]: 71: Hoare triple {6895#(and (= 5000000 main_~z~0) (= main_~x~0 21))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6905#(and (= main_~x~0 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,462 INFO L290 TraceCheckUtils]: 72: Hoare triple {6905#(and (= main_~x~0 22) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6905#(and (= main_~x~0 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,462 INFO L290 TraceCheckUtils]: 73: Hoare triple {6905#(and (= main_~x~0 22) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6905#(and (= main_~x~0 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,463 INFO L290 TraceCheckUtils]: 74: Hoare triple {6905#(and (= main_~x~0 22) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6915#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,463 INFO L290 TraceCheckUtils]: 75: Hoare triple {6915#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6915#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,463 INFO L290 TraceCheckUtils]: 76: Hoare triple {6915#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6915#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,464 INFO L290 TraceCheckUtils]: 77: Hoare triple {6915#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6925#(and (= main_~x~0 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,464 INFO L290 TraceCheckUtils]: 78: Hoare triple {6925#(and (= main_~x~0 24) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6925#(and (= main_~x~0 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,464 INFO L290 TraceCheckUtils]: 79: Hoare triple {6925#(and (= main_~x~0 24) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6925#(and (= main_~x~0 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,465 INFO L290 TraceCheckUtils]: 80: Hoare triple {6925#(and (= main_~x~0 24) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6935#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,465 INFO L290 TraceCheckUtils]: 81: Hoare triple {6935#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6935#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,465 INFO L290 TraceCheckUtils]: 82: Hoare triple {6935#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6935#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,466 INFO L290 TraceCheckUtils]: 83: Hoare triple {6935#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6945#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,466 INFO L290 TraceCheckUtils]: 84: Hoare triple {6945#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6945#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,466 INFO L290 TraceCheckUtils]: 85: Hoare triple {6945#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6945#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,467 INFO L290 TraceCheckUtils]: 86: Hoare triple {6945#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6955#(and (= main_~x~0 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,467 INFO L290 TraceCheckUtils]: 87: Hoare triple {6955#(and (= main_~x~0 27) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6955#(and (= main_~x~0 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,467 INFO L290 TraceCheckUtils]: 88: Hoare triple {6955#(and (= main_~x~0 27) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6955#(and (= main_~x~0 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,468 INFO L290 TraceCheckUtils]: 89: Hoare triple {6955#(and (= main_~x~0 27) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6965#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,468 INFO L290 TraceCheckUtils]: 90: Hoare triple {6965#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6965#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,468 INFO L290 TraceCheckUtils]: 91: Hoare triple {6965#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6965#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,469 INFO L290 TraceCheckUtils]: 92: Hoare triple {6965#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6975#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,469 INFO L290 TraceCheckUtils]: 93: Hoare triple {6975#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6975#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,469 INFO L290 TraceCheckUtils]: 94: Hoare triple {6975#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6975#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,470 INFO L290 TraceCheckUtils]: 95: Hoare triple {6975#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6985#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} is VALID [2022-04-27 21:57:59,470 INFO L290 TraceCheckUtils]: 96: Hoare triple {6985#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6985#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} is VALID [2022-04-27 21:57:59,470 INFO L290 TraceCheckUtils]: 97: Hoare triple {6985#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6985#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} is VALID [2022-04-27 21:57:59,471 INFO L290 TraceCheckUtils]: 98: Hoare triple {6985#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6995#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,472 INFO L290 TraceCheckUtils]: 99: Hoare triple {6995#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6995#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,472 INFO L290 TraceCheckUtils]: 100: Hoare triple {6995#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {6995#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,473 INFO L290 TraceCheckUtils]: 101: Hoare triple {6995#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7005#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,473 INFO L290 TraceCheckUtils]: 102: Hoare triple {7005#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7005#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,474 INFO L290 TraceCheckUtils]: 103: Hoare triple {7005#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7005#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,474 INFO L290 TraceCheckUtils]: 104: Hoare triple {7005#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7015#(and (= main_~x~0 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,474 INFO L290 TraceCheckUtils]: 105: Hoare triple {7015#(and (= main_~x~0 33) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7015#(and (= main_~x~0 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,475 INFO L290 TraceCheckUtils]: 106: Hoare triple {7015#(and (= main_~x~0 33) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7015#(and (= main_~x~0 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,475 INFO L290 TraceCheckUtils]: 107: Hoare triple {7015#(and (= main_~x~0 33) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7025#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,476 INFO L290 TraceCheckUtils]: 108: Hoare triple {7025#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7025#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,476 INFO L290 TraceCheckUtils]: 109: Hoare triple {7025#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7025#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,477 INFO L290 TraceCheckUtils]: 110: Hoare triple {7025#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7035#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,477 INFO L290 TraceCheckUtils]: 111: Hoare triple {7035#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7035#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,477 INFO L290 TraceCheckUtils]: 112: Hoare triple {7035#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7035#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,478 INFO L290 TraceCheckUtils]: 113: Hoare triple {7035#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7045#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} is VALID [2022-04-27 21:57:59,478 INFO L290 TraceCheckUtils]: 114: Hoare triple {7045#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7045#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} is VALID [2022-04-27 21:57:59,479 INFO L290 TraceCheckUtils]: 115: Hoare triple {7045#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7045#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} is VALID [2022-04-27 21:57:59,479 INFO L290 TraceCheckUtils]: 116: Hoare triple {7045#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7055#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,480 INFO L290 TraceCheckUtils]: 117: Hoare triple {7055#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7055#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,480 INFO L290 TraceCheckUtils]: 118: Hoare triple {7055#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7055#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,481 INFO L290 TraceCheckUtils]: 119: Hoare triple {7055#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7065#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,481 INFO L290 TraceCheckUtils]: 120: Hoare triple {7065#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7065#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,481 INFO L290 TraceCheckUtils]: 121: Hoare triple {7065#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7065#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,482 INFO L290 TraceCheckUtils]: 122: Hoare triple {7065#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7075#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} is VALID [2022-04-27 21:57:59,482 INFO L290 TraceCheckUtils]: 123: Hoare triple {7075#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7075#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} is VALID [2022-04-27 21:57:59,483 INFO L290 TraceCheckUtils]: 124: Hoare triple {7075#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7075#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} is VALID [2022-04-27 21:57:59,483 INFO L290 TraceCheckUtils]: 125: Hoare triple {7075#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7085#(and (= 40 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,484 INFO L290 TraceCheckUtils]: 126: Hoare triple {7085#(and (= 40 main_~x~0) (= 5000000 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7085#(and (= 40 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 21:57:59,484 INFO L290 TraceCheckUtils]: 127: Hoare triple {7085#(and (= 40 main_~x~0) (= 5000000 main_~z~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {7092#(and (= 40 main_~x~0) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 21:57:59,485 INFO L290 TraceCheckUtils]: 128: Hoare triple {7092#(and (= 40 main_~x~0) (= 5000000 (+ (- 1) main_~z~0)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7096#(and (= 5000000 (+ (- 1) main_~z~0)) (= 41 main_~x~0))} is VALID [2022-04-27 21:57:59,485 INFO L290 TraceCheckUtils]: 129: Hoare triple {7096#(and (= 5000000 (+ (- 1) main_~z~0)) (= 41 main_~x~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7096#(and (= 5000000 (+ (- 1) main_~z~0)) (= 41 main_~x~0))} is VALID [2022-04-27 21:57:59,485 INFO L290 TraceCheckUtils]: 130: Hoare triple {7096#(and (= 5000000 (+ (- 1) main_~z~0)) (= 41 main_~x~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {7103#(and (= 5000002 main_~z~0) (= 41 main_~x~0))} is VALID [2022-04-27 21:57:59,486 INFO L290 TraceCheckUtils]: 131: Hoare triple {7103#(and (= 5000002 main_~z~0) (= 41 main_~x~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7107#(and (= 41 (+ (- 1) main_~x~0)) (= 5000002 main_~z~0))} is VALID [2022-04-27 21:57:59,486 INFO L290 TraceCheckUtils]: 132: Hoare triple {7107#(and (= 41 (+ (- 1) main_~x~0)) (= 5000002 main_~z~0))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7107#(and (= 41 (+ (- 1) main_~x~0)) (= 5000002 main_~z~0))} is VALID [2022-04-27 21:57:59,487 INFO L290 TraceCheckUtils]: 133: Hoare triple {7107#(and (= 41 (+ (- 1) main_~x~0)) (= 5000002 main_~z~0))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {7114#(and (= 41 (+ (- 1) main_~x~0)) (= 5000003 main_~z~0))} is VALID [2022-04-27 21:57:59,487 INFO L290 TraceCheckUtils]: 134: Hoare triple {7114#(and (= 41 (+ (- 1) main_~x~0)) (= 5000003 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7118#(and (= 5000003 main_~z~0) (= 41 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 21:57:59,488 INFO L290 TraceCheckUtils]: 135: Hoare triple {7118#(and (= 5000003 main_~z~0) (= 41 (+ (- 2) main_~x~0)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7118#(and (= 5000003 main_~z~0) (= 41 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 21:57:59,488 INFO L290 TraceCheckUtils]: 136: Hoare triple {7118#(and (= 5000003 main_~z~0) (= 41 (+ (- 2) main_~x~0)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {7125#(and (= 41 (+ (- 2) main_~x~0)) (= 5000004 main_~z~0))} is VALID [2022-04-27 21:57:59,489 INFO L290 TraceCheckUtils]: 137: Hoare triple {7125#(and (= 41 (+ (- 2) main_~x~0)) (= 5000004 main_~z~0))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7129#(and (= 44 main_~x~0) (= 5000004 main_~z~0))} is VALID [2022-04-27 21:57:59,489 INFO L290 TraceCheckUtils]: 138: Hoare triple {7129#(and (= 44 main_~x~0) (= 5000004 main_~z~0))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {7129#(and (= 44 main_~x~0) (= 5000004 main_~z~0))} is VALID [2022-04-27 21:57:59,490 INFO L272 TraceCheckUtils]: 139: Hoare triple {7129#(and (= 44 main_~x~0) (= 5000004 main_~z~0))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {7136#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:57:59,490 INFO L290 TraceCheckUtils]: 140: Hoare triple {7136#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7140#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:57:59,490 INFO L290 TraceCheckUtils]: 141: Hoare triple {7140#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6621#false} is VALID [2022-04-27 21:57:59,491 INFO L290 TraceCheckUtils]: 142: Hoare triple {6621#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6621#false} is VALID [2022-04-27 21:57:59,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:57:59,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:58:03,942 INFO L290 TraceCheckUtils]: 142: Hoare triple {6621#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6621#false} is VALID [2022-04-27 21:58:03,943 INFO L290 TraceCheckUtils]: 141: Hoare triple {7140#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {6621#false} is VALID [2022-04-27 21:58:03,943 INFO L290 TraceCheckUtils]: 140: Hoare triple {7136#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7140#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:58:03,944 INFO L272 TraceCheckUtils]: 139: Hoare triple {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~x~0_9 4294967296) (mod v_main_~z~0_5 4294967296))) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0] {7136#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:58:03,944 INFO L290 TraceCheckUtils]: 138: Hoare triple {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:58:03,945 INFO L290 TraceCheckUtils]: 137: Hoare triple {7163#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:58:03,952 INFO L290 TraceCheckUtils]: 136: Hoare triple {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {7163#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:58:03,952 INFO L290 TraceCheckUtils]: 135: Hoare triple {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:58:03,953 INFO L290 TraceCheckUtils]: 134: Hoare triple {7163#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:58:03,965 INFO L290 TraceCheckUtils]: 133: Hoare triple {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {7163#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:58:03,966 INFO L290 TraceCheckUtils]: 132: Hoare triple {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:58:03,966 INFO L290 TraceCheckUtils]: 131: Hoare triple {7163#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:58:03,977 INFO L290 TraceCheckUtils]: 130: Hoare triple {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {7163#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:58:03,977 INFO L290 TraceCheckUtils]: 129: Hoare triple {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:58:03,978 INFO L290 TraceCheckUtils]: 128: Hoare triple {7163#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:58:03,982 INFO L290 TraceCheckUtils]: 127: Hoare triple {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [57] L11-->L11-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (<= 5000000 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] {7163#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:58:03,982 INFO L290 TraceCheckUtils]: 126: Hoare triple {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:58:03,983 INFO L290 TraceCheckUtils]: 125: Hoare triple {7163#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7156#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 21:58:03,983 INFO L290 TraceCheckUtils]: 124: Hoare triple {7163#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7163#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:58:03,983 INFO L290 TraceCheckUtils]: 123: Hoare triple {7163#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7163#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:58:03,984 INFO L290 TraceCheckUtils]: 122: Hoare triple {7209#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7163#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:58:03,984 INFO L290 TraceCheckUtils]: 121: Hoare triple {7209#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7209#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:03,985 INFO L290 TraceCheckUtils]: 120: Hoare triple {7209#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7209#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:03,986 INFO L290 TraceCheckUtils]: 119: Hoare triple {7219#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7209#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:03,986 INFO L290 TraceCheckUtils]: 118: Hoare triple {7219#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7219#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:03,986 INFO L290 TraceCheckUtils]: 117: Hoare triple {7219#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7219#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:03,987 INFO L290 TraceCheckUtils]: 116: Hoare triple {7229#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7219#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:03,987 INFO L290 TraceCheckUtils]: 115: Hoare triple {7229#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7229#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 21:58:03,988 INFO L290 TraceCheckUtils]: 114: Hoare triple {7229#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7229#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 21:58:03,988 INFO L290 TraceCheckUtils]: 113: Hoare triple {7239#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7229#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 21:58:03,988 INFO L290 TraceCheckUtils]: 112: Hoare triple {7239#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7239#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:58:03,989 INFO L290 TraceCheckUtils]: 111: Hoare triple {7239#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7239#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:58:03,989 INFO L290 TraceCheckUtils]: 110: Hoare triple {7249#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7239#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:58:03,990 INFO L290 TraceCheckUtils]: 109: Hoare triple {7249#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7249#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 21:58:03,990 INFO L290 TraceCheckUtils]: 108: Hoare triple {7249#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7249#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 21:58:03,991 INFO L290 TraceCheckUtils]: 107: Hoare triple {7259#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7249#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 21:58:03,991 INFO L290 TraceCheckUtils]: 106: Hoare triple {7259#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7259#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:58:03,991 INFO L290 TraceCheckUtils]: 105: Hoare triple {7259#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7259#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:58:03,992 INFO L290 TraceCheckUtils]: 104: Hoare triple {7269#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7259#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:58:03,992 INFO L290 TraceCheckUtils]: 103: Hoare triple {7269#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7269#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 21:58:03,992 INFO L290 TraceCheckUtils]: 102: Hoare triple {7269#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7269#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 21:58:03,993 INFO L290 TraceCheckUtils]: 101: Hoare triple {7279#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7269#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 21:58:03,994 INFO L290 TraceCheckUtils]: 100: Hoare triple {7279#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7279#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 21:58:03,994 INFO L290 TraceCheckUtils]: 99: Hoare triple {7279#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7279#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 21:58:03,994 INFO L290 TraceCheckUtils]: 98: Hoare triple {7289#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7279#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 21:58:03,995 INFO L290 TraceCheckUtils]: 97: Hoare triple {7289#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7289#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:03,999 INFO L290 TraceCheckUtils]: 96: Hoare triple {7289#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7289#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,000 INFO L290 TraceCheckUtils]: 95: Hoare triple {7299#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7289#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,000 INFO L290 TraceCheckUtils]: 94: Hoare triple {7299#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7299#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,001 INFO L290 TraceCheckUtils]: 93: Hoare triple {7299#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7299#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,002 INFO L290 TraceCheckUtils]: 92: Hoare triple {7309#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7299#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,002 INFO L290 TraceCheckUtils]: 91: Hoare triple {7309#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7309#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 21:58:04,002 INFO L290 TraceCheckUtils]: 90: Hoare triple {7309#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7309#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 21:58:04,003 INFO L290 TraceCheckUtils]: 89: Hoare triple {7319#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7309#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 21:58:04,004 INFO L290 TraceCheckUtils]: 88: Hoare triple {7319#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7319#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 21:58:04,004 INFO L290 TraceCheckUtils]: 87: Hoare triple {7319#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7319#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 21:58:04,006 INFO L290 TraceCheckUtils]: 86: Hoare triple {7329#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7319#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 21:58:04,006 INFO L290 TraceCheckUtils]: 85: Hoare triple {7329#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7329#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,007 INFO L290 TraceCheckUtils]: 84: Hoare triple {7329#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7329#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,008 INFO L290 TraceCheckUtils]: 83: Hoare triple {7339#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7329#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,008 INFO L290 TraceCheckUtils]: 82: Hoare triple {7339#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7339#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 21:58:04,008 INFO L290 TraceCheckUtils]: 81: Hoare triple {7339#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7339#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 21:58:04,009 INFO L290 TraceCheckUtils]: 80: Hoare triple {7349#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7339#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 21:58:04,010 INFO L290 TraceCheckUtils]: 79: Hoare triple {7349#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7349#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,010 INFO L290 TraceCheckUtils]: 78: Hoare triple {7349#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7349#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,011 INFO L290 TraceCheckUtils]: 77: Hoare triple {7359#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7349#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,011 INFO L290 TraceCheckUtils]: 76: Hoare triple {7359#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7359#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 21:58:04,011 INFO L290 TraceCheckUtils]: 75: Hoare triple {7359#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7359#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 21:58:04,012 INFO L290 TraceCheckUtils]: 74: Hoare triple {7369#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7359#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 21:58:04,012 INFO L290 TraceCheckUtils]: 73: Hoare triple {7369#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7369#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,013 INFO L290 TraceCheckUtils]: 72: Hoare triple {7369#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7369#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,013 INFO L290 TraceCheckUtils]: 71: Hoare triple {7379#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7369#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,014 INFO L290 TraceCheckUtils]: 70: Hoare triple {7379#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7379#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,014 INFO L290 TraceCheckUtils]: 69: Hoare triple {7379#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7379#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,014 INFO L290 TraceCheckUtils]: 68: Hoare triple {7389#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7379#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,015 INFO L290 TraceCheckUtils]: 67: Hoare triple {7389#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7389#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-27 21:58:04,028 INFO L290 TraceCheckUtils]: 66: Hoare triple {7389#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7389#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-27 21:58:04,029 INFO L290 TraceCheckUtils]: 65: Hoare triple {7399#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7389#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-27 21:58:04,029 INFO L290 TraceCheckUtils]: 64: Hoare triple {7399#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7399#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} is VALID [2022-04-27 21:58:04,029 INFO L290 TraceCheckUtils]: 63: Hoare triple {7399#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7399#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} is VALID [2022-04-27 21:58:04,030 INFO L290 TraceCheckUtils]: 62: Hoare triple {7409#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7399#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} is VALID [2022-04-27 21:58:04,031 INFO L290 TraceCheckUtils]: 61: Hoare triple {7409#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7409#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,031 INFO L290 TraceCheckUtils]: 60: Hoare triple {7409#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7409#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,032 INFO L290 TraceCheckUtils]: 59: Hoare triple {7419#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7409#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,032 INFO L290 TraceCheckUtils]: 58: Hoare triple {7419#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7419#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,033 INFO L290 TraceCheckUtils]: 57: Hoare triple {7419#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7419#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,033 INFO L290 TraceCheckUtils]: 56: Hoare triple {7429#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7419#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,034 INFO L290 TraceCheckUtils]: 55: Hoare triple {7429#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7429#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} is VALID [2022-04-27 21:58:04,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {7429#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7429#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} is VALID [2022-04-27 21:58:04,035 INFO L290 TraceCheckUtils]: 53: Hoare triple {7439#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7429#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} is VALID [2022-04-27 21:58:04,035 INFO L290 TraceCheckUtils]: 52: Hoare triple {7439#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7439#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} is VALID [2022-04-27 21:58:04,036 INFO L290 TraceCheckUtils]: 51: Hoare triple {7439#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7439#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} is VALID [2022-04-27 21:58:04,036 INFO L290 TraceCheckUtils]: 50: Hoare triple {7449#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7439#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} is VALID [2022-04-27 21:58:04,037 INFO L290 TraceCheckUtils]: 49: Hoare triple {7449#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7449#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,037 INFO L290 TraceCheckUtils]: 48: Hoare triple {7449#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7449#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {7459#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7449#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,039 INFO L290 TraceCheckUtils]: 46: Hoare triple {7459#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7459#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,039 INFO L290 TraceCheckUtils]: 45: Hoare triple {7459#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7459#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,040 INFO L290 TraceCheckUtils]: 44: Hoare triple {7469#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7459#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,040 INFO L290 TraceCheckUtils]: 43: Hoare triple {7469#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7469#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,041 INFO L290 TraceCheckUtils]: 42: Hoare triple {7469#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7469#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,041 INFO L290 TraceCheckUtils]: 41: Hoare triple {7479#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7469#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {7479#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7479#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:58:04,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {7479#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7479#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:58:04,043 INFO L290 TraceCheckUtils]: 38: Hoare triple {7489#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7479#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:58:04,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {7489#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7489#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:58:04,044 INFO L290 TraceCheckUtils]: 36: Hoare triple {7489#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7489#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:58:04,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {7499#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7489#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:58:04,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {7499#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7499#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {7499#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7499#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {7509#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7499#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {7509#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7509#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {7509#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7509#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {7519#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7509#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {7519#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7519#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} is VALID [2022-04-27 21:58:04,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {7519#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7519#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} is VALID [2022-04-27 21:58:04,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {7529#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7519#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} is VALID [2022-04-27 21:58:04,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {7529#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7529#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-27 21:58:04,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {7529#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7529#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-27 21:58:04,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {7539#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7529#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-27 21:58:04,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {7539#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7539#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {7539#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7539#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {7549#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7539#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {7549#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7549#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {7549#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7549#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {7559#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7549#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {7559#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7559#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} is VALID [2022-04-27 21:58:04,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {7559#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7559#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} is VALID [2022-04-27 21:58:04,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {7569#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7559#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} is VALID [2022-04-27 21:58:04,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {7569#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7569#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {7569#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7569#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {7579#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7569#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 21:58:04,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {7579#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7579#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} is VALID [2022-04-27 21:58:04,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {7579#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7579#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} is VALID [2022-04-27 21:58:04,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {7589#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7579#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} is VALID [2022-04-27 21:58:04,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {7589#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {7589#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:58:04,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {7589#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {7589#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:58:04,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {6620#true} [51] mainENTRY-->L10-2: Formula: (and (= 5000000 v_main_~z~0_3) (= v_main_~y~0_2 10000000) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {7589#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:58:04,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {6620#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6620#true} is VALID [2022-04-27 21:58:04,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6620#true} {6620#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6620#true} is VALID [2022-04-27 21:58:04,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {6620#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6620#true} is VALID [2022-04-27 21:58:04,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {6620#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {6620#true} is VALID [2022-04-27 21:58:04,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {6620#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6620#true} is VALID [2022-04-27 21:58:04,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2856 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 21:58:04,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348473347] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:58:04,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:58:04,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 53, 45] total 136 [2022-04-27 21:58:04,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719404256] [2022-04-27 21:58:04,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:58:04,065 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 136 states have (on average 2.889705882352941) internal successors, (393), 134 states have internal predecessors, (393), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2022-04-27 21:58:04,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:58:04,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 136 states, 136 states have (on average 2.889705882352941) internal successors, (393), 134 states have internal predecessors, (393), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:58:04,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 400 edges. 400 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:58:04,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-04-27 21:58:04,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:58:04,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-04-27 21:58:04,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=15960, Unknown=0, NotChecked=0, Total=18360 [2022-04-27 21:58:04,395 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand has 136 states, 136 states have (on average 2.889705882352941) internal successors, (393), 134 states have internal predecessors, (393), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:05:13,110 WARN L232 SmtUtils]: Spent 2.91m on a formula simplification that was a NOOP. DAG size: 214 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 22:05:15,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:05:17,134 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:05:19,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:05:21,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:05:23,313 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:05:25,405 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:05:27,417 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:05:29,437 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:05:31,468 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:05:33,482 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:05:35,504 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:05:37,519 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:05:41,828 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:05:45,979 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:05:48,005 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:05:50,018 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:05:52,032 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:05:54,046 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:05:56,061 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:05:58,073 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:06:00,085 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:06:02,099 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:06:04,112 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:06:06,128 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:06:08,141 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:06:10,151 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 22:06:12,165 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false