/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:30:47,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:30:47,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:30:47,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:30:47,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:30:47,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:30:47,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:30:47,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:30:47,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:30:47,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:30:47,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:30:47,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:30:47,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:30:47,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:30:47,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:30:47,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:30:47,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:30:47,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:30:47,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:30:47,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:30:47,284 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:30:47,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:30:47,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:30:47,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:30:47,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:30:47,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:30:47,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:30:47,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:30:47,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:30:47,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:30:47,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:30:47,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:30:47,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:30:47,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:30:47,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:30:47,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:30:47,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:30:47,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:30:47,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:30:47,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:30:47,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:30:47,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:30:47,298 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:30:47,307 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:30:47,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:30:47,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:30:47,308 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:30:47,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:30:47,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:30:47,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:30:47,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:30:47,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:30:47,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:30:47,310 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:30:47,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:30:47,310 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:30:47,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:30:47,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:30:47,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:30:47,310 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:30:47,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:30:47,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:30:47,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:30:47,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:30:47,311 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:30:47,311 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 16:30:47,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:30:47,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:30:47,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:30:47,526 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:30:47,527 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:30:47,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2022-04-27 16:30:47,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ad971e3c/4b566c1e1d9447a99dbcb8853cf3bdf2/FLAG32605a9ec [2022-04-27 16:30:47,912 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:30:47,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2022-04-27 16:30:47,916 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ad971e3c/4b566c1e1d9447a99dbcb8853cf3bdf2/FLAG32605a9ec [2022-04-27 16:30:47,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ad971e3c/4b566c1e1d9447a99dbcb8853cf3bdf2 [2022-04-27 16:30:47,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:30:47,926 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:30:47,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:30:47,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:30:47,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:30:47,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:30:47" (1/1) ... [2022-04-27 16:30:47,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb6f872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:30:47, skipping insertion in model container [2022-04-27 16:30:47,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:30:47" (1/1) ... [2022-04-27 16:30:47,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:30:47,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:30:48,042 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/Mono1_1-2.c[313,326] [2022-04-27 16:30:48,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:30:48,070 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:30:48,077 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/Mono1_1-2.c[313,326] [2022-04-27 16:30:48,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:30:48,087 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:30:48,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:30:48 WrapperNode [2022-04-27 16:30:48,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:30:48,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:30:48,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:30:48,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:30:48,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:30:48" (1/1) ... [2022-04-27 16:30:48,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:30:48" (1/1) ... [2022-04-27 16:30:48,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:30:48" (1/1) ... [2022-04-27 16:30:48,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:30:48" (1/1) ... [2022-04-27 16:30:48,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:30:48" (1/1) ... [2022-04-27 16:30:48,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:30:48" (1/1) ... [2022-04-27 16:30:48,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:30:48" (1/1) ... [2022-04-27 16:30:48,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:30:48,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:30:48,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:30:48,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:30:48,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:30:48" (1/1) ... [2022-04-27 16:30:48,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:30:48,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:30:48,142 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 16:30:48,160 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 16:30:48,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:30:48,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:30:48,173 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:30:48,173 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:30:48,173 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:30:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:30:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:30:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:30:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:30:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:30:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:30:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:30:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:30:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:30:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:30:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:30:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:30:48,213 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:30:48,214 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:30:48,297 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:30:48,301 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:30:48,301 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 16:30:48,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:30:48 BoogieIcfgContainer [2022-04-27 16:30:48,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:30:48,303 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:30:48,303 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:30:48,304 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:30:48,306 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:30:48" (1/1) ... [2022-04-27 16:30:48,307 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:30:48,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:30:48 BasicIcfg [2022-04-27 16:30:48,323 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:30:48,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:30:48,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:30:48,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:30:48,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:30:47" (1/4) ... [2022-04-27 16:30:48,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487ecf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:30:48, skipping insertion in model container [2022-04-27 16:30:48,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:30:48" (2/4) ... [2022-04-27 16:30:48,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487ecf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:30:48, skipping insertion in model container [2022-04-27 16:30:48,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:30:48" (3/4) ... [2022-04-27 16:30:48,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487ecf41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:30:48, skipping insertion in model container [2022-04-27 16:30:48,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:30:48" (4/4) ... [2022-04-27 16:30:48,328 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.cJordan [2022-04-27 16:30:48,336 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:30:48,336 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:30:48,368 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:30:48,377 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@be49162, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2c172fe6 [2022-04-27 16:30:48,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:30:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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 16:30:48,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:30:48,387 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:30:48,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:30:48,388 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:30:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:30:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash -756157467, now seen corresponding path program 1 times [2022-04-27 16:30:48,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:30:48,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924990308] [2022-04-27 16:30:48,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:30:48,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:30:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:48,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:30:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:48,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {22#true} is VALID [2022-04-27 16:30:48,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 16:30:48,520 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 16:30:48,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:30:48,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {22#true} is VALID [2022-04-27 16:30:48,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 16:30:48,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 16:30:48,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 16:30:48,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {22#true} is VALID [2022-04-27 16:30:48,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} [51] L9-2-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 16:30:48,525 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {23#false} is VALID [2022-04-27 16:30:48,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23#false} is VALID [2022-04-27 16:30:48,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 16:30:48,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 16:30:48,526 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 16:30:48,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:30:48,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924990308] [2022-04-27 16:30:48,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924990308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:30:48,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:30:48,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:30:48,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379436837] [2022-04-27 16:30:48,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:30:48,537 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 16:30:48,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:30:48,540 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 16:30:48,585 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 16:30:48,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:30:48,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:30:48,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:30:48,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:30:48,611 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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 16:30:48,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:48,651 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-27 16:30:48,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:30:48,652 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 16:30:48,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:30:48,653 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 16:30:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-04-27 16:30:48,658 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 16:30:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-04-27 16:30:48,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2022-04-27 16:30:48,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:30:48,690 INFO L225 Difference]: With dead ends: 19 [2022-04-27 16:30:48,691 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 16:30:48,692 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 16:30:48,698 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 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 16:30:48,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:30:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 16:30:48,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 16:30:48,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:30:48,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 16:30:48,718 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 16:30:48,718 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 16:30:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:48,720 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 16:30:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 16:30:48,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:30:48,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:30:48,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 13 states. [2022-04-27 16:30:48,720 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 13 states. [2022-04-27 16:30:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:48,722 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 16:30:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 16:30:48,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:30:48,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:30:48,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:30:48,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:30:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 16:30:48,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-27 16:30:48,740 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-27 16:30:48,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:30:48,741 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-27 16:30:48,741 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 16:30:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 16:30:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:30:48,742 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:30:48,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:30:48,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:30:48,744 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:30:48,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:30:48,748 INFO L85 PathProgramCache]: Analyzing trace with hash -755233946, now seen corresponding path program 1 times [2022-04-27 16:30:48,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:30:48,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999919288] [2022-04-27 16:30:48,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:30:48,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:30:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:48,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:30:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:48,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {94#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {88#true} is VALID [2022-04-27 16:30:48,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {88#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-27 16:30:48,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88#true} {88#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-27 16:30:48,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {88#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:30:48,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {94#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {88#true} is VALID [2022-04-27 16:30:48,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {88#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-27 16:30:48,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88#true} {88#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-27 16:30:48,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {88#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#true} is VALID [2022-04-27 16:30:48,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {88#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {93#(= main_~x~0 0)} is VALID [2022-04-27 16:30:48,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {93#(= main_~x~0 0)} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {89#false} is VALID [2022-04-27 16:30:48,826 INFO L272 TraceCheckUtils]: 7: Hoare triple {89#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {89#false} is VALID [2022-04-27 16:30:48,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {89#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {89#false} is VALID [2022-04-27 16:30:48,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {89#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {89#false} is VALID [2022-04-27 16:30:48,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {89#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#false} is VALID [2022-04-27 16:30:48,826 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 16:30:48,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:30:48,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999919288] [2022-04-27 16:30:48,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999919288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:30:48,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:30:48,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:30:48,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616390329] [2022-04-27 16:30:48,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:30:48,828 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 16:30:48,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:30:48,828 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 16:30:48,837 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 16:30:48,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:30:48,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:30:48,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:30:48,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:30:48,838 INFO L87 Difference]: Start difference. First operand 13 states and 14 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 16:30:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:48,885 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 16:30:48,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:30:48,886 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 16:30:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:30:48,886 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 16:30:48,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 16:30:48,890 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 16:30:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 16:30:48,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-27 16:30:48,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:30:48,914 INFO L225 Difference]: With dead ends: 15 [2022-04-27 16:30:48,914 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 16:30:48,916 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 16:30:48,919 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:30:48,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:30:48,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 16:30:48,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 16:30:48,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:30:48,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 16:30:48,923 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 16:30:48,924 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 16:30:48,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:48,928 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 16:30:48,928 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 16:30:48,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:30:48,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:30:48,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 15 states. [2022-04-27 16:30:48,928 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 15 states. [2022-04-27 16:30:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:48,929 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 16:30:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 16:30:48,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:30:48,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:30:48,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:30:48,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:30:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 16:30:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 16:30:48,931 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-27 16:30:48,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:30:48,931 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 16:30:48,931 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 16:30:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 16:30:48,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:30:48,932 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:30:48,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:30:48,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:30:48,932 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:30:48,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:30:48,933 INFO L85 PathProgramCache]: Analyzing trace with hash 980092676, now seen corresponding path program 1 times [2022-04-27 16:30:48,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:30:48,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000098871] [2022-04-27 16:30:48,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:30:48,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:30:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:49,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:30:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:49,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {159#true} is VALID [2022-04-27 16:30:49,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-27 16:30:49,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#true} {159#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-27 16:30:49,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:30:49,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {159#true} is VALID [2022-04-27 16:30:49,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-27 16:30:49,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-27 16:30:49,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-27 16:30:49,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {164#(= main_~x~0 0)} is VALID [2022-04-27 16:30:49,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {164#(= main_~x~0 0)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {164#(= main_~x~0 0)} is VALID [2022-04-27 16:30:49,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {164#(= main_~x~0 0)} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {165#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 16:30:49,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {165#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {160#false} is VALID [2022-04-27 16:30:49,021 INFO L272 TraceCheckUtils]: 9: Hoare triple {160#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {160#false} is VALID [2022-04-27 16:30:49,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {160#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {160#false} is VALID [2022-04-27 16:30:49,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {160#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {160#false} is VALID [2022-04-27 16:30:49,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {160#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {160#false} is VALID [2022-04-27 16:30:49,022 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 16:30:49,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:30:49,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000098871] [2022-04-27 16:30:49,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000098871] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:30:49,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990528113] [2022-04-27 16:30:49,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:30:49,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:30:49,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:30:49,025 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 16:30:49,047 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 16:30:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:49,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 16:30:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:49,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:30:49,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-27 16:30:49,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} [47] 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) 12) (= (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] {159#true} is VALID [2022-04-27 16:30:49,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-27 16:30:49,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-27 16:30:49,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-27 16:30:49,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {164#(= main_~x~0 0)} is VALID [2022-04-27 16:30:49,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {164#(= main_~x~0 0)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {164#(= main_~x~0 0)} is VALID [2022-04-27 16:30:49,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {164#(= main_~x~0 0)} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {191#(= main_~x~0 1)} is VALID [2022-04-27 16:30:49,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {191#(= main_~x~0 1)} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {160#false} is VALID [2022-04-27 16:30:49,176 INFO L272 TraceCheckUtils]: 9: Hoare triple {160#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {160#false} is VALID [2022-04-27 16:30:49,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {160#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {160#false} is VALID [2022-04-27 16:30:49,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {160#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {160#false} is VALID [2022-04-27 16:30:49,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {160#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {160#false} is VALID [2022-04-27 16:30:49,176 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 16:30:49,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:30:49,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {160#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {160#false} is VALID [2022-04-27 16:30:49,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#(not (<= __VERIFIER_assert_~cond 0))} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {160#false} is VALID [2022-04-27 16:30:49,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {214#(< 0 |__VERIFIER_assert_#in~cond|)} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {210#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:30:49,388 INFO L272 TraceCheckUtils]: 9: Hoare triple {218#(= 100000000 (mod main_~x~0 4294967296))} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {214#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:30:49,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {222#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {218#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-27 16:30:49,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#(or (= 100000000 (mod (+ main_~x~0 1) 4294967296)) (< (mod (+ main_~x~0 1) 4294967296) 100000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {222#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:30:49,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#(or (= 100000000 (mod (+ main_~x~0 1) 4294967296)) (< (mod (+ main_~x~0 1) 4294967296) 100000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {226#(or (= 100000000 (mod (+ main_~x~0 1) 4294967296)) (< (mod (+ main_~x~0 1) 4294967296) 100000000))} is VALID [2022-04-27 16:30:49,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {226#(or (= 100000000 (mod (+ main_~x~0 1) 4294967296)) (< (mod (+ main_~x~0 1) 4294967296) 100000000))} is VALID [2022-04-27 16:30:49,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-27 16:30:49,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-27 16:30:49,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-27 16:30:49,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} [47] 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) 12) (= (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] {159#true} is VALID [2022-04-27 16:30:49,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#true} is VALID [2022-04-27 16:30:49,392 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 16:30:49,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990528113] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:30:49,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:30:49,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 7] total 11 [2022-04-27 16:30:49,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255614491] [2022-04-27 16:30:49,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:30:49,395 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 16:30:49,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:30:49,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:49,412 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 16:30:49,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 16:30:49,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:30:49,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 16:30:49,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:30:49,413 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:49,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:49,596 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-27 16:30:49,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:30:49,596 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 16:30:49,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:30:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-04-27 16:30:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-04-27 16:30:49,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2022-04-27 16:30:49,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:30:49,621 INFO L225 Difference]: With dead ends: 18 [2022-04-27 16:30:49,621 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 16:30:49,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-27 16:30:49,622 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:30:49,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:30:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 16:30:49,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 16:30:49,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:30:49,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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 16:30:49,624 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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 16:30:49,624 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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 16:30:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:49,625 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-27 16:30:49,625 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 16:30:49,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:30:49,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:30:49,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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 18 states. [2022-04-27 16:30:49,625 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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 18 states. [2022-04-27 16:30:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:49,626 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-27 16:30:49,626 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 16:30:49,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:30:49,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:30:49,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:30:49,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:30:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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 16:30:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-27 16:30:49,627 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-04-27 16:30:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:30:49,627 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-27 16:30:49,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 16:30:49,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 16:30:49,628 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:30:49,628 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:30:49,646 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 16:30:49,844 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 16:30:49,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:30:49,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:30:49,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1575643231, now seen corresponding path program 1 times [2022-04-27 16:30:49,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:30:49,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002133785] [2022-04-27 16:30:49,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:30:49,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:30:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:49,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:30:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:49,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {328#true} is VALID [2022-04-27 16:30:49,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 16:30:49,918 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {328#true} {328#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 16:30:49,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {328#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:30:49,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {328#true} is VALID [2022-04-27 16:30:49,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {328#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 16:30:49,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {328#true} {328#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 16:30:49,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {328#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 16:30:49,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {328#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {333#(= main_~x~0 0)} is VALID [2022-04-27 16:30:49,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {333#(= main_~x~0 0)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {333#(= main_~x~0 0)} is VALID [2022-04-27 16:30:49,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {333#(= main_~x~0 0)} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {334#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:30:49,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {334#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {334#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:30:49,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {334#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {335#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 16:30:49,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {335#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {335#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 16:30:49,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {335#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {329#false} is VALID [2022-04-27 16:30:49,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {329#false} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {329#false} is VALID [2022-04-27 16:30:49,922 INFO L272 TraceCheckUtils]: 13: Hoare triple {329#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {329#false} is VALID [2022-04-27 16:30:49,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {329#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {329#false} is VALID [2022-04-27 16:30:49,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {329#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {329#false} is VALID [2022-04-27 16:30:49,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {329#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {329#false} is VALID [2022-04-27 16:30:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:30:49,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:30:49,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002133785] [2022-04-27 16:30:49,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002133785] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:30:49,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876626450] [2022-04-27 16:30:49,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:30:49,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:30:49,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:30:49,940 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 16:30:49,941 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 16:30:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:49,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 16:30:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:49,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:30:50,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {328#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 16:30:50,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#true} [47] 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) 12) (= (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] {328#true} is VALID [2022-04-27 16:30:50,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {328#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 16:30:50,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {328#true} {328#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 16:30:50,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {328#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 16:30:50,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {328#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {333#(= main_~x~0 0)} is VALID [2022-04-27 16:30:50,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {333#(= main_~x~0 0)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {333#(= main_~x~0 0)} is VALID [2022-04-27 16:30:50,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {333#(= main_~x~0 0)} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {334#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:30:50,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {334#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {334#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:30:50,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {334#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {367#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:30:50,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {367#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {367#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:30:50,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {367#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {329#false} is VALID [2022-04-27 16:30:50,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {329#false} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {329#false} is VALID [2022-04-27 16:30:50,164 INFO L272 TraceCheckUtils]: 13: Hoare triple {329#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {329#false} is VALID [2022-04-27 16:30:50,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {329#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {329#false} is VALID [2022-04-27 16:30:50,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {329#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {329#false} is VALID [2022-04-27 16:30:50,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {329#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {329#false} is VALID [2022-04-27 16:30:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:30:50,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:30:50,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {329#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {329#false} is VALID [2022-04-27 16:30:50,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {329#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {329#false} is VALID [2022-04-27 16:30:50,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {329#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {329#false} is VALID [2022-04-27 16:30:50,293 INFO L272 TraceCheckUtils]: 13: Hoare triple {329#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {329#false} is VALID [2022-04-27 16:30:50,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {329#false} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {329#false} is VALID [2022-04-27 16:30:50,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {404#(< (mod main_~x~0 4294967296) 10000000)} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {329#false} is VALID [2022-04-27 16:30:50,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {408#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {404#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-27 16:30:50,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {412#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {408#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-27 16:30:50,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {412#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {412#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-27 16:30:50,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {419#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {412#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-27 16:30:50,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {419#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-27 16:30:50,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {328#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {419#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-27 16:30:50,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {328#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 16:30:50,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {328#true} {328#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 16:30:50,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {328#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 16:30:50,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#true} [47] 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) 12) (= (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] {328#true} is VALID [2022-04-27 16:30:50,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {328#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {328#true} is VALID [2022-04-27 16:30:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:30:50,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876626450] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:30:50,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:30:50,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-04-27 16:30:50,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630927123] [2022-04-27 16:30:50,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:30:50,299 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 17 [2022-04-27 16:30:50,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:30:50,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 16:30:50,320 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 16:30:50,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 16:30:50,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:30:50,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 16:30:50,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:30:50,321 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 16:30:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:50,606 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-27 16:30:50,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 16:30:50,606 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 17 [2022-04-27 16:30:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:30:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 16:30:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 30 transitions. [2022-04-27 16:30:50,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 16:30:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 30 transitions. [2022-04-27 16:30:50,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 30 transitions. [2022-04-27 16:30:50,635 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 16:30:50,636 INFO L225 Difference]: With dead ends: 26 [2022-04-27 16:30:50,636 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 16:30:50,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2022-04-27 16:30:50,637 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:30:50,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 29 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:30:50,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 16:30:50,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 16:30:50,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:30:50,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 16:30:50,640 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 16:30:50,640 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 16:30:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:50,641 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-27 16:30:50,641 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-27 16:30:50,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:30:50,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:30:50,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 26 states. [2022-04-27 16:30:50,641 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 26 states. [2022-04-27 16:30:50,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:50,642 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-27 16:30:50,643 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-27 16:30:50,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:30:50,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:30:50,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:30:50,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:30:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 16:30:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-27 16:30:50,644 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 17 [2022-04-27 16:30:50,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:30:50,644 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-27 16:30:50,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 16:30:50,645 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-27 16:30:50,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 16:30:50,645 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:30:50,645 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:30:50,663 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 16:30:50,860 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 16:30:50,861 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:30:50,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:30:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash 109985751, now seen corresponding path program 2 times [2022-04-27 16:30:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:30:50,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966143383] [2022-04-27 16:30:50,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:30:50,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:30:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:51,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:30:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:51,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {573#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {561#true} is VALID [2022-04-27 16:30:51,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {561#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {561#true} is VALID [2022-04-27 16:30:51,077 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {561#true} {561#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {561#true} is VALID [2022-04-27 16:30:51,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {561#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {573#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:30:51,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {573#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {561#true} is VALID [2022-04-27 16:30:51,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {561#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {561#true} is VALID [2022-04-27 16:30:51,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {561#true} {561#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {561#true} is VALID [2022-04-27 16:30:51,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {561#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {561#true} is VALID [2022-04-27 16:30:51,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {561#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {566#(= main_~x~0 0)} is VALID [2022-04-27 16:30:51,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {566#(= main_~x~0 0)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {566#(= main_~x~0 0)} is VALID [2022-04-27 16:30:51,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {566#(= main_~x~0 0)} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {567#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:30:51,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {567#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:30:51,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {568#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:30:51,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {568#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {568#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:30:51,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {568#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {569#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:30:51,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {569#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {569#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:30:51,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {569#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {570#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:30:51,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {570#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {570#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:30:51,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {570#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {571#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:30:51,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {571#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {571#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:30:51,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {571#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {572#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-27 16:30:51,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {572#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-27 16:30:51,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {562#false} is VALID [2022-04-27 16:30:51,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {562#false} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {562#false} is VALID [2022-04-27 16:30:51,085 INFO L272 TraceCheckUtils]: 21: Hoare triple {562#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {562#false} is VALID [2022-04-27 16:30:51,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {562#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {562#false} is VALID [2022-04-27 16:30:51,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {562#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {562#false} is VALID [2022-04-27 16:30:51,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {562#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {562#false} is VALID [2022-04-27 16:30:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:30:51,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:30:51,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966143383] [2022-04-27 16:30:51,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966143383] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:30:51,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154163452] [2022-04-27 16:30:51,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 16:30:51,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:30:51,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:30:51,086 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 16:30:51,101 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 16:30:51,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 16:30:51,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:30:51,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 16:30:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:51,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:30:51,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {561#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {561#true} is VALID [2022-04-27 16:30:51,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {561#true} [47] 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) 12) (= (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] {561#true} is VALID [2022-04-27 16:30:51,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {561#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {561#true} is VALID [2022-04-27 16:30:51,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {561#true} {561#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {561#true} is VALID [2022-04-27 16:30:51,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {561#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {561#true} is VALID [2022-04-27 16:30:51,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {561#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {566#(= main_~x~0 0)} is VALID [2022-04-27 16:30:51,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {566#(= main_~x~0 0)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {566#(= main_~x~0 0)} is VALID [2022-04-27 16:30:51,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {566#(= main_~x~0 0)} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {567#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:30:51,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {567#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:30:51,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {568#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:30:51,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {568#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {568#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:30:51,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {568#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {569#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:30:51,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {569#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {569#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:30:51,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {569#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {570#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:30:51,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {570#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {570#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:30:51,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {570#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {571#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:30:51,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {571#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {571#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:30:51,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {571#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {628#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:30:51,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {628#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {628#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:30:51,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {628#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {635#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:30:51,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {635#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {562#false} is VALID [2022-04-27 16:30:51,300 INFO L272 TraceCheckUtils]: 21: Hoare triple {562#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {562#false} is VALID [2022-04-27 16:30:51,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {562#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {562#false} is VALID [2022-04-27 16:30:51,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {562#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {562#false} is VALID [2022-04-27 16:30:51,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {562#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {562#false} is VALID [2022-04-27 16:30:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:30:51,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:30:51,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {562#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {562#false} is VALID [2022-04-27 16:30:51,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {654#(not (<= __VERIFIER_assert_~cond 0))} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {562#false} is VALID [2022-04-27 16:30:51,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {658#(< 0 |__VERIFIER_assert_#in~cond|)} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {654#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:30:51,696 INFO L272 TraceCheckUtils]: 21: Hoare triple {662#(= 100000000 (mod main_~x~0 4294967296))} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {658#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:30:51,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {666#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {662#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-27 16:30:51,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {670#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {666#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:30:51,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {670#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-27 16:30:51,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {677#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {670#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-27 16:30:51,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {677#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {677#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-27 16:30:51,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {684#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {677#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-27 16:30:51,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {684#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {684#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-27 16:30:51,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {691#(or (= 100000000 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {684#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-27 16:30:51,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {691#(or (= 100000000 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {691#(or (= 100000000 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-27 16:30:51,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {698#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {691#(or (= 100000000 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-27 16:30:51,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {698#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {698#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-27 16:30:51,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {705#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000000 (mod (+ 7 main_~x~0) 4294967296)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {698#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-27 16:30:51,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {705#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000000 (mod (+ 7 main_~x~0) 4294967296)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {705#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:30:51,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {705#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 16:30:51,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {712#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {712#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 16:30:51,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {561#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {712#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 16:30:51,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {561#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {561#true} is VALID [2022-04-27 16:30:51,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {561#true} {561#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {561#true} is VALID [2022-04-27 16:30:51,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {561#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {561#true} is VALID [2022-04-27 16:30:51,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {561#true} [47] 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) 12) (= (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] {561#true} is VALID [2022-04-27 16:30:51,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {561#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {561#true} is VALID [2022-04-27 16:30:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:30:51,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154163452] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:30:51,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:30:51,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 23 [2022-04-27 16:30:51,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641823075] [2022-04-27 16:30:51,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:30:51,709 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 16:30:51,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:30:51,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:51,749 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 16:30:51,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 16:30:51,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:30:51,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 16:30:51,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-04-27 16:30:51,750 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:53,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:53,624 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-27 16:30:53,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 16:30:53,624 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 16:30:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:30:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 49 transitions. [2022-04-27 16:30:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 49 transitions. [2022-04-27 16:30:53,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 49 transitions. [2022-04-27 16:30:53,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:30:53,689 INFO L225 Difference]: With dead ends: 39 [2022-04-27 16:30:53,689 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 16:30:53,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=311, Invalid=1095, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 16:30:53,690 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 16:30:53,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 76 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 16:30:53,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 16:30:53,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 16:30:53,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:30:53,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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 16:30:53,693 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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 16:30:53,693 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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 16:30:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:53,694 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 16:30:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 16:30:53,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:30:53,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:30:53,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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 36 states. [2022-04-27 16:30:53,695 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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 36 states. [2022-04-27 16:30:53,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:53,696 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 16:30:53,696 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 16:30:53,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:30:53,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:30:53,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:30:53,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:30:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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 16:30:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-27 16:30:53,697 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2022-04-27 16:30:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:30:53,697 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-27 16:30:53,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 16:30:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 16:30:53,698 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:30:53,698 INFO L195 NwaCegarLoop]: trace histogram [12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:30:53,717 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 16:30:53,913 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 16:30:53,914 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:30:53,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:30:53,914 INFO L85 PathProgramCache]: Analyzing trace with hash 134643049, now seen corresponding path program 3 times [2022-04-27 16:30:53,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:30:53,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108341474] [2022-04-27 16:30:53,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:30:53,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:30:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:54,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:30:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:54,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {913#true} is VALID [2022-04-27 16:30:54,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {913#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:54,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {913#true} {913#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:54,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {913#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:30:54,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {913#true} is VALID [2022-04-27 16:30:54,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {913#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:54,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {913#true} {913#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:54,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {913#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:54,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {913#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {918#(= main_~x~0 0)} is VALID [2022-04-27 16:30:54,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {918#(= main_~x~0 0)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {918#(= main_~x~0 0)} is VALID [2022-04-27 16:30:54,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {918#(= main_~x~0 0)} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {919#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:30:54,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {919#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {919#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:30:54,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {919#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {920#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:30:54,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {920#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {920#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:30:54,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {920#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {921#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:30:54,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {921#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {921#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:30:54,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {921#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {922#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:30:54,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {922#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {922#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:30:54,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {922#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {923#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:30:54,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {923#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {923#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:30:54,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {923#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {924#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:30:54,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {924#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {924#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:30:54,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {924#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {925#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 16:30:54,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {925#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {925#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 16:30:54,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {925#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {914#false} is VALID [2022-04-27 16:30:54,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {914#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {914#false} is VALID [2022-04-27 16:30:54,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {914#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {914#false} is VALID [2022-04-27 16:30:54,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {914#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {914#false} is VALID [2022-04-27 16:30:54,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {914#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {914#false} is VALID [2022-04-27 16:30:54,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {914#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {914#false} is VALID [2022-04-27 16:30:54,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {914#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {914#false} is VALID [2022-04-27 16:30:54,093 INFO L290 TraceCheckUtils]: 28: Hoare triple {914#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {914#false} is VALID [2022-04-27 16:30:54,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {914#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {914#false} is VALID [2022-04-27 16:30:54,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {914#false} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {914#false} is VALID [2022-04-27 16:30:54,094 INFO L272 TraceCheckUtils]: 31: Hoare triple {914#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {914#false} is VALID [2022-04-27 16:30:54,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {914#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {914#false} is VALID [2022-04-27 16:30:54,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {914#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {914#false} is VALID [2022-04-27 16:30:54,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {914#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#false} is VALID [2022-04-27 16:30:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 16:30:54,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:30:54,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108341474] [2022-04-27 16:30:54,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108341474] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:30:54,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820475465] [2022-04-27 16:30:54,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 16:30:54,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:30:54,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:30:54,104 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 16:30:54,105 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 16:30:54,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-04-27 16:30:54,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:30:54,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 16:30:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:54,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:30:54,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {913#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:54,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {913#true} [47] 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) 12) (= (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] {913#true} is VALID [2022-04-27 16:30:54,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {913#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:54,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {913#true} {913#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:54,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {913#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:54,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {913#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {913#true} is VALID [2022-04-27 16:30:54,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {913#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:54,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {913#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {913#true} is VALID [2022-04-27 16:30:54,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {913#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:54,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {913#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {913#true} is VALID [2022-04-27 16:30:54,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {913#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:54,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {913#true} is VALID [2022-04-27 16:30:54,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {913#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:54,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {913#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {913#true} is VALID [2022-04-27 16:30:54,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {913#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:54,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {913#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {913#true} is VALID [2022-04-27 16:30:54,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {913#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:54,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {913#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {913#true} is VALID [2022-04-27 16:30:54,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:54,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {913#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {987#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-27 16:30:54,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {987#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {987#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-27 16:30:54,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {987#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {994#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-27 16:30:54,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {994#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {994#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-27 16:30:54,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {994#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1001#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 16:30:54,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {1001#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1001#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 16:30:54,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {1001#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1008#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 10000000) (not (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000)))} is VALID [2022-04-27 16:30:54,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {1008#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 10000000) (not (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1008#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 10000000) (not (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000)))} is VALID [2022-04-27 16:30:54,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {1008#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 10000000) (not (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000)))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1015#(and (< (mod (+ main_~x~0 4294967287) 4294967296) 10000000) (not (< (mod (+ 4294967290 main_~x~0) 4294967296) 10000000)))} is VALID [2022-04-27 16:30:54,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {1015#(and (< (mod (+ main_~x~0 4294967287) 4294967296) 10000000) (not (< (mod (+ 4294967290 main_~x~0) 4294967296) 10000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1015#(and (< (mod (+ main_~x~0 4294967287) 4294967296) 10000000) (not (< (mod (+ 4294967290 main_~x~0) 4294967296) 10000000)))} is VALID [2022-04-27 16:30:54,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {1015#(and (< (mod (+ main_~x~0 4294967287) 4294967296) 10000000) (not (< (mod (+ 4294967290 main_~x~0) 4294967296) 10000000)))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1022#(and (< (mod (+ main_~x~0 4294967285) 4294967296) 10000000) (not (< (mod (+ 4294967288 main_~x~0) 4294967296) 10000000)))} is VALID [2022-04-27 16:30:54,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {1022#(and (< (mod (+ main_~x~0 4294967285) 4294967296) 10000000) (not (< (mod (+ 4294967288 main_~x~0) 4294967296) 10000000)))} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {914#false} is VALID [2022-04-27 16:30:54,606 INFO L272 TraceCheckUtils]: 31: Hoare triple {914#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {914#false} is VALID [2022-04-27 16:30:54,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {914#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {914#false} is VALID [2022-04-27 16:30:54,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {914#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {914#false} is VALID [2022-04-27 16:30:54,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {914#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#false} is VALID [2022-04-27 16:30:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-27 16:30:54,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:30:55,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {914#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {914#false} is VALID [2022-04-27 16:30:55,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {1041#(not (<= __VERIFIER_assert_~cond 0))} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {914#false} is VALID [2022-04-27 16:30:55,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {1045#(< 0 |__VERIFIER_assert_#in~cond|)} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1041#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:30:55,646 INFO L272 TraceCheckUtils]: 31: Hoare triple {1049#(= 100000000 (mod main_~x~0 4294967296))} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1045#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:30:55,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {1053#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1049#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-27 16:30:55,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {1057#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1053#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:30:55,648 INFO L290 TraceCheckUtils]: 28: Hoare triple {1057#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1057#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-27 16:30:55,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {1064#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1057#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-27 16:30:55,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {1064#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1064#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-27 16:30:55,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {1071#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1064#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-27 16:30:55,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {1071#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1071#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-27 16:30:55,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {1078#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1071#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-27 16:30:55,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {1082#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 8) 4294967296)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1078#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 16:30:55,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {1086#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 100000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1082#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 16:30:55,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {1086#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 100000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1086#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 100000000))} is VALID [2022-04-27 16:30:55,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {913#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1086#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 100000000))} is VALID [2022-04-27 16:30:55,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:55,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {913#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {913#true} is VALID [2022-04-27 16:30:55,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {913#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:55,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {913#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {913#true} is VALID [2022-04-27 16:30:55,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {913#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:55,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {913#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {913#true} is VALID [2022-04-27 16:30:55,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {913#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:55,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {913#true} is VALID [2022-04-27 16:30:55,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {913#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:55,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {913#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {913#true} is VALID [2022-04-27 16:30:55,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {913#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:55,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {913#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {913#true} is VALID [2022-04-27 16:30:55,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {913#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:55,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {913#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {913#true} is VALID [2022-04-27 16:30:55,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {913#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:55,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {913#true} {913#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:55,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {913#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:55,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {913#true} [47] 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) 12) (= (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] {913#true} is VALID [2022-04-27 16:30:55,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {913#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#true} is VALID [2022-04-27 16:30:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-27 16:30:55,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820475465] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:30:55,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:30:55,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 12] total 27 [2022-04-27 16:30:55,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104611027] [2022-04-27 16:30:55,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:30:55,658 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 16:30:55,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:30:55,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:55,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:30:55,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-27 16:30:55,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:30:55,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-27 16:30:55,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2022-04-27 16:30:55,716 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:31:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:31:00,299 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-04-27 16:31:00,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-27 16:31:00,300 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 16:31:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:31:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:31:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 78 transitions. [2022-04-27 16:31:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:31:00,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 78 transitions. [2022-04-27 16:31:00,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 78 transitions. [2022-04-27 16:31:00,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:31:00,484 INFO L225 Difference]: With dead ends: 57 [2022-04-27 16:31:00,485 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 16:31:00,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=563, Invalid=2089, Unknown=0, NotChecked=0, Total=2652 [2022-04-27 16:31:00,486 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 66 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 16:31:00,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 66 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 16:31:00,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 16:31:00,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-04-27 16:31:00,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:31:00,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 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 16:31:00,489 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 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 16:31:00,489 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 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 16:31:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:31:00,490 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-27 16:31:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-27 16:31:00,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:31:00,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:31:00,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 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 54 states. [2022-04-27 16:31:00,491 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 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 54 states. [2022-04-27 16:31:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:31:00,492 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-27 16:31:00,492 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-27 16:31:00,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:31:00,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:31:00,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:31:00,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:31:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 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 16:31:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-27 16:31:00,494 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 35 [2022-04-27 16:31:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:31:00,494 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-27 16:31:00,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:31:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 16:31:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 16:31:00,495 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:31:00,495 INFO L195 NwaCegarLoop]: trace histogram [20, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:31:00,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 16:31:00,698 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 16:31:00,698 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:31:00,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:31:00,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1228107086, now seen corresponding path program 4 times [2022-04-27 16:31:00,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:31:00,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340279639] [2022-04-27 16:31:00,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:31:00,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:31:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:31:00,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:31:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:31:00,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {1444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {1430#true} is VALID [2022-04-27 16:31:00,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1430#true} is VALID [2022-04-27 16:31:00,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1430#true} {1430#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1430#true} is VALID [2022-04-27 16:31:00,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {1430#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:31:00,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {1444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {1430#true} is VALID [2022-04-27 16:31:00,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {1430#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1430#true} is VALID [2022-04-27 16:31:00,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1430#true} {1430#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1430#true} is VALID [2022-04-27 16:31:00,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {1430#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1430#true} is VALID [2022-04-27 16:31:00,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {1430#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1435#(= main_~x~0 0)} is VALID [2022-04-27 16:31:00,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {1435#(= main_~x~0 0)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1435#(= main_~x~0 0)} is VALID [2022-04-27 16:31:00,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {1435#(= main_~x~0 0)} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1436#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:31:00,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {1436#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1436#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:31:00,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {1436#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1437#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:31:00,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {1437#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1437#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:31:00,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {1437#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1438#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:31:00,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {1438#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1438#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:31:00,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {1438#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1439#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:31:00,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {1439#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1439#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:31:00,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {1439#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1440#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:31:00,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {1440#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1440#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:31:00,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1441#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:31:00,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {1441#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1441#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:31:00,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {1441#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1442#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:31:00,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {1442#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1442#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:31:00,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {1442#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1443#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 16:31:00,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {1443#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1443#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 16:31:00,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {1443#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:00,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:00,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:00,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:00,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:00,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:00,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:00,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:00,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:00,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:00,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:00,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:00,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:00,890 INFO L290 TraceCheckUtils]: 36: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:00,890 INFO L290 TraceCheckUtils]: 37: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:00,890 INFO L290 TraceCheckUtils]: 38: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:00,890 INFO L290 TraceCheckUtils]: 39: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:00,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:00,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:00,891 INFO L290 TraceCheckUtils]: 42: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:00,891 INFO L290 TraceCheckUtils]: 43: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:00,891 INFO L290 TraceCheckUtils]: 44: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:00,891 INFO L290 TraceCheckUtils]: 45: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:00,891 INFO L290 TraceCheckUtils]: 46: Hoare triple {1431#false} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:00,891 INFO L272 TraceCheckUtils]: 47: Hoare triple {1431#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1431#false} is VALID [2022-04-27 16:31:00,891 INFO L290 TraceCheckUtils]: 48: Hoare triple {1431#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1431#false} is VALID [2022-04-27 16:31:00,891 INFO L290 TraceCheckUtils]: 49: Hoare triple {1431#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:00,891 INFO L290 TraceCheckUtils]: 50: Hoare triple {1431#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-27 16:31:00,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:31:00,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340279639] [2022-04-27 16:31:00,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340279639] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:31:00,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189862865] [2022-04-27 16:31:00,892 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 16:31:00,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:31:00,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:31:00,912 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 16:31:00,913 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 16:31:00,960 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 16:31:00,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:31:00,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-27 16:31:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:31:00,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:31:01,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {1430#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1430#true} is VALID [2022-04-27 16:31:01,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#true} [47] 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) 12) (= (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] {1430#true} is VALID [2022-04-27 16:31:01,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {1430#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1430#true} is VALID [2022-04-27 16:31:01,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1430#true} {1430#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1430#true} is VALID [2022-04-27 16:31:01,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {1430#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1430#true} is VALID [2022-04-27 16:31:01,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {1430#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1435#(= main_~x~0 0)} is VALID [2022-04-27 16:31:01,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {1435#(= main_~x~0 0)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1435#(= main_~x~0 0)} is VALID [2022-04-27 16:31:01,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {1435#(= main_~x~0 0)} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1436#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:31:01,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {1436#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1436#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:31:01,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {1436#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1437#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:31:01,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {1437#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1437#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:31:01,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {1437#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1438#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:31:01,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {1438#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1438#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:31:01,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {1438#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1439#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:31:01,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {1439#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1439#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:31:01,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {1439#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1440#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:31:01,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {1440#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1440#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:31:01,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1441#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:31:01,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {1441#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1441#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:31:01,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {1441#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1442#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:31:01,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {1442#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1442#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:31:01,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {1442#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1511#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:31:01,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {1511#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1511#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:31:01,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {1511#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1518#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:31:01,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {1518#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1518#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:31:01,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {1518#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1525#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:31:01,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {1525#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1525#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:31:01,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {1525#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1532#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:31:01,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {1532#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1532#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:31:01,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {1532#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1539#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:31:01,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {1539#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1539#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:31:01,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {1539#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1546#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 16:31:01,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {1546#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1546#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 16:31:01,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {1546#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1553#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 16:31:01,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {1553#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1553#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 16:31:01,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {1553#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1560#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 16:31:01,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {1560#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1560#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 16:31:01,475 INFO L290 TraceCheckUtils]: 37: Hoare triple {1560#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:01,475 INFO L290 TraceCheckUtils]: 38: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:01,475 INFO L290 TraceCheckUtils]: 39: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:01,475 INFO L290 TraceCheckUtils]: 40: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:01,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:01,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:01,475 INFO L290 TraceCheckUtils]: 43: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:01,475 INFO L290 TraceCheckUtils]: 44: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:01,475 INFO L290 TraceCheckUtils]: 45: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:01,475 INFO L290 TraceCheckUtils]: 46: Hoare triple {1431#false} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:01,475 INFO L272 TraceCheckUtils]: 47: Hoare triple {1431#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1431#false} is VALID [2022-04-27 16:31:01,475 INFO L290 TraceCheckUtils]: 48: Hoare triple {1431#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1431#false} is VALID [2022-04-27 16:31:01,475 INFO L290 TraceCheckUtils]: 49: Hoare triple {1431#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:01,475 INFO L290 TraceCheckUtils]: 50: Hoare triple {1431#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 16:31:01,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:31:02,327 INFO L290 TraceCheckUtils]: 50: Hoare triple {1431#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:02,327 INFO L290 TraceCheckUtils]: 49: Hoare triple {1431#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:02,327 INFO L290 TraceCheckUtils]: 48: Hoare triple {1431#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1431#false} is VALID [2022-04-27 16:31:02,327 INFO L272 TraceCheckUtils]: 47: Hoare triple {1431#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1431#false} is VALID [2022-04-27 16:31:02,328 INFO L290 TraceCheckUtils]: 46: Hoare triple {1431#false} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:02,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:02,328 INFO L290 TraceCheckUtils]: 44: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:02,328 INFO L290 TraceCheckUtils]: 43: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:02,328 INFO L290 TraceCheckUtils]: 42: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:02,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:02,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:02,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {1431#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:02,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {1431#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1431#false} is VALID [2022-04-27 16:31:02,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {1645#(< (mod main_~x~0 4294967296) 10000000)} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1431#false} is VALID [2022-04-27 16:31:02,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {1649#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1645#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-27 16:31:02,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {1653#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1649#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {1653#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1653#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {1660#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1653#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {1660#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1660#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {1667#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1660#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {1667#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1667#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-27 16:31:02,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {1674#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1667#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-27 16:31:02,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {1674#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1674#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-27 16:31:02,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {1681#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1674#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-27 16:31:02,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {1681#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1681#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {1688#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1681#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {1688#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1688#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-27 16:31:02,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {1695#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1688#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-27 16:31:02,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {1695#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1695#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {1702#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1695#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {1702#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1702#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {1709#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1702#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {1709#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1709#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {1716#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1709#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {1716#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1716#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {1723#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1716#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {1723#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1723#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {1730#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1723#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {1730#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1730#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {1737#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1730#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {1737#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1737#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {1744#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1737#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {1744#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1744#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {1751#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1744#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {1751#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1751#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {1430#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1751#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:02,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {1430#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1430#true} is VALID [2022-04-27 16:31:02,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1430#true} {1430#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1430#true} is VALID [2022-04-27 16:31:02,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {1430#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1430#true} is VALID [2022-04-27 16:31:02,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#true} [47] 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) 12) (= (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] {1430#true} is VALID [2022-04-27 16:31:02,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {1430#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1430#true} is VALID [2022-04-27 16:31:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 16:31:02,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189862865] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:31:02,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:31:02,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 19] total 37 [2022-04-27 16:31:02,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149580549] [2022-04-27 16:31:02,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:31:02,348 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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 51 [2022-04-27 16:31:02,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:31:02,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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 16:31:02,405 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 16:31:02,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-27 16:31:02,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:31:02,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-27 16:31:02,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=962, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 16:31:02,407 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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 16:31:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:31:27,584 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-04-27 16:31:27,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 16:31:27,585 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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 51 [2022-04-27 16:31:27,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:31:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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 16:31:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 81 transitions. [2022-04-27 16:31:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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 16:31:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 81 transitions. [2022-04-27 16:31:27,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 81 transitions. [2022-04-27 16:31:27,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:31:27,770 INFO L225 Difference]: With dead ends: 86 [2022-04-27 16:31:27,770 INFO L226 Difference]: Without dead ends: 86 [2022-04-27 16:31:27,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=1061, Invalid=2845, Unknown=0, NotChecked=0, Total=3906 [2022-04-27 16:31:27,771 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 16:31:27,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 94 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 16:31:27,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-27 16:31:27,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-27 16:31:27,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:31:27,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 81 states have internal predecessors, (89), 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 16:31:27,775 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 81 states have internal predecessors, (89), 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 16:31:27,775 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 81 states have internal predecessors, (89), 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 16:31:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:31:27,777 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-04-27 16:31:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-04-27 16:31:27,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:31:27,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:31:27,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 81 states have internal predecessors, (89), 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 86 states. [2022-04-27 16:31:27,778 INFO L87 Difference]: Start difference. First operand has 86 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 81 states have internal predecessors, (89), 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 86 states. [2022-04-27 16:31:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:31:27,779 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-04-27 16:31:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-04-27 16:31:27,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:31:27,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:31:27,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:31:27,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:31:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 81 states have internal predecessors, (89), 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 16:31:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-04-27 16:31:27,782 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 51 [2022-04-27 16:31:27,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:31:27,782 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-04-27 16:31:27,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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 16:31:27,782 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-04-27 16:31:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-27 16:31:27,782 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:31:27,782 INFO L195 NwaCegarLoop]: trace histogram [37, 25, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:31:27,799 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 16:31:27,996 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 16:31:27,996 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:31:27,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:31:27,997 INFO L85 PathProgramCache]: Analyzing trace with hash 525547056, now seen corresponding path program 5 times [2022-04-27 16:31:27,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:31:27,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041615001] [2022-04-27 16:31:27,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:31:27,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:31:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:31:28,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:31:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:31:28,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {2202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {2171#true} is VALID [2022-04-27 16:31:28,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {2171#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2171#true} is VALID [2022-04-27 16:31:28,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2171#true} {2171#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2171#true} is VALID [2022-04-27 16:31:28,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {2171#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:31:28,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {2202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {2171#true} is VALID [2022-04-27 16:31:28,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {2171#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2171#true} is VALID [2022-04-27 16:31:28,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2171#true} {2171#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2171#true} is VALID [2022-04-27 16:31:28,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {2171#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2171#true} is VALID [2022-04-27 16:31:28,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {2171#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {2176#(= main_~x~0 0)} is VALID [2022-04-27 16:31:28,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {2176#(= main_~x~0 0)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2176#(= main_~x~0 0)} is VALID [2022-04-27 16:31:28,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {2176#(= main_~x~0 0)} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2177#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:31:28,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {2177#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2177#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:31:28,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {2177#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2178#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:31:28,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {2178#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2178#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:31:28,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {2178#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2179#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:31:28,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {2179#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2179#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:31:28,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {2179#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2180#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:31:28,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {2180#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2180#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:31:28,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {2180#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2181#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:31:28,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {2181#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2181#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:31:28,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {2181#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2182#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:31:28,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {2182#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2182#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:31:28,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {2182#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2183#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:31:28,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {2183#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2183#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:31:28,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {2183#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2184#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:31:28,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {2184#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2184#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:31:28,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {2184#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2185#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:31:28,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {2185#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2185#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:31:28,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {2185#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2186#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:31:28,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {2186#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2186#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:31:28,643 INFO L290 TraceCheckUtils]: 27: Hoare triple {2186#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2187#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:31:28,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {2187#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2187#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:31:28,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {2187#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2188#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:31:28,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {2188#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2188#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:31:28,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {2188#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2189#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:31:28,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {2189#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2189#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:31:28,646 INFO L290 TraceCheckUtils]: 33: Hoare triple {2189#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2190#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:31:28,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {2190#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2190#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:31:28,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {2190#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2191#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:31:28,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {2191#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2191#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:31:28,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {2191#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2192#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:31:28,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {2192#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2192#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:31:28,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {2192#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2193#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 16:31:28,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {2193#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2193#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 16:31:28,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {2193#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2194#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 16:31:28,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {2194#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2194#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 16:31:28,650 INFO L290 TraceCheckUtils]: 43: Hoare triple {2194#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2195#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 16:31:28,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {2195#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2195#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 16:31:28,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {2195#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2196#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 16:31:28,651 INFO L290 TraceCheckUtils]: 46: Hoare triple {2196#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2196#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 16:31:28,651 INFO L290 TraceCheckUtils]: 47: Hoare triple {2196#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2197#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 16:31:28,652 INFO L290 TraceCheckUtils]: 48: Hoare triple {2197#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2197#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 16:31:28,652 INFO L290 TraceCheckUtils]: 49: Hoare triple {2197#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2198#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 16:31:28,653 INFO L290 TraceCheckUtils]: 50: Hoare triple {2198#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2198#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 16:31:28,653 INFO L290 TraceCheckUtils]: 51: Hoare triple {2198#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2199#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 16:31:28,653 INFO L290 TraceCheckUtils]: 52: Hoare triple {2199#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2199#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 16:31:28,654 INFO L290 TraceCheckUtils]: 53: Hoare triple {2199#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2200#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 16:31:28,654 INFO L290 TraceCheckUtils]: 54: Hoare triple {2200#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2200#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 16:31:28,655 INFO L290 TraceCheckUtils]: 55: Hoare triple {2200#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2201#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} is VALID [2022-04-27 16:31:28,655 INFO L290 TraceCheckUtils]: 56: Hoare triple {2201#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2201#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 57: Hoare triple {2201#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 58: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 59: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 60: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 61: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 62: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 63: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 64: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 65: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 66: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 67: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 68: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 69: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 70: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 71: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 72: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 73: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:28,656 INFO L290 TraceCheckUtils]: 74: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:28,657 INFO L290 TraceCheckUtils]: 75: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:28,657 INFO L290 TraceCheckUtils]: 76: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:28,657 INFO L290 TraceCheckUtils]: 77: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:28,657 INFO L290 TraceCheckUtils]: 78: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:28,657 INFO L290 TraceCheckUtils]: 79: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:28,657 INFO L290 TraceCheckUtils]: 80: Hoare triple {2172#false} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:28,657 INFO L272 TraceCheckUtils]: 81: Hoare triple {2172#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {2172#false} is VALID [2022-04-27 16:31:28,657 INFO L290 TraceCheckUtils]: 82: Hoare triple {2172#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2172#false} is VALID [2022-04-27 16:31:28,657 INFO L290 TraceCheckUtils]: 83: Hoare triple {2172#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:28,657 INFO L290 TraceCheckUtils]: 84: Hoare triple {2172#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 598 proven. 650 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-27 16:31:28,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:31:28,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041615001] [2022-04-27 16:31:28,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041615001] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:31:28,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459084539] [2022-04-27 16:31:28,658 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 16:31:28,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:31:28,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:31:28,672 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 16:31:28,673 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 16:31:37,072 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2022-04-27 16:31:37,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:31:37,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-27 16:31:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:31:37,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:31:37,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {2171#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2171#true} is VALID [2022-04-27 16:31:37,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {2171#true} [47] 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) 12) (= (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] {2171#true} is VALID [2022-04-27 16:31:37,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {2171#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2171#true} is VALID [2022-04-27 16:31:37,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2171#true} {2171#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2171#true} is VALID [2022-04-27 16:31:37,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {2171#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2171#true} is VALID [2022-04-27 16:31:37,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {2171#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {2176#(= main_~x~0 0)} is VALID [2022-04-27 16:31:37,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {2176#(= main_~x~0 0)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2176#(= main_~x~0 0)} is VALID [2022-04-27 16:31:37,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {2176#(= main_~x~0 0)} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2177#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:31:37,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {2177#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2177#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:31:37,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {2177#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2178#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:31:37,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {2178#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2178#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:31:37,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {2178#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2179#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:31:37,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {2179#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2179#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:31:37,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {2179#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2180#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:31:37,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {2180#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2180#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:31:37,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {2180#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2181#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:31:37,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {2181#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2181#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:31:37,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {2181#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2182#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:31:37,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {2182#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2182#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:31:37,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {2182#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2183#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:31:37,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {2183#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2183#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:31:37,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {2183#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2184#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:31:37,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {2184#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2184#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:31:37,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {2184#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2185#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:31:37,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {2185#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2185#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:31:37,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {2185#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2186#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:31:37,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {2186#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2186#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:31:37,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {2186#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2187#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:31:37,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {2187#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2187#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:31:37,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {2187#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2188#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:31:37,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {2188#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2188#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:31:37,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {2188#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2189#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:31:37,907 INFO L290 TraceCheckUtils]: 32: Hoare triple {2189#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2189#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:31:37,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {2189#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2190#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:31:37,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {2190#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2190#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:31:37,908 INFO L290 TraceCheckUtils]: 35: Hoare triple {2190#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2191#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:31:37,909 INFO L290 TraceCheckUtils]: 36: Hoare triple {2191#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2191#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:31:37,909 INFO L290 TraceCheckUtils]: 37: Hoare triple {2191#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2192#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:31:37,909 INFO L290 TraceCheckUtils]: 38: Hoare triple {2192#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2192#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:31:37,910 INFO L290 TraceCheckUtils]: 39: Hoare triple {2192#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2193#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 16:31:37,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {2193#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2193#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 16:31:37,911 INFO L290 TraceCheckUtils]: 41: Hoare triple {2193#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2194#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 16:31:37,911 INFO L290 TraceCheckUtils]: 42: Hoare triple {2194#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2194#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 16:31:37,912 INFO L290 TraceCheckUtils]: 43: Hoare triple {2194#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2195#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 16:31:37,912 INFO L290 TraceCheckUtils]: 44: Hoare triple {2195#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2195#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 16:31:37,912 INFO L290 TraceCheckUtils]: 45: Hoare triple {2195#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2196#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 16:31:37,913 INFO L290 TraceCheckUtils]: 46: Hoare triple {2196#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2196#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 16:31:37,913 INFO L290 TraceCheckUtils]: 47: Hoare triple {2196#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2197#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 16:31:37,914 INFO L290 TraceCheckUtils]: 48: Hoare triple {2197#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2197#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 16:31:37,914 INFO L290 TraceCheckUtils]: 49: Hoare triple {2197#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2198#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 16:31:37,914 INFO L290 TraceCheckUtils]: 50: Hoare triple {2198#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2198#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 16:31:37,915 INFO L290 TraceCheckUtils]: 51: Hoare triple {2198#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2199#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 16:31:37,915 INFO L290 TraceCheckUtils]: 52: Hoare triple {2199#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2199#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 16:31:37,916 INFO L290 TraceCheckUtils]: 53: Hoare triple {2199#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2200#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 16:31:37,916 INFO L290 TraceCheckUtils]: 54: Hoare triple {2200#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2200#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 16:31:37,917 INFO L290 TraceCheckUtils]: 55: Hoare triple {2200#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2371#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 16:31:37,917 INFO L290 TraceCheckUtils]: 56: Hoare triple {2371#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2371#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 16:31:37,917 INFO L290 TraceCheckUtils]: 57: Hoare triple {2371#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2378#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 16:31:37,918 INFO L290 TraceCheckUtils]: 58: Hoare triple {2378#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2378#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 16:31:37,918 INFO L290 TraceCheckUtils]: 59: Hoare triple {2378#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2385#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 16:31:37,918 INFO L290 TraceCheckUtils]: 60: Hoare triple {2385#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2385#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 16:31:37,919 INFO L290 TraceCheckUtils]: 61: Hoare triple {2385#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2392#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 16:31:37,919 INFO L290 TraceCheckUtils]: 62: Hoare triple {2392#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2392#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 16:31:37,920 INFO L290 TraceCheckUtils]: 63: Hoare triple {2392#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2399#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 16:31:37,920 INFO L290 TraceCheckUtils]: 64: Hoare triple {2399#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2399#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 16:31:37,921 INFO L290 TraceCheckUtils]: 65: Hoare triple {2399#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2406#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 16:31:37,921 INFO L290 TraceCheckUtils]: 66: Hoare triple {2406#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2406#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 16:31:37,921 INFO L290 TraceCheckUtils]: 67: Hoare triple {2406#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2413#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 16:31:37,922 INFO L290 TraceCheckUtils]: 68: Hoare triple {2413#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2413#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 16:31:37,922 INFO L290 TraceCheckUtils]: 69: Hoare triple {2413#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:37,922 INFO L290 TraceCheckUtils]: 70: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:37,923 INFO L290 TraceCheckUtils]: 71: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:37,923 INFO L290 TraceCheckUtils]: 72: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:37,923 INFO L290 TraceCheckUtils]: 73: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:37,923 INFO L290 TraceCheckUtils]: 74: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:37,923 INFO L290 TraceCheckUtils]: 75: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:37,923 INFO L290 TraceCheckUtils]: 76: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:37,923 INFO L290 TraceCheckUtils]: 77: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:37,923 INFO L290 TraceCheckUtils]: 78: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:37,923 INFO L290 TraceCheckUtils]: 79: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:37,923 INFO L290 TraceCheckUtils]: 80: Hoare triple {2172#false} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:37,923 INFO L272 TraceCheckUtils]: 81: Hoare triple {2172#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {2172#false} is VALID [2022-04-27 16:31:37,923 INFO L290 TraceCheckUtils]: 82: Hoare triple {2172#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2172#false} is VALID [2022-04-27 16:31:37,923 INFO L290 TraceCheckUtils]: 83: Hoare triple {2172#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:37,923 INFO L290 TraceCheckUtils]: 84: Hoare triple {2172#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 352 proven. 992 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-27 16:31:37,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:31:40,486 INFO L290 TraceCheckUtils]: 84: Hoare triple {2172#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:40,486 INFO L290 TraceCheckUtils]: 83: Hoare triple {2172#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:40,486 INFO L290 TraceCheckUtils]: 82: Hoare triple {2172#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2172#false} is VALID [2022-04-27 16:31:40,487 INFO L272 TraceCheckUtils]: 81: Hoare triple {2172#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {2172#false} is VALID [2022-04-27 16:31:40,487 INFO L290 TraceCheckUtils]: 80: Hoare triple {2172#false} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:40,487 INFO L290 TraceCheckUtils]: 79: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:40,487 INFO L290 TraceCheckUtils]: 78: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:40,487 INFO L290 TraceCheckUtils]: 77: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:40,487 INFO L290 TraceCheckUtils]: 76: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:40,487 INFO L290 TraceCheckUtils]: 75: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:40,487 INFO L290 TraceCheckUtils]: 74: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:40,487 INFO L290 TraceCheckUtils]: 73: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:40,487 INFO L290 TraceCheckUtils]: 72: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:40,487 INFO L290 TraceCheckUtils]: 71: Hoare triple {2172#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:40,487 INFO L290 TraceCheckUtils]: 70: Hoare triple {2172#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2172#false} is VALID [2022-04-27 16:31:40,487 INFO L290 TraceCheckUtils]: 69: Hoare triple {2510#(< (mod main_~x~0 4294967296) 10000000)} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2172#false} is VALID [2022-04-27 16:31:40,488 INFO L290 TraceCheckUtils]: 68: Hoare triple {2514#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2510#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-27 16:31:40,490 INFO L290 TraceCheckUtils]: 67: Hoare triple {2518#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2514#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,490 INFO L290 TraceCheckUtils]: 66: Hoare triple {2518#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2518#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,491 INFO L290 TraceCheckUtils]: 65: Hoare triple {2525#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2518#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,491 INFO L290 TraceCheckUtils]: 64: Hoare triple {2525#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2525#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,492 INFO L290 TraceCheckUtils]: 63: Hoare triple {2532#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2525#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,492 INFO L290 TraceCheckUtils]: 62: Hoare triple {2532#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2532#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-27 16:31:40,493 INFO L290 TraceCheckUtils]: 61: Hoare triple {2539#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2532#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-27 16:31:40,493 INFO L290 TraceCheckUtils]: 60: Hoare triple {2539#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2539#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-27 16:31:40,494 INFO L290 TraceCheckUtils]: 59: Hoare triple {2546#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2539#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-27 16:31:40,494 INFO L290 TraceCheckUtils]: 58: Hoare triple {2546#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2546#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {2553#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2546#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,496 INFO L290 TraceCheckUtils]: 56: Hoare triple {2553#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2553#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-27 16:31:40,496 INFO L290 TraceCheckUtils]: 55: Hoare triple {2560#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2553#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-27 16:31:40,497 INFO L290 TraceCheckUtils]: 54: Hoare triple {2560#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2560#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,497 INFO L290 TraceCheckUtils]: 53: Hoare triple {2567#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2560#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,498 INFO L290 TraceCheckUtils]: 52: Hoare triple {2567#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2567#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,498 INFO L290 TraceCheckUtils]: 51: Hoare triple {2574#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2567#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,499 INFO L290 TraceCheckUtils]: 50: Hoare triple {2574#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2574#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,499 INFO L290 TraceCheckUtils]: 49: Hoare triple {2581#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2574#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {2581#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2581#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {2588#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2581#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,501 INFO L290 TraceCheckUtils]: 46: Hoare triple {2588#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2588#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {2595#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2588#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,504 INFO L290 TraceCheckUtils]: 44: Hoare triple {2595#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2595#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,504 INFO L290 TraceCheckUtils]: 43: Hoare triple {2602#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2595#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {2602#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2602#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {2609#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2602#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {2609#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2609#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {2616#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2609#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {2616#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2616#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {2623#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2616#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {2623#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2623#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {2630#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2623#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,509 INFO L290 TraceCheckUtils]: 34: Hoare triple {2630#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2630#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {2637#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2630#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {2637#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2637#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {2644#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2637#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {2644#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2644#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-27 16:31:40,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {2651#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2644#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-27 16:31:40,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {2651#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2651#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {2658#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2651#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {2658#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2658#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {2665#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2658#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {2665#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2665#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-27 16:31:40,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {2672#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2665#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-27 16:31:40,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {2672#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2672#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {2679#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2672#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {2679#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2679#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {2686#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2679#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {2686#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2686#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {2693#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2686#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {2693#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2693#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {2700#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2693#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {2700#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2700#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {2707#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2700#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {2707#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2707#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} is VALID [2022-04-27 16:31:40,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {2714#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 100000000)) (< (mod (+ 35 main_~x~0) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2707#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} is VALID [2022-04-27 16:31:40,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {2714#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 100000000)) (< (mod (+ 35 main_~x~0) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2714#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 100000000)) (< (mod (+ 35 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 16:31:40,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {2721#(or (not (< (mod (+ main_~x~0 36) 4294967296) 100000000)) (< (mod (+ main_~x~0 36) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2714#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 100000000)) (< (mod (+ 35 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 16:31:40,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {2721#(or (not (< (mod (+ main_~x~0 36) 4294967296) 100000000)) (< (mod (+ main_~x~0 36) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2721#(or (not (< (mod (+ main_~x~0 36) 4294967296) 100000000)) (< (mod (+ main_~x~0 36) 4294967296) 10000000))} is VALID [2022-04-27 16:31:40,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {2728#(or (< (mod (+ main_~x~0 37) 4294967296) 10000000) (not (< (mod (+ main_~x~0 37) 4294967296) 100000000)))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2721#(or (not (< (mod (+ main_~x~0 36) 4294967296) 100000000)) (< (mod (+ main_~x~0 36) 4294967296) 10000000))} is VALID [2022-04-27 16:31:40,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {2728#(or (< (mod (+ main_~x~0 37) 4294967296) 10000000) (not (< (mod (+ main_~x~0 37) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2728#(or (< (mod (+ main_~x~0 37) 4294967296) 10000000) (not (< (mod (+ main_~x~0 37) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {2171#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {2728#(or (< (mod (+ main_~x~0 37) 4294967296) 10000000) (not (< (mod (+ main_~x~0 37) 4294967296) 100000000)))} is VALID [2022-04-27 16:31:40,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {2171#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2171#true} is VALID [2022-04-27 16:31:40,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2171#true} {2171#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2171#true} is VALID [2022-04-27 16:31:40,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {2171#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2171#true} is VALID [2022-04-27 16:31:40,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {2171#true} [47] 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) 12) (= (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] {2171#true} is VALID [2022-04-27 16:31:40,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {2171#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2171#true} is VALID [2022-04-27 16:31:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 352 proven. 992 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-27 16:31:40,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459084539] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:31:40,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:31:40,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 34, 35] total 69 [2022-04-27 16:31:40,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928373966] [2022-04-27 16:31:40,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:31:40,525 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 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 85 [2022-04-27 16:31:40,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:31:40,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 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 16:31:40,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:31:40,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-27 16:31:40,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:31:40,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-27 16:31:40,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1251, Invalid=3441, Unknown=0, NotChecked=0, Total=4692 [2022-04-27 16:31:40,643 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 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 16:32:17,430 WARN L232 SmtUtils]: Spent 13.31s on a formula simplification. DAG size of input: 230 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 16:32:48,786 WARN L232 SmtUtils]: Spent 10.06s on a formula simplification. DAG size of input: 223 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 16:33:24,845 WARN L232 SmtUtils]: Spent 7.18s on a formula simplification. DAG size of input: 216 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 16:33:58,409 WARN L232 SmtUtils]: Spent 8.57s on a formula simplification. DAG size of input: 209 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 16:34:28,002 WARN L232 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 202 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 16:35:02,104 WARN L232 SmtUtils]: Spent 6.92s on a formula simplification. DAG size of input: 195 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 16:35:36,771 WARN L232 SmtUtils]: Spent 5.20s on a formula simplification. DAG size of input: 188 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 16:36:42,436 WARN L232 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 174 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 16:37:15,294 WARN L232 SmtUtils]: Spent 9.38s on a formula simplification. DAG size of input: 167 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 16:41:59,898 WARN L232 SmtUtils]: Spent 49.92s on a formula simplification. DAG size of input: 233 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 16:42:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:42:00,094 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2022-04-27 16:42:00,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-27 16:42:00,095 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 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 85 [2022-04-27 16:42:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:42:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 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 16:42:00,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 163 transitions. [2022-04-27 16:42:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 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 16:42:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 163 transitions. [2022-04-27 16:42:00,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 163 transitions. [2022-04-27 16:42:00,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:42:00,372 INFO L225 Difference]: With dead ends: 152 [2022-04-27 16:42:00,372 INFO L226 Difference]: Without dead ends: 152 [2022-04-27 16:42:00,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1911 ImplicationChecksByTransitivity, 617.2s TimeCoverageRelationStatistics Valid=4278, Invalid=11963, Unknown=15, NotChecked=0, Total=16256 [2022-04-27 16:42:00,376 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 124 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 2476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:42:00,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 174 Invalid, 2476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 1950 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 16:42:00,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-27 16:42:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-04-27 16:42:00,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:42:00,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 152 states, 147 states have (on average 1.054421768707483) internal successors, (155), 147 states have internal predecessors, (155), 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 16:42:00,381 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 152 states, 147 states have (on average 1.054421768707483) internal successors, (155), 147 states have internal predecessors, (155), 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 16:42:00,381 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 152 states, 147 states have (on average 1.054421768707483) internal successors, (155), 147 states have internal predecessors, (155), 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 16:42:00,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:42:00,384 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2022-04-27 16:42:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2022-04-27 16:42:00,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:42:00,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:42:00,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.054421768707483) internal successors, (155), 147 states have internal predecessors, (155), 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 152 states. [2022-04-27 16:42:00,385 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.054421768707483) internal successors, (155), 147 states have internal predecessors, (155), 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 152 states. [2022-04-27 16:42:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:42:00,388 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2022-04-27 16:42:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2022-04-27 16:42:00,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:42:00,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:42:00,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:42:00,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:42:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.054421768707483) internal successors, (155), 147 states have internal predecessors, (155), 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 16:42:00,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 159 transitions. [2022-04-27 16:42:00,392 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 159 transitions. Word has length 85 [2022-04-27 16:42:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:42:00,392 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 159 transitions. [2022-04-27 16:42:00,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 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 16:42:00,392 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2022-04-27 16:42:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-27 16:42:00,393 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:42:00,393 INFO L195 NwaCegarLoop]: trace histogram [70, 58, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:42:00,399 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 16:42:00,598 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 16:42:00,599 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:42:00,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:42:00,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1736138738, now seen corresponding path program 6 times [2022-04-27 16:42:00,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:42:00,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191864608] [2022-04-27 16:42:00,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:42:00,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:42:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:42:02,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:42:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:42:02,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {3542#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {3478#true} is VALID [2022-04-27 16:42:02,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {3478#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:02,443 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3478#true} {3478#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:02,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {3478#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3542#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:42:02,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {3542#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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) 12) (= (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] {3478#true} is VALID [2022-04-27 16:42:02,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {3478#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:02,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3478#true} {3478#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:02,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {3478#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:02,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {3478#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {3483#(= main_~x~0 0)} is VALID [2022-04-27 16:42:02,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {3483#(= main_~x~0 0)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3483#(= main_~x~0 0)} is VALID [2022-04-27 16:42:02,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {3483#(= main_~x~0 0)} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3484#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:42:02,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {3484#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3484#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 16:42:02,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {3484#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3485#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:42:02,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {3485#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3485#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 16:42:02,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {3485#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3486#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:42:02,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {3486#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3486#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 16:42:02,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {3486#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3487#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:42:02,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {3487#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3487#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 16:42:02,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {3487#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3488#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:42:02,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {3488#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3488#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 16:42:02,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {3488#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3489#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:42:02,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {3489#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3489#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 16:42:02,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {3489#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3490#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:42:02,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {3490#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3490#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 16:42:02,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {3490#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3491#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:42:02,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {3491#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3491#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 16:42:02,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {3491#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3492#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:42:02,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {3492#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3492#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 16:42:02,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {3492#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3493#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:42:02,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {3493#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3493#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 16:42:02,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {3493#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3494#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:42:02,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {3494#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3494#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 16:42:02,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {3494#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3495#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:42:02,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {3495#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3495#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 16:42:02,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {3495#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3496#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:42:02,456 INFO L290 TraceCheckUtils]: 32: Hoare triple {3496#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3496#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 16:42:02,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {3496#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3497#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:42:02,456 INFO L290 TraceCheckUtils]: 34: Hoare triple {3497#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3497#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 16:42:02,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {3497#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3498#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:42:02,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {3498#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3498#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 16:42:02,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {3498#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3499#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:42:02,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {3499#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3499#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 16:42:02,459 INFO L290 TraceCheckUtils]: 39: Hoare triple {3499#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3500#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 16:42:02,459 INFO L290 TraceCheckUtils]: 40: Hoare triple {3500#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3500#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 16:42:02,459 INFO L290 TraceCheckUtils]: 41: Hoare triple {3500#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3501#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 16:42:02,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {3501#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3501#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 16:42:02,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {3501#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3502#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 16:42:02,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {3502#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3502#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 16:42:02,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {3502#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3503#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 16:42:02,461 INFO L290 TraceCheckUtils]: 46: Hoare triple {3503#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3503#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 16:42:02,462 INFO L290 TraceCheckUtils]: 47: Hoare triple {3503#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3504#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 16:42:02,462 INFO L290 TraceCheckUtils]: 48: Hoare triple {3504#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3504#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 16:42:02,463 INFO L290 TraceCheckUtils]: 49: Hoare triple {3504#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3505#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 16:42:02,463 INFO L290 TraceCheckUtils]: 50: Hoare triple {3505#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3505#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 16:42:02,463 INFO L290 TraceCheckUtils]: 51: Hoare triple {3505#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3506#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 16:42:02,464 INFO L290 TraceCheckUtils]: 52: Hoare triple {3506#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3506#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 16:42:02,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {3506#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3507#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 16:42:02,465 INFO L290 TraceCheckUtils]: 54: Hoare triple {3507#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3507#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 16:42:02,465 INFO L290 TraceCheckUtils]: 55: Hoare triple {3507#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3508#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 16:42:02,465 INFO L290 TraceCheckUtils]: 56: Hoare triple {3508#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3508#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 16:42:02,466 INFO L290 TraceCheckUtils]: 57: Hoare triple {3508#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3509#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 16:42:02,466 INFO L290 TraceCheckUtils]: 58: Hoare triple {3509#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3509#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 16:42:02,467 INFO L290 TraceCheckUtils]: 59: Hoare triple {3509#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3510#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 16:42:02,467 INFO L290 TraceCheckUtils]: 60: Hoare triple {3510#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3510#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 16:42:02,468 INFO L290 TraceCheckUtils]: 61: Hoare triple {3510#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3511#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 16:42:02,468 INFO L290 TraceCheckUtils]: 62: Hoare triple {3511#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3511#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 16:42:02,468 INFO L290 TraceCheckUtils]: 63: Hoare triple {3511#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3512#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 16:42:02,469 INFO L290 TraceCheckUtils]: 64: Hoare triple {3512#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3512#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 16:42:02,469 INFO L290 TraceCheckUtils]: 65: Hoare triple {3512#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3513#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 16:42:02,470 INFO L290 TraceCheckUtils]: 66: Hoare triple {3513#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3513#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 16:42:02,470 INFO L290 TraceCheckUtils]: 67: Hoare triple {3513#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3514#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 16:42:02,470 INFO L290 TraceCheckUtils]: 68: Hoare triple {3514#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3514#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 16:42:02,471 INFO L290 TraceCheckUtils]: 69: Hoare triple {3514#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3515#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 16:42:02,471 INFO L290 TraceCheckUtils]: 70: Hoare triple {3515#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3515#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 16:42:02,472 INFO L290 TraceCheckUtils]: 71: Hoare triple {3515#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3516#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 16:42:02,472 INFO L290 TraceCheckUtils]: 72: Hoare triple {3516#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3516#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 16:42:02,473 INFO L290 TraceCheckUtils]: 73: Hoare triple {3516#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3517#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 16:42:02,473 INFO L290 TraceCheckUtils]: 74: Hoare triple {3517#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3517#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 16:42:02,473 INFO L290 TraceCheckUtils]: 75: Hoare triple {3517#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3518#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 16:42:02,474 INFO L290 TraceCheckUtils]: 76: Hoare triple {3518#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3518#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 16:42:02,474 INFO L290 TraceCheckUtils]: 77: Hoare triple {3518#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3519#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 16:42:02,474 INFO L290 TraceCheckUtils]: 78: Hoare triple {3519#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3519#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 16:42:02,475 INFO L290 TraceCheckUtils]: 79: Hoare triple {3519#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3520#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 16:42:02,475 INFO L290 TraceCheckUtils]: 80: Hoare triple {3520#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3520#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 16:42:02,476 INFO L290 TraceCheckUtils]: 81: Hoare triple {3520#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3521#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 16:42:02,476 INFO L290 TraceCheckUtils]: 82: Hoare triple {3521#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3521#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 16:42:02,477 INFO L290 TraceCheckUtils]: 83: Hoare triple {3521#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3522#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-27 16:42:02,477 INFO L290 TraceCheckUtils]: 84: Hoare triple {3522#(and (<= main_~x~0 39) (<= 39 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3522#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-27 16:42:02,477 INFO L290 TraceCheckUtils]: 85: Hoare triple {3522#(and (<= main_~x~0 39) (<= 39 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3523#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 16:42:02,478 INFO L290 TraceCheckUtils]: 86: Hoare triple {3523#(and (<= main_~x~0 40) (<= 40 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3523#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-27 16:42:02,478 INFO L290 TraceCheckUtils]: 87: Hoare triple {3523#(and (<= main_~x~0 40) (<= 40 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3524#(and (<= main_~x~0 41) (<= 41 main_~x~0))} is VALID [2022-04-27 16:42:02,479 INFO L290 TraceCheckUtils]: 88: Hoare triple {3524#(and (<= main_~x~0 41) (<= 41 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3524#(and (<= main_~x~0 41) (<= 41 main_~x~0))} is VALID [2022-04-27 16:42:02,479 INFO L290 TraceCheckUtils]: 89: Hoare triple {3524#(and (<= main_~x~0 41) (<= 41 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3525#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-27 16:42:02,479 INFO L290 TraceCheckUtils]: 90: Hoare triple {3525#(and (<= main_~x~0 42) (<= 42 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3525#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-27 16:42:02,480 INFO L290 TraceCheckUtils]: 91: Hoare triple {3525#(and (<= main_~x~0 42) (<= 42 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3526#(and (<= main_~x~0 43) (<= 43 main_~x~0))} is VALID [2022-04-27 16:42:02,480 INFO L290 TraceCheckUtils]: 92: Hoare triple {3526#(and (<= main_~x~0 43) (<= 43 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3526#(and (<= main_~x~0 43) (<= 43 main_~x~0))} is VALID [2022-04-27 16:42:02,481 INFO L290 TraceCheckUtils]: 93: Hoare triple {3526#(and (<= main_~x~0 43) (<= 43 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3527#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-27 16:42:02,481 INFO L290 TraceCheckUtils]: 94: Hoare triple {3527#(and (<= 44 main_~x~0) (<= main_~x~0 44))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3527#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-27 16:42:02,482 INFO L290 TraceCheckUtils]: 95: Hoare triple {3527#(and (<= 44 main_~x~0) (<= main_~x~0 44))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3528#(and (<= main_~x~0 45) (<= 45 main_~x~0))} is VALID [2022-04-27 16:42:02,482 INFO L290 TraceCheckUtils]: 96: Hoare triple {3528#(and (<= main_~x~0 45) (<= 45 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3528#(and (<= main_~x~0 45) (<= 45 main_~x~0))} is VALID [2022-04-27 16:42:02,482 INFO L290 TraceCheckUtils]: 97: Hoare triple {3528#(and (<= main_~x~0 45) (<= 45 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3529#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-27 16:42:02,483 INFO L290 TraceCheckUtils]: 98: Hoare triple {3529#(and (<= 46 main_~x~0) (<= main_~x~0 46))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3529#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-27 16:42:02,483 INFO L290 TraceCheckUtils]: 99: Hoare triple {3529#(and (<= 46 main_~x~0) (<= main_~x~0 46))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3530#(and (<= 47 main_~x~0) (<= main_~x~0 47))} is VALID [2022-04-27 16:42:02,484 INFO L290 TraceCheckUtils]: 100: Hoare triple {3530#(and (<= 47 main_~x~0) (<= main_~x~0 47))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3530#(and (<= 47 main_~x~0) (<= main_~x~0 47))} is VALID [2022-04-27 16:42:02,484 INFO L290 TraceCheckUtils]: 101: Hoare triple {3530#(and (<= 47 main_~x~0) (<= main_~x~0 47))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3531#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-27 16:42:02,484 INFO L290 TraceCheckUtils]: 102: Hoare triple {3531#(and (<= main_~x~0 48) (<= 48 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3531#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-27 16:42:02,485 INFO L290 TraceCheckUtils]: 103: Hoare triple {3531#(and (<= main_~x~0 48) (<= 48 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3532#(and (<= main_~x~0 49) (<= 49 main_~x~0))} is VALID [2022-04-27 16:42:02,485 INFO L290 TraceCheckUtils]: 104: Hoare triple {3532#(and (<= main_~x~0 49) (<= 49 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3532#(and (<= main_~x~0 49) (<= 49 main_~x~0))} is VALID [2022-04-27 16:42:02,486 INFO L290 TraceCheckUtils]: 105: Hoare triple {3532#(and (<= main_~x~0 49) (<= 49 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3533#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-27 16:42:02,486 INFO L290 TraceCheckUtils]: 106: Hoare triple {3533#(and (<= main_~x~0 50) (<= 50 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3533#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-27 16:42:02,487 INFO L290 TraceCheckUtils]: 107: Hoare triple {3533#(and (<= main_~x~0 50) (<= 50 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3534#(and (<= main_~x~0 51) (<= 51 main_~x~0))} is VALID [2022-04-27 16:42:02,487 INFO L290 TraceCheckUtils]: 108: Hoare triple {3534#(and (<= main_~x~0 51) (<= 51 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3534#(and (<= main_~x~0 51) (<= 51 main_~x~0))} is VALID [2022-04-27 16:42:02,487 INFO L290 TraceCheckUtils]: 109: Hoare triple {3534#(and (<= main_~x~0 51) (<= 51 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3535#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-27 16:42:02,488 INFO L290 TraceCheckUtils]: 110: Hoare triple {3535#(and (<= main_~x~0 52) (<= 52 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3535#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-27 16:42:02,488 INFO L290 TraceCheckUtils]: 111: Hoare triple {3535#(and (<= main_~x~0 52) (<= 52 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3536#(and (<= 53 main_~x~0) (<= main_~x~0 53))} is VALID [2022-04-27 16:42:02,489 INFO L290 TraceCheckUtils]: 112: Hoare triple {3536#(and (<= 53 main_~x~0) (<= main_~x~0 53))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3536#(and (<= 53 main_~x~0) (<= main_~x~0 53))} is VALID [2022-04-27 16:42:02,489 INFO L290 TraceCheckUtils]: 113: Hoare triple {3536#(and (<= 53 main_~x~0) (<= main_~x~0 53))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3537#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-27 16:42:02,489 INFO L290 TraceCheckUtils]: 114: Hoare triple {3537#(and (<= main_~x~0 54) (<= 54 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3537#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-27 16:42:02,490 INFO L290 TraceCheckUtils]: 115: Hoare triple {3537#(and (<= main_~x~0 54) (<= 54 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3538#(and (<= main_~x~0 55) (<= 55 main_~x~0))} is VALID [2022-04-27 16:42:02,490 INFO L290 TraceCheckUtils]: 116: Hoare triple {3538#(and (<= main_~x~0 55) (<= 55 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3538#(and (<= main_~x~0 55) (<= 55 main_~x~0))} is VALID [2022-04-27 16:42:02,491 INFO L290 TraceCheckUtils]: 117: Hoare triple {3538#(and (<= main_~x~0 55) (<= 55 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3539#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-27 16:42:02,491 INFO L290 TraceCheckUtils]: 118: Hoare triple {3539#(and (<= main_~x~0 56) (<= 56 main_~x~0))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3539#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-27 16:42:02,492 INFO L290 TraceCheckUtils]: 119: Hoare triple {3539#(and (<= main_~x~0 56) (<= 56 main_~x~0))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3540#(and (<= 57 main_~x~0) (<= main_~x~0 57))} is VALID [2022-04-27 16:42:02,492 INFO L290 TraceCheckUtils]: 120: Hoare triple {3540#(and (<= 57 main_~x~0) (<= main_~x~0 57))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3540#(and (<= 57 main_~x~0) (<= main_~x~0 57))} is VALID [2022-04-27 16:42:02,492 INFO L290 TraceCheckUtils]: 121: Hoare triple {3540#(and (<= 57 main_~x~0) (<= main_~x~0 57))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3541#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 58))} is VALID [2022-04-27 16:42:02,493 INFO L290 TraceCheckUtils]: 122: Hoare triple {3541#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 58))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3541#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 58))} is VALID [2022-04-27 16:42:02,493 INFO L290 TraceCheckUtils]: 123: Hoare triple {3541#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 58))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3479#false} is VALID [2022-04-27 16:42:02,493 INFO L290 TraceCheckUtils]: 124: Hoare triple {3479#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:02,493 INFO L290 TraceCheckUtils]: 125: Hoare triple {3479#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 126: Hoare triple {3479#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 127: Hoare triple {3479#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 128: Hoare triple {3479#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 129: Hoare triple {3479#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 130: Hoare triple {3479#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 131: Hoare triple {3479#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 132: Hoare triple {3479#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 133: Hoare triple {3479#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 134: Hoare triple {3479#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 135: Hoare triple {3479#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 136: Hoare triple {3479#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 137: Hoare triple {3479#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 138: Hoare triple {3479#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 139: Hoare triple {3479#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 140: Hoare triple {3479#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 141: Hoare triple {3479#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 142: Hoare triple {3479#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 143: Hoare triple {3479#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3479#false} is VALID [2022-04-27 16:42:02,494 INFO L290 TraceCheckUtils]: 144: Hoare triple {3479#false} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:02,495 INFO L290 TraceCheckUtils]: 145: Hoare triple {3479#false} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3479#false} is VALID [2022-04-27 16:42:02,495 INFO L290 TraceCheckUtils]: 146: Hoare triple {3479#false} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:02,495 INFO L272 TraceCheckUtils]: 147: Hoare triple {3479#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {3479#false} is VALID [2022-04-27 16:42:02,495 INFO L290 TraceCheckUtils]: 148: Hoare triple {3479#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3479#false} is VALID [2022-04-27 16:42:02,495 INFO L290 TraceCheckUtils]: 149: Hoare triple {3479#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:02,495 INFO L290 TraceCheckUtils]: 150: Hoare triple {3479#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1357 proven. 3422 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-27 16:42:02,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:42:02,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191864608] [2022-04-27 16:42:02,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191864608] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:42:02,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506066910] [2022-04-27 16:42:02,497 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 16:42:02,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:42:02,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:42:02,499 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 16:42:02,500 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 16:42:24,053 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2022-04-27 16:42:24,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:42:24,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-27 16:42:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:42:24,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:42:26,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {3478#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {3478#true} [47] 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) 12) (= (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] {3478#true} is VALID [2022-04-27 16:42:26,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {3478#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3478#true} {3478#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {3478#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {3478#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 32: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 42: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 43: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 44: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 45: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 46: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 47: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 48: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 49: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 50: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 51: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 52: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 53: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 54: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 55: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,912 INFO L290 TraceCheckUtils]: 56: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,913 INFO L290 TraceCheckUtils]: 57: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,913 INFO L290 TraceCheckUtils]: 58: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,913 INFO L290 TraceCheckUtils]: 59: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,913 INFO L290 TraceCheckUtils]: 60: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,913 INFO L290 TraceCheckUtils]: 61: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,913 INFO L290 TraceCheckUtils]: 62: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,913 INFO L290 TraceCheckUtils]: 63: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,913 INFO L290 TraceCheckUtils]: 64: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,924 INFO L290 TraceCheckUtils]: 65: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3741#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {3741#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3741#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {3741#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3748#(< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,926 INFO L290 TraceCheckUtils]: 68: Hoare triple {3748#(< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3748#(< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,929 INFO L290 TraceCheckUtils]: 69: Hoare triple {3748#(< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3755#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,929 INFO L290 TraceCheckUtils]: 70: Hoare triple {3755#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3755#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,930 INFO L290 TraceCheckUtils]: 71: Hoare triple {3755#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3762#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,930 INFO L290 TraceCheckUtils]: 72: Hoare triple {3762#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3762#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,933 INFO L290 TraceCheckUtils]: 73: Hoare triple {3762#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3769#(and (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,933 INFO L290 TraceCheckUtils]: 74: Hoare triple {3769#(and (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3769#(and (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,934 INFO L290 TraceCheckUtils]: 75: Hoare triple {3769#(and (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3776#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ 4294967290 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,935 INFO L290 TraceCheckUtils]: 76: Hoare triple {3776#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ 4294967290 main_~x~0) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3776#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ 4294967290 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,937 INFO L290 TraceCheckUtils]: 77: Hoare triple {3776#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ 4294967290 main_~x~0) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3783#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,938 INFO L290 TraceCheckUtils]: 78: Hoare triple {3783#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3783#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,945 INFO L290 TraceCheckUtils]: 79: Hoare triple {3783#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3790#(and (< (mod (+ 4294967288 main_~x~0) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,945 INFO L290 TraceCheckUtils]: 80: Hoare triple {3790#(and (< (mod (+ 4294967288 main_~x~0) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3790#(and (< (mod (+ 4294967288 main_~x~0) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,946 INFO L290 TraceCheckUtils]: 81: Hoare triple {3790#(and (< (mod (+ 4294967288 main_~x~0) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3797#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967287) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,946 INFO L290 TraceCheckUtils]: 82: Hoare triple {3797#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967287) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3797#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967287) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,947 INFO L290 TraceCheckUtils]: 83: Hoare triple {3797#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967287) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3804#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967286) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,948 INFO L290 TraceCheckUtils]: 84: Hoare triple {3804#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967286) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3804#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967286) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,951 INFO L290 TraceCheckUtils]: 85: Hoare triple {3804#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967286) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3811#(and (< (mod (+ main_~x~0 4294967285) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,951 INFO L290 TraceCheckUtils]: 86: Hoare triple {3811#(and (< (mod (+ main_~x~0 4294967285) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3811#(and (< (mod (+ main_~x~0 4294967285) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,952 INFO L290 TraceCheckUtils]: 87: Hoare triple {3811#(and (< (mod (+ main_~x~0 4294967285) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3818#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967284) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,953 INFO L290 TraceCheckUtils]: 88: Hoare triple {3818#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967284) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3818#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967284) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,953 INFO L290 TraceCheckUtils]: 89: Hoare triple {3818#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967284) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3825#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,954 INFO L290 TraceCheckUtils]: 90: Hoare triple {3825#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3825#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,954 INFO L290 TraceCheckUtils]: 91: Hoare triple {3825#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3832#(and (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000) (< (mod (+ 4294967282 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,955 INFO L290 TraceCheckUtils]: 92: Hoare triple {3832#(and (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000) (< (mod (+ 4294967282 main_~x~0) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3832#(and (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000) (< (mod (+ 4294967282 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,955 INFO L290 TraceCheckUtils]: 93: Hoare triple {3832#(and (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000) (< (mod (+ 4294967282 main_~x~0) 4294967296) 10000000))} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,955 INFO L290 TraceCheckUtils]: 94: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,955 INFO L290 TraceCheckUtils]: 95: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,955 INFO L290 TraceCheckUtils]: 96: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,955 INFO L290 TraceCheckUtils]: 97: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,955 INFO L290 TraceCheckUtils]: 98: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,955 INFO L290 TraceCheckUtils]: 99: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,955 INFO L290 TraceCheckUtils]: 100: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,955 INFO L290 TraceCheckUtils]: 101: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,955 INFO L290 TraceCheckUtils]: 102: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 103: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 104: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 105: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 106: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 107: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 108: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 109: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 110: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 111: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 112: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 113: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 114: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 115: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 116: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 117: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 118: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 119: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:26,956 INFO L290 TraceCheckUtils]: 120: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:26,957 INFO L290 TraceCheckUtils]: 121: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3741#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,957 INFO L290 TraceCheckUtils]: 122: Hoare triple {3741#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3741#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,958 INFO L290 TraceCheckUtils]: 123: Hoare triple {3741#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3929#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,958 INFO L290 TraceCheckUtils]: 124: Hoare triple {3929#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3929#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,959 INFO L290 TraceCheckUtils]: 125: Hoare triple {3929#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3936#(< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,959 INFO L290 TraceCheckUtils]: 126: Hoare triple {3936#(< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3936#(< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,960 INFO L290 TraceCheckUtils]: 127: Hoare triple {3936#(< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000)} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3943#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,960 INFO L290 TraceCheckUtils]: 128: Hoare triple {3943#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3943#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,961 INFO L290 TraceCheckUtils]: 129: Hoare triple {3943#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3950#(< (mod (+ main_~x~0 4294967287) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,961 INFO L290 TraceCheckUtils]: 130: Hoare triple {3950#(< (mod (+ main_~x~0 4294967287) 4294967296) 10000000)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3950#(< (mod (+ main_~x~0 4294967287) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,962 INFO L290 TraceCheckUtils]: 131: Hoare triple {3950#(< (mod (+ main_~x~0 4294967287) 4294967296) 10000000)} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3957#(< (mod (+ main_~x~0 4294967285) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,962 INFO L290 TraceCheckUtils]: 132: Hoare triple {3957#(< (mod (+ main_~x~0 4294967285) 4294967296) 10000000)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3957#(< (mod (+ main_~x~0 4294967285) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,963 INFO L290 TraceCheckUtils]: 133: Hoare triple {3957#(< (mod (+ main_~x~0 4294967285) 4294967296) 10000000)} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3964#(< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,964 INFO L290 TraceCheckUtils]: 134: Hoare triple {3964#(< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3964#(< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,964 INFO L290 TraceCheckUtils]: 135: Hoare triple {3964#(< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000)} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3971#(< (mod (+ main_~x~0 4294967281) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,965 INFO L290 TraceCheckUtils]: 136: Hoare triple {3971#(< (mod (+ main_~x~0 4294967281) 4294967296) 10000000)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3971#(< (mod (+ main_~x~0 4294967281) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,965 INFO L290 TraceCheckUtils]: 137: Hoare triple {3971#(< (mod (+ main_~x~0 4294967281) 4294967296) 10000000)} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3978#(< (mod (+ main_~x~0 4294967279) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,966 INFO L290 TraceCheckUtils]: 138: Hoare triple {3978#(< (mod (+ main_~x~0 4294967279) 4294967296) 10000000)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3978#(< (mod (+ main_~x~0 4294967279) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,966 INFO L290 TraceCheckUtils]: 139: Hoare triple {3978#(< (mod (+ main_~x~0 4294967279) 4294967296) 10000000)} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3985#(< (mod (+ main_~x~0 4294967277) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,966 INFO L290 TraceCheckUtils]: 140: Hoare triple {3985#(< (mod (+ main_~x~0 4294967277) 4294967296) 10000000)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3985#(< (mod (+ main_~x~0 4294967277) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,967 INFO L290 TraceCheckUtils]: 141: Hoare triple {3985#(< (mod (+ main_~x~0 4294967277) 4294967296) 10000000)} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3992#(< (mod (+ 4294967275 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,967 INFO L290 TraceCheckUtils]: 142: Hoare triple {3992#(< (mod (+ 4294967275 main_~x~0) 4294967296) 10000000)} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3992#(< (mod (+ 4294967275 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-27 16:42:26,969 INFO L290 TraceCheckUtils]: 143: Hoare triple {3992#(< (mod (+ 4294967275 main_~x~0) 4294967296) 10000000)} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3999#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967273 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,970 INFO L290 TraceCheckUtils]: 144: Hoare triple {3999#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967273 main_~x~0) 4294967296) 10000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3999#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967273 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-27 16:42:26,970 INFO L290 TraceCheckUtils]: 145: Hoare triple {3999#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967273 main_~x~0) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4006#(and (< (mod (+ main_~x~0 4294967271) 4294967296) 10000000) (not (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000)))} is VALID [2022-04-27 16:42:26,971 INFO L290 TraceCheckUtils]: 146: Hoare triple {4006#(and (< (mod (+ main_~x~0 4294967271) 4294967296) 10000000) (not (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000)))} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:26,971 INFO L272 TraceCheckUtils]: 147: Hoare triple {3479#false} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {3479#false} is VALID [2022-04-27 16:42:26,971 INFO L290 TraceCheckUtils]: 148: Hoare triple {3479#false} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3479#false} is VALID [2022-04-27 16:42:26,971 INFO L290 TraceCheckUtils]: 149: Hoare triple {3479#false} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:26,972 INFO L290 TraceCheckUtils]: 150: Hoare triple {3479#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2022 proven. 984 refuted. 0 times theorem prover too weak. 1894 trivial. 0 not checked. [2022-04-27 16:42:26,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:42:30,219 INFO L290 TraceCheckUtils]: 150: Hoare triple {3479#false} [61] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:30,220 INFO L290 TraceCheckUtils]: 149: Hoare triple {4025#(not (<= __VERIFIER_assert_~cond 0))} [59] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3479#false} is VALID [2022-04-27 16:42:30,220 INFO L290 TraceCheckUtils]: 148: Hoare triple {4029#(< 0 |__VERIFIER_assert_#in~cond|)} [58] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4025#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:42:30,221 INFO L272 TraceCheckUtils]: 147: Hoare triple {4033#(= 100000000 (mod main_~x~0 4294967296))} [54] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 100000000 (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {4029#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:42:30,221 INFO L290 TraceCheckUtils]: 146: Hoare triple {4037#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} [52] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {4033#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-27 16:42:30,222 INFO L290 TraceCheckUtils]: 145: Hoare triple {4041#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4037#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:42:30,222 INFO L290 TraceCheckUtils]: 144: Hoare triple {4041#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4041#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-27 16:42:30,223 INFO L290 TraceCheckUtils]: 143: Hoare triple {4048#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4041#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-27 16:42:30,223 INFO L290 TraceCheckUtils]: 142: Hoare triple {4052#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4048#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-27 16:42:30,224 INFO L290 TraceCheckUtils]: 141: Hoare triple {4056#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4052#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-27 16:42:30,224 INFO L290 TraceCheckUtils]: 140: Hoare triple {4056#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4056#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-27 16:42:30,225 INFO L290 TraceCheckUtils]: 139: Hoare triple {4063#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4056#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-27 16:42:30,226 INFO L290 TraceCheckUtils]: 138: Hoare triple {4063#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4063#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-27 16:42:30,226 INFO L290 TraceCheckUtils]: 137: Hoare triple {4070#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 100000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4063#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-27 16:42:30,227 INFO L290 TraceCheckUtils]: 136: Hoare triple {4070#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 100000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4070#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 100000000))} is VALID [2022-04-27 16:42:30,228 INFO L290 TraceCheckUtils]: 135: Hoare triple {4077#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 12) 4294967296)))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4070#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 100000000))} is VALID [2022-04-27 16:42:30,228 INFO L290 TraceCheckUtils]: 134: Hoare triple {4077#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 12) 4294967296)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4077#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 16:42:30,233 INFO L290 TraceCheckUtils]: 133: Hoare triple {4084#(or (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 100000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4077#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 16:42:30,234 INFO L290 TraceCheckUtils]: 132: Hoare triple {4084#(or (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 100000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4084#(or (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 100000000))} is VALID [2022-04-27 16:42:30,261 INFO L290 TraceCheckUtils]: 131: Hoare triple {4091#(or (= (mod (+ main_~x~0 16) 4294967296) 100000000) (< (mod (+ main_~x~0 16) 4294967296) 100000000) (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4084#(or (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 100000000))} is VALID [2022-04-27 16:42:30,262 INFO L290 TraceCheckUtils]: 130: Hoare triple {4091#(or (= (mod (+ main_~x~0 16) 4294967296) 100000000) (< (mod (+ main_~x~0 16) 4294967296) 100000000) (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4091#(or (= (mod (+ main_~x~0 16) 4294967296) 100000000) (< (mod (+ main_~x~0 16) 4294967296) 100000000) (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)))} is VALID [2022-04-27 16:42:30,263 INFO L290 TraceCheckUtils]: 129: Hoare triple {4098#(or (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 18) 4294967296)) (< (mod (+ main_~x~0 18) 4294967296) 100000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4091#(or (= (mod (+ main_~x~0 16) 4294967296) 100000000) (< (mod (+ main_~x~0 16) 4294967296) 100000000) (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)))} is VALID [2022-04-27 16:42:30,263 INFO L290 TraceCheckUtils]: 128: Hoare triple {4098#(or (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 18) 4294967296)) (< (mod (+ main_~x~0 18) 4294967296) 100000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4098#(or (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 18) 4294967296)) (< (mod (+ main_~x~0 18) 4294967296) 100000000))} is VALID [2022-04-27 16:42:30,264 INFO L290 TraceCheckUtils]: 127: Hoare triple {4105#(or (< (mod (+ main_~x~0 20) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 20) 4294967296)) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4098#(or (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 18) 4294967296)) (< (mod (+ main_~x~0 18) 4294967296) 100000000))} is VALID [2022-04-27 16:42:30,264 INFO L290 TraceCheckUtils]: 126: Hoare triple {4105#(or (< (mod (+ main_~x~0 20) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 20) 4294967296)) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4105#(or (< (mod (+ main_~x~0 20) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 20) 4294967296)) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-27 16:42:30,265 INFO L290 TraceCheckUtils]: 125: Hoare triple {4112#(or (< (mod (+ main_~x~0 22) 4294967296) 100000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)) (= (mod (+ main_~x~0 22) 4294967296) 100000000))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4105#(or (< (mod (+ main_~x~0 20) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 20) 4294967296)) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-27 16:42:30,266 INFO L290 TraceCheckUtils]: 124: Hoare triple {4112#(or (< (mod (+ main_~x~0 22) 4294967296) 100000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)) (= (mod (+ main_~x~0 22) 4294967296) 100000000))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4112#(or (< (mod (+ main_~x~0 22) 4294967296) 100000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)) (= (mod (+ main_~x~0 22) 4294967296) 100000000))} is VALID [2022-04-27 16:42:30,266 INFO L290 TraceCheckUtils]: 123: Hoare triple {4119#(or (< (mod (+ main_~x~0 24) 4294967296) 100000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 24) 4294967296)))} [56] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {4112#(or (< (mod (+ main_~x~0 22) 4294967296) 100000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)) (= (mod (+ main_~x~0 22) 4294967296) 100000000))} is VALID [2022-04-27 16:42:30,267 INFO L290 TraceCheckUtils]: 122: Hoare triple {4119#(or (< (mod (+ main_~x~0 24) 4294967296) 100000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 24) 4294967296)))} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {4119#(or (< (mod (+ main_~x~0 24) 4294967296) 100000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 24) 4294967296)))} is VALID [2022-04-27 16:42:30,277 INFO L290 TraceCheckUtils]: 121: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4119#(or (< (mod (+ main_~x~0 24) 4294967296) 100000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)) (= 100000000 (mod (+ main_~x~0 24) 4294967296)))} is VALID [2022-04-27 16:42:30,277 INFO L290 TraceCheckUtils]: 120: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,277 INFO L290 TraceCheckUtils]: 119: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,277 INFO L290 TraceCheckUtils]: 118: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,277 INFO L290 TraceCheckUtils]: 117: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 116: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 115: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 114: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 113: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 112: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 111: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 110: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 109: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 108: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 107: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 106: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 105: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 104: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 103: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 102: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 101: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 100: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,278 INFO L290 TraceCheckUtils]: 99: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 98: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 97: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 96: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 95: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 94: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 93: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 92: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 91: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 90: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 89: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 88: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 87: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 86: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 85: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 84: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 83: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 82: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 81: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,279 INFO L290 TraceCheckUtils]: 80: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 79: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 78: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 77: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 76: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 75: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 74: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 73: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 72: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 71: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 70: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 69: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 68: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 67: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 66: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 65: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 64: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 63: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,280 INFO L290 TraceCheckUtils]: 62: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 61: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 60: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 59: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 58: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 55: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 54: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 53: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 46: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,281 INFO L290 TraceCheckUtils]: 43: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 42: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 41: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 37: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 36: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 33: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 32: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 30: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {3478#true} [55] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3478#true} is VALID [2022-04-27 16:42:30,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {3478#true} [53] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {3478#true} [49] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {3478#true} is VALID [2022-04-27 16:42:30,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {3478#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3478#true} {3478#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {3478#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {3478#true} [47] 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) 12) (= (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] {3478#true} is VALID [2022-04-27 16:42:30,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {3478#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3478#true} is VALID [2022-04-27 16:42:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1450 proven. 144 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2022-04-27 16:42:30,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506066910] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:42:30,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:42:30,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 28, 19] total 105 [2022-04-27 16:42:30,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369347421] [2022-04-27 16:42:30,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:42:30,287 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 104 states have (on average 2.0384615384615383) internal successors, (212), 103 states have internal predecessors, (212), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 151 [2022-04-27 16:42:30,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:42:30,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 105 states, 104 states have (on average 2.0384615384615383) internal successors, (212), 103 states have internal predecessors, (212), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:42:30,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:42:30,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2022-04-27 16:42:30,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:42:30,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2022-04-27 16:42:30,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2717, Invalid=8203, Unknown=0, NotChecked=0, Total=10920 [2022-04-27 16:42:30,776 INFO L87 Difference]: Start difference. First operand 152 states and 159 transitions. Second operand has 105 states, 104 states have (on average 2.0384615384615383) internal successors, (212), 103 states have internal predecessors, (212), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:44:21,955 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []