/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/Mono3_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 17:21:42,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:21:42,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:21:42,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:21:42,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:21:42,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:21:42,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:21:42,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:21:42,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:21:42,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:21:42,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:21:42,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:21:42,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:21:42,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:21:42,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:21:42,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:21:42,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:21:42,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:21:42,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:21:42,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:21:42,102 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:21:42,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:21:42,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:21:42,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:21:42,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:21:42,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:21:42,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:21:42,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:21:42,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:21:42,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:21:42,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:21:42,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:21:42,122 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:21:42,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:21:42,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:21:42,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:21:42,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:21:42,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:21:42,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:21:42,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:21:42,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:21:42,126 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:21:42,126 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:21:42,133 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:21:42,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:21:42,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:21:42,134 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:21:42,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:21:42,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:21:42,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:21:42,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:21:42,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:21:42,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:21:42,135 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:21:42,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:21:42,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:21:42,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:21:42,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:21:42,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:21:42,135 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:21:42,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:21:42,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:21:42,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:21:42,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:21:42,136 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:21:42,136 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-07 17:21:42,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:21:42,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:21:42,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:21:42,347 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:21:42,350 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:21:42,351 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2022-04-07 17:21:42,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b5ea82e8/6731136bcd794bdfaff53969d6f3976b/FLAGcf7b47b74 [2022-04-07 17:21:42,693 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:21:42,693 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2022-04-07 17:21:42,698 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b5ea82e8/6731136bcd794bdfaff53969d6f3976b/FLAGcf7b47b74 [2022-04-07 17:21:43,125 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b5ea82e8/6731136bcd794bdfaff53969d6f3976b [2022-04-07 17:21:43,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:21:43,128 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:21:43,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:21:43,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:21:43,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:21:43,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:21:43" (1/1) ... [2022-04-07 17:21:43,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bcc1fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:21:43, skipping insertion in model container [2022-04-07 17:21:43,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:21:43" (1/1) ... [2022-04-07 17:21:43,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:21:43,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:21:43,243 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/Mono3_1.c[311,324] [2022-04-07 17:21:43,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:21:43,267 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:21:43,274 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/Mono3_1.c[311,324] [2022-04-07 17:21:43,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:21:43,284 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:21:43,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:21:43 WrapperNode [2022-04-07 17:21:43,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:21:43,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:21:43,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:21:43,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:21:43,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:21:43" (1/1) ... [2022-04-07 17:21:43,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:21:43" (1/1) ... [2022-04-07 17:21:43,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:21:43" (1/1) ... [2022-04-07 17:21:43,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:21:43" (1/1) ... [2022-04-07 17:21:43,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:21:43" (1/1) ... [2022-04-07 17:21:43,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:21:43" (1/1) ... [2022-04-07 17:21:43,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:21:43" (1/1) ... [2022-04-07 17:21:43,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:21:43,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:21:43,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:21:43,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:21:43,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:21:43" (1/1) ... [2022-04-07 17:21:43,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:21:43,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:21:43,334 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-07 17:21:43,335 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-07 17:21:43,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:21:43,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:21:43,358 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:21:43,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 17:21:43,358 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:21:43,358 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 17:21:43,358 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:21:43,358 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:21:43,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:21:43,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:21:43,359 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:21:43,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:21:43,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:21:43,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:21:43,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:21:43,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:21:43,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:21:43,402 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:21:43,404 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:21:43,563 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:21:43,567 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:21:43,568 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 17:21:43,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:21:43 BoogieIcfgContainer [2022-04-07 17:21:43,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:21:43,569 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:21:43,569 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:21:43,570 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:21:43,575 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:21:43" (1/1) ... [2022-04-07 17:21:43,580 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:21:43,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:21:43 BasicIcfg [2022-04-07 17:21:43,602 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:21:43,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:21:43,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:21:43,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:21:43,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:21:43" (1/4) ... [2022-04-07 17:21:43,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174c510d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:21:43, skipping insertion in model container [2022-04-07 17:21:43,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:21:43" (2/4) ... [2022-04-07 17:21:43,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174c510d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:21:43, skipping insertion in model container [2022-04-07 17:21:43,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:21:43" (3/4) ... [2022-04-07 17:21:43,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174c510d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:21:43, skipping insertion in model container [2022-04-07 17:21:43,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:21:43" (4/4) ... [2022-04-07 17:21:43,607 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono3_1.cJordan [2022-04-07 17:21:43,610 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:21:43,610 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 17:21:43,636 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:21:43,641 INFO L340 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 [2022-04-07 17:21:43,641 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 17:21:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-07 17:21:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 17:21:43,657 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:21:43,657 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:21:43,657 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:21:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:21:43,661 INFO L85 PathProgramCache]: Analyzing trace with hash -154368955, now seen corresponding path program 1 times [2022-04-07 17:21:43,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:21:43,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504722357] [2022-04-07 17:21:43,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:21:43,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:21:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:43,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:21:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:43,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-07 17:21:43,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 17:21:43,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 17:21:43,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:21:43,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-07 17:21:43,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 17:21:43,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 17:21:43,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 17:21:43,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {23#true} is VALID [2022-04-07 17:21:43,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [52] L9-2-->L9-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 17:21:43,831 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {24#false} is VALID [2022-04-07 17:21:43,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-07 17:21:43,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 17:21:43,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 17:21:43,833 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-07 17:21:43,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:21:43,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504722357] [2022-04-07 17:21:43,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504722357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:21:43,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:21:43,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 17:21:43,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86365399] [2022-04-07 17:21:43,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:21:43,842 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-07 17:21:43,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:21:43,845 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-07 17:21:43,861 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-07 17:21:43,861 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 17:21:43,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:21:43,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 17:21:43,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 17:21:43,885 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-07 17:21:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:43,948 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-07 17:21:43,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 17:21:43,948 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-07 17:21:43,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:21:43,949 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-07 17:21:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-07 17:21:43,955 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-07 17:21:43,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-07 17:21:43,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-04-07 17:21:43,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:21:43,994 INFO L225 Difference]: With dead ends: 20 [2022-04-07 17:21:43,994 INFO L226 Difference]: Without dead ends: 14 [2022-04-07 17:21:43,995 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 17:21:44,000 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 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-07 17:21:44,001 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:21:44,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-07 17:21:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-07 17:21:44,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:21:44,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:44,022 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:44,022 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:44,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:44,027 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-07 17:21:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 17:21:44,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:21:44,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:21:44,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-07 17:21:44,030 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-07 17:21:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:44,035 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-07 17:21:44,035 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 17:21:44,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:21:44,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:21:44,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:21:44,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:21:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-07 17:21:44,039 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-07 17:21:44,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:21:44,039 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-07 17:21:44,040 INFO L479 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-07 17:21:44,040 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 17:21:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 17:21:44,040 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:21:44,040 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:21:44,041 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:21:44,042 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:21:44,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:21:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash -153445434, now seen corresponding path program 1 times [2022-04-07 17:21:44,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:21:44,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106270601] [2022-04-07 17:21:44,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:21:44,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:21:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:44,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:21:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:44,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {93#true} is VALID [2022-04-07 17:21:44,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {93#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-07 17:21:44,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93#true} {93#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-07 17:21:44,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {93#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:21:44,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {93#true} is VALID [2022-04-07 17:21:44,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {93#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-07 17:21:44,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93#true} {93#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-07 17:21:44,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {93#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-07 17:21:44,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {93#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {98#(= main_~x~0 0)} is VALID [2022-04-07 17:21:44,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {98#(= main_~x~0 0)} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {94#false} is VALID [2022-04-07 17:21:44,135 INFO L272 TraceCheckUtils]: 7: Hoare triple {94#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {94#false} is VALID [2022-04-07 17:21:44,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {94#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {94#false} is VALID [2022-04-07 17:21:44,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {94#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {94#false} is VALID [2022-04-07 17:21:44,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {94#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#false} is VALID [2022-04-07 17:21:44,136 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-07 17:21:44,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:21:44,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106270601] [2022-04-07 17:21:44,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106270601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:21:44,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:21:44,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 17:21:44,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751193028] [2022-04-07 17:21:44,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:21:44,138 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-07 17:21:44,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:21:44,138 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-07 17:21:44,151 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-07 17:21:44,151 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 17:21:44,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:21:44,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 17:21:44,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 17:21:44,154 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:44,234 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-07 17:21:44,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 17:21:44,234 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-07 17:21:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:21:44,235 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-07 17:21:44,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-07 17:21:44,241 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-07 17:21:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-07 17:21:44,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2022-04-07 17:21:44,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:21:44,270 INFO L225 Difference]: With dead ends: 17 [2022-04-07 17:21:44,270 INFO L226 Difference]: Without dead ends: 17 [2022-04-07 17:21:44,275 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-07 17:21:44,276 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:21:44,276 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:21:44,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-07 17:21:44,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-07 17:21:44,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:21:44,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:44,281 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:44,281 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:44,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:44,283 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-07 17:21:44,283 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-07 17:21:44,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:21:44,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:21:44,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-07 17:21:44,286 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-07 17:21:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:44,287 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-07 17:21:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-07 17:21:44,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:21:44,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:21:44,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:21:44,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:21:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-07 17:21:44,290 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-07 17:21:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:21:44,291 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-07 17:21:44,291 INFO L479 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-07 17:21:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-07 17:21:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 17:21:44,292 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:21:44,292 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:21:44,292 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 17:21:44,292 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:21:44,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:21:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1203653974, now seen corresponding path program 1 times [2022-04-07 17:21:44,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:21:44,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662952485] [2022-04-07 17:21:44,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:21:44,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:21:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:44,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:21:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:44,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {171#true} is VALID [2022-04-07 17:21:44,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 17:21:44,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 17:21:44,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:21:44,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {171#true} is VALID [2022-04-07 17:21:44,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 17:21:44,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 17:21:44,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 17:21:44,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {176#(= main_~x~0 0)} is VALID [2022-04-07 17:21:44,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {176#(= main_~x~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {176#(= main_~x~0 0)} is VALID [2022-04-07 17:21:44,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {176#(= main_~x~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {176#(= main_~x~0 0)} is VALID [2022-04-07 17:21:44,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {176#(= main_~x~0 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {177#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:21:44,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {177#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 17:21:44,396 INFO L272 TraceCheckUtils]: 10: Hoare triple {172#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {172#false} is VALID [2022-04-07 17:21:44,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {172#false} is VALID [2022-04-07 17:21:44,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {172#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 17:21:44,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {172#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 17:21:44,398 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-07 17:21:44,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:21:44,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662952485] [2022-04-07 17:21:44,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662952485] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:21:44,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648979922] [2022-04-07 17:21:44,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:21:44,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:21:44,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:21:44,404 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-07 17:21:44,405 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-07 17:21:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:44,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 17:21:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:44,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:21:44,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 17:21:44,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {171#true} is VALID [2022-04-07 17:21:44,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 17:21:44,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 17:21:44,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 17:21:44,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {197#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 17:21:44,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {197#(and (= main_~x~0 0) (= main_~y~0 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {197#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 17:21:44,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {197#(and (= main_~x~0 0) (= main_~y~0 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {204#(and (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-07 17:21:44,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#(and (= main_~x~0 0) (= main_~y~0 1))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {208#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1))} is VALID [2022-04-07 17:21:44,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {208#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1))} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 17:21:44,576 INFO L272 TraceCheckUtils]: 10: Hoare triple {172#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {172#false} is VALID [2022-04-07 17:21:44,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {172#false} is VALID [2022-04-07 17:21:44,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {172#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 17:21:44,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {172#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 17:21:44,578 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-07 17:21:44,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:21:44,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {172#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 17:21:44,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {227#(not (<= __VERIFIER_assert_~cond 0))} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 17:21:44,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {231#(< 0 |__VERIFIER_assert_#in~cond|)} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {227#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:21:44,787 INFO L272 TraceCheckUtils]: 10: Hoare triple {235#(not (= (mod main_~y~0 4294967296) 0))} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {231#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:21:44,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {239#(or (not (= (mod main_~y~0 4294967296) 0)) (< (mod main_~x~0 4294967296) 1000000))} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {235#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:21:44,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#(or (not (= (mod main_~y~0 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {239#(or (not (= (mod main_~y~0 4294967296) 0)) (< (mod main_~x~0 4294967296) 1000000))} is VALID [2022-04-07 17:21:44,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {247#(or (not (= (mod (+ main_~y~0 1) 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {243#(or (not (= (mod main_~y~0 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} is VALID [2022-04-07 17:21:44,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {247#(or (not (= (mod (+ main_~y~0 1) 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {247#(or (not (= (mod (+ main_~y~0 1) 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} is VALID [2022-04-07 17:21:44,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {247#(or (not (= (mod (+ main_~y~0 1) 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} is VALID [2022-04-07 17:21:44,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 17:21:44,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 17:21:44,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 17:21:44,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {171#true} is VALID [2022-04-07 17:21:44,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 17:21:44,792 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-07 17:21:44,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648979922] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:21:44,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:21:44,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 8] total 14 [2022-04-07 17:21:44,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049455848] [2022-04-07 17:21:44,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:21:44,794 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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 14 [2022-04-07 17:21:44,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:21:44,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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-07 17:21:44,821 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-07 17:21:44,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 17:21:44,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:21:44,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 17:21:44,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-07 17:21:44,824 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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-07 17:21:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:45,215 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-07 17:21:45,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 17:21:45,215 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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 14 [2022-04-07 17:21:45,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:21:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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-07 17:21:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2022-04-07 17:21:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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-07 17:21:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2022-04-07 17:21:45,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 35 transitions. [2022-04-07 17:21:45,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:21:45,255 INFO L225 Difference]: With dead ends: 29 [2022-04-07 17:21:45,255 INFO L226 Difference]: Without dead ends: 25 [2022-04-07 17:21:45,256 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2022-04-07 17:21:45,258 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:21:45,260 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 46 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:21:45,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-07 17:21:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-04-07 17:21:45,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:21:45,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-07 17:21:45,264 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-07 17:21:45,264 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-07 17:21:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:45,267 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-07 17:21:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-07 17:21:45,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:21:45,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:21:45,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 25 states. [2022-04-07 17:21:45,267 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 25 states. [2022-04-07 17:21:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:45,270 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-07 17:21:45,270 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-07 17:21:45,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:21:45,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:21:45,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:21:45,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:21:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-07 17:21:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-07 17:21:45,276 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-04-07 17:21:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:21:45,276 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-07 17:21:45,276 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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-07 17:21:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-07 17:21:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 17:21:45,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:21:45,277 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:21:45,297 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-07 17:21:45,487 WARN L460 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-07 17:21:45,487 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:21:45,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:21:45,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2025124503, now seen corresponding path program 1 times [2022-04-07 17:21:45,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:21:45,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459943556] [2022-04-07 17:21:45,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:21:45,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:21:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:45,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:21:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:45,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {393#true} is VALID [2022-04-07 17:21:45,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 17:21:45,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {393#true} {393#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 17:21:45,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:21:45,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {393#true} is VALID [2022-04-07 17:21:45,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 17:21:45,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 17:21:45,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 17:21:45,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {398#(= main_~x~0 0)} is VALID [2022-04-07 17:21:45,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {398#(= main_~x~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {398#(= main_~x~0 0)} is VALID [2022-04-07 17:21:45,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {398#(= main_~x~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {398#(= main_~x~0 0)} is VALID [2022-04-07 17:21:45,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {398#(= main_~x~0 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {399#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:21:45,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {399#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {399#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:21:45,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {399#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {399#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:21:45,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {399#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {400#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-07 17:21:45,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {400#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {400#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-07 17:21:45,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {400#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {394#false} is VALID [2022-04-07 17:21:45,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {394#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {394#false} is VALID [2022-04-07 17:21:45,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {394#false} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {394#false} is VALID [2022-04-07 17:21:45,601 INFO L272 TraceCheckUtils]: 16: Hoare triple {394#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {394#false} is VALID [2022-04-07 17:21:45,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {394#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {394#false} is VALID [2022-04-07 17:21:45,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {394#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {394#false} is VALID [2022-04-07 17:21:45,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {394#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#false} is VALID [2022-04-07 17:21:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:21:45,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:21:45,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459943556] [2022-04-07 17:21:45,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459943556] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:21:45,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184421101] [2022-04-07 17:21:45,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:21:45,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:21:45,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:21:45,606 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-07 17:21:45,627 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-07 17:21:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:45,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 17:21:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:45,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:21:45,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 17:21:45,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {393#true} is VALID [2022-04-07 17:21:45,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 17:21:45,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 17:21:45,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 17:21:45,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {420#(= main_~y~0 0)} is VALID [2022-04-07 17:21:45,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {420#(= main_~y~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {420#(= main_~y~0 0)} is VALID [2022-04-07 17:21:45,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#(= main_~y~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {427#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-07 17:21:45,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {427#(= (+ (- 1) main_~y~0) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {427#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-07 17:21:45,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {427#(= (+ (- 1) main_~y~0) 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {427#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-07 17:21:45,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {427#(= (+ (- 1) main_~y~0) 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {437#(= main_~y~0 2)} is VALID [2022-04-07 17:21:45,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(= main_~y~0 2)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {437#(= main_~y~0 2)} is VALID [2022-04-07 17:21:45,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {437#(= main_~y~0 2)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {437#(= main_~y~0 2)} is VALID [2022-04-07 17:21:45,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {437#(= main_~y~0 2)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {427#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-07 17:21:45,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {427#(= (+ (- 1) main_~y~0) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {427#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-07 17:21:45,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {427#(= (+ (- 1) main_~y~0) 0)} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {427#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-07 17:21:45,772 INFO L272 TraceCheckUtils]: 16: Hoare triple {427#(= (+ (- 1) main_~y~0) 0)} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {456#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:21:45,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {456#(<= 1 |__VERIFIER_assert_#in~cond|)} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {460#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:21:45,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {460#(<= 1 __VERIFIER_assert_~cond)} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {394#false} is VALID [2022-04-07 17:21:45,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {394#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#false} is VALID [2022-04-07 17:21:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 17:21:45,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:21:45,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {394#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#false} is VALID [2022-04-07 17:21:45,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {460#(<= 1 __VERIFIER_assert_~cond)} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {394#false} is VALID [2022-04-07 17:21:45,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {456#(<= 1 |__VERIFIER_assert_#in~cond|)} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {460#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:21:45,911 INFO L272 TraceCheckUtils]: 16: Hoare triple {476#(not (= (mod main_~y~0 4294967296) 0))} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {456#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:21:45,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {476#(not (= (mod main_~y~0 4294967296) 0))} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {476#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:21:45,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {476#(not (= (mod main_~y~0 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {476#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:21:45,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {486#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {476#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:21:45,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {486#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {486#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-07 17:21:45,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {486#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {486#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-07 17:21:45,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {476#(not (= (mod main_~y~0 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {486#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-07 17:21:45,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {476#(not (= (mod main_~y~0 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {476#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:21:45,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {476#(not (= (mod main_~y~0 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {476#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:21:45,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {476#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:21:45,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {505#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {505#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-07 17:21:45,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {505#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-07 17:21:45,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 17:21:45,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 17:21:45,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 17:21:45,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {393#true} is VALID [2022-04-07 17:21:45,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-07 17:21:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 17:21:45,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184421101] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:21:45,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:21:45,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-04-07 17:21:45,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140343196] [2022-04-07 17:21:45,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:21:45,934 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 17:21:45,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:21:45,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:45,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:21:45,968 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 17:21:45,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:21:45,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 17:21:45,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-07 17:21:45,969 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:46,492 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-07 17:21:46,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-07 17:21:46,492 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 17:21:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:21:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 56 transitions. [2022-04-07 17:21:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 56 transitions. [2022-04-07 17:21:46,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 56 transitions. [2022-04-07 17:21:46,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:21:46,549 INFO L225 Difference]: With dead ends: 49 [2022-04-07 17:21:46,549 INFO L226 Difference]: Without dead ends: 45 [2022-04-07 17:21:46,550 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2022-04-07 17:21:46,550 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:21:46,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 52 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:21:46,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-07 17:21:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-04-07 17:21:46,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:21:46,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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-07 17:21:46,554 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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-07 17:21:46,554 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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-07 17:21:46,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:46,555 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-07 17:21:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-07 17:21:46,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:21:46,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:21:46,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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 45 states. [2022-04-07 17:21:46,556 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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 45 states. [2022-04-07 17:21:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:46,557 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-07 17:21:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-07 17:21:46,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:21:46,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:21:46,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:21:46,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:21:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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-07 17:21:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-07 17:21:46,559 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 20 [2022-04-07 17:21:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:21:46,559 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-07 17:21:46,559 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:46,559 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-07 17:21:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 17:21:46,560 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:21:46,560 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:21:46,576 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-07 17:21:46,775 WARN L460 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-07 17:21:46,777 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:21:46,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:21:46,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1905741238, now seen corresponding path program 2 times [2022-04-07 17:21:46,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:21:46,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621119839] [2022-04-07 17:21:46,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:21:46,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:21:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:46,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:21:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:46,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {747#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {738#true} is VALID [2022-04-07 17:21:46,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-07 17:21:46,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {738#true} {738#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-07 17:21:46,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {747#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:21:46,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {738#true} is VALID [2022-04-07 17:21:46,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-07 17:21:46,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-07 17:21:46,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-07 17:21:46,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {743#(= main_~x~0 0)} is VALID [2022-04-07 17:21:46,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {743#(= main_~x~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {743#(= main_~x~0 0)} is VALID [2022-04-07 17:21:46,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {743#(= main_~x~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {743#(= main_~x~0 0)} is VALID [2022-04-07 17:21:46,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {743#(= main_~x~0 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {744#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:21:46,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {744#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {744#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:21:46,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {744#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {744#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:21:46,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {744#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {745#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:21:46,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {745#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {745#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:21:46,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {745#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {745#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:21:46,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {745#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {746#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-07 17:21:46,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {746#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {746#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-07 17:21:46,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {746#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {739#false} is VALID [2022-04-07 17:21:46,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {739#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {739#false} is VALID [2022-04-07 17:21:46,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {739#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {739#false} is VALID [2022-04-07 17:21:46,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {739#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {739#false} is VALID [2022-04-07 17:21:46,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {739#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {739#false} is VALID [2022-04-07 17:21:46,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {739#false} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {739#false} is VALID [2022-04-07 17:21:46,878 INFO L272 TraceCheckUtils]: 22: Hoare triple {739#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {739#false} is VALID [2022-04-07 17:21:46,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {739#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {739#false} is VALID [2022-04-07 17:21:46,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {739#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {739#false} is VALID [2022-04-07 17:21:46,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {739#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {739#false} is VALID [2022-04-07 17:21:46,878 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 17:21:46,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:21:46,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621119839] [2022-04-07 17:21:46,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621119839] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:21:46,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126141464] [2022-04-07 17:21:46,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 17:21:46,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:21:46,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:21:46,879 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-07 17:21:46,884 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-07 17:21:46,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 17:21:46,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 17:21:46,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 17:21:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:46,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:21:47,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-07 17:21:47,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {738#true} is VALID [2022-04-07 17:21:47,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-07 17:21:47,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-07 17:21:47,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-07 17:21:47,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {766#(= main_~y~0 0)} is VALID [2022-04-07 17:21:47,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {766#(= main_~y~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {766#(= main_~y~0 0)} is VALID [2022-04-07 17:21:47,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {766#(= main_~y~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {773#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-07 17:21:47,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {773#(= (+ (- 1) main_~y~0) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {773#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-07 17:21:47,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {773#(= (+ (- 1) main_~y~0) 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {773#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-07 17:21:47,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {773#(= (+ (- 1) main_~y~0) 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {783#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-07 17:21:47,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#(= (+ (- 2) main_~y~0) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {783#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-07 17:21:47,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {783#(= (+ (- 2) main_~y~0) 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {783#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-07 17:21:47,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#(= (+ (- 2) main_~y~0) 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {793#(= (+ main_~y~0 (- 3)) 0)} is VALID [2022-04-07 17:21:47,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {793#(= (+ main_~y~0 (- 3)) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {793#(= (+ main_~y~0 (- 3)) 0)} is VALID [2022-04-07 17:21:47,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {793#(= (+ main_~y~0 (- 3)) 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {793#(= (+ main_~y~0 (- 3)) 0)} is VALID [2022-04-07 17:21:47,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {793#(= (+ main_~y~0 (- 3)) 0)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {783#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-07 17:21:47,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {783#(= (+ (- 2) main_~y~0) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {783#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-07 17:21:47,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#(= (+ (- 2) main_~y~0) 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {783#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-07 17:21:47,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#(= (+ (- 2) main_~y~0) 0)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {773#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-07 17:21:47,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {773#(= (+ (- 1) main_~y~0) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {773#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-07 17:21:47,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {773#(= (+ (- 1) main_~y~0) 0)} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {773#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-07 17:21:47,048 INFO L272 TraceCheckUtils]: 22: Hoare triple {773#(= (+ (- 1) main_~y~0) 0)} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {821#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:21:47,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {821#(<= 1 |__VERIFIER_assert_#in~cond|)} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {825#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:21:47,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {825#(<= 1 __VERIFIER_assert_~cond)} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {739#false} is VALID [2022-04-07 17:21:47,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {739#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {739#false} is VALID [2022-04-07 17:21:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-07 17:21:47,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:21:47,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {739#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {739#false} is VALID [2022-04-07 17:21:47,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {825#(<= 1 __VERIFIER_assert_~cond)} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {739#false} is VALID [2022-04-07 17:21:47,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {821#(<= 1 |__VERIFIER_assert_#in~cond|)} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {825#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:21:47,198 INFO L272 TraceCheckUtils]: 22: Hoare triple {841#(not (= (mod main_~y~0 4294967296) 0))} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {821#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:21:47,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {841#(not (= (mod main_~y~0 4294967296) 0))} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {841#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:21:47,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {841#(not (= (mod main_~y~0 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {841#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:21:47,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {851#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {841#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:21:47,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {851#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {851#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-07 17:21:47,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {851#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {851#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-07 17:21:47,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {861#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {851#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-07 17:21:47,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {861#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {861#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-07 17:21:47,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {861#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {861#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-07 17:21:47,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {851#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {861#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-07 17:21:47,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {851#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {851#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-07 17:21:47,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {851#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {851#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-07 17:21:47,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {841#(not (= (mod main_~y~0 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {851#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-07 17:21:47,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {841#(not (= (mod main_~y~0 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {841#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:21:47,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {841#(not (= (mod main_~y~0 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {841#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:21:47,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {889#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {841#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:21:47,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {889#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {889#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-07 17:21:47,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {889#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-07 17:21:47,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-07 17:21:47,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-07 17:21:47,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-07 17:21:47,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {738#true} is VALID [2022-04-07 17:21:47,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {738#true} is VALID [2022-04-07 17:21:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-07 17:21:47,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126141464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:21:47,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:21:47,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2022-04-07 17:21:47,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912442922] [2022-04-07 17:21:47,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:21:47,210 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-07 17:21:47,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:21:47,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:47,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:21:47,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-07 17:21:47,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:21:47,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-07 17:21:47,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-07 17:21:47,266 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:48,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:48,074 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2022-04-07 17:21:48,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-07 17:21:48,074 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-07 17:21:48,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:21:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 79 transitions. [2022-04-07 17:21:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 79 transitions. [2022-04-07 17:21:48,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 79 transitions. [2022-04-07 17:21:48,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:21:48,160 INFO L225 Difference]: With dead ends: 85 [2022-04-07 17:21:48,160 INFO L226 Difference]: Without dead ends: 80 [2022-04-07 17:21:48,160 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2022-04-07 17:21:48,161 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 17:21:48,161 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 74 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 17:21:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-07 17:21:48,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2022-04-07 17:21:48,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:21:48,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 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-07 17:21:48,164 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 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-07 17:21:48,165 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 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-07 17:21:48,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:48,166 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2022-04-07 17:21:48,167 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2022-04-07 17:21:48,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:21:48,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:21:48,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 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 80 states. [2022-04-07 17:21:48,167 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 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 80 states. [2022-04-07 17:21:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:48,169 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2022-04-07 17:21:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2022-04-07 17:21:48,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:21:48,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:21:48,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:21:48,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:21:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 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-07 17:21:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-04-07 17:21:48,171 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 26 [2022-04-07 17:21:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:21:48,171 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-04-07 17:21:48,171 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:21:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-04-07 17:21:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 17:21:48,172 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:21:48,172 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:21:48,190 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-07 17:21:48,383 WARN L460 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-07 17:21:48,383 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:21:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:21:48,384 INFO L85 PathProgramCache]: Analyzing trace with hash 81509943, now seen corresponding path program 3 times [2022-04-07 17:21:48,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:21:48,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332303633] [2022-04-07 17:21:48,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:21:48,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:21:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:48,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:21:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:48,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {1267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1257#true} is VALID [2022-04-07 17:21:48,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {1257#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:48,498 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1257#true} {1257#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:48,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {1257#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:21:48,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {1267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1257#true} is VALID [2022-04-07 17:21:48,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:48,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:48,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {1257#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:48,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {1257#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1262#(= main_~x~0 0)} is VALID [2022-04-07 17:21:48,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {1262#(= main_~x~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1262#(= main_~x~0 0)} is VALID [2022-04-07 17:21:48,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {1262#(= main_~x~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1262#(= main_~x~0 0)} is VALID [2022-04-07 17:21:48,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {1262#(= main_~x~0 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1263#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:21:48,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {1263#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1263#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:21:48,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {1263#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1263#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:21:48,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {1263#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1264#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:21:48,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {1264#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1264#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:21:48,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {1264#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1264#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:21:48,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {1264#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1265#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:21:48,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {1265#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1265#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:21:48,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {1265#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1265#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:21:48,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {1265#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1266#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:21:48,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {1266#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1266#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:21:48,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {1266#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1258#false} is VALID [2022-04-07 17:21:48,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {1258#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1258#false} is VALID [2022-04-07 17:21:48,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {1258#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1258#false} is VALID [2022-04-07 17:21:48,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {1258#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1258#false} is VALID [2022-04-07 17:21:48,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {1258#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1258#false} is VALID [2022-04-07 17:21:48,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {1258#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1258#false} is VALID [2022-04-07 17:21:48,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {1258#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1258#false} is VALID [2022-04-07 17:21:48,505 INFO L290 TraceCheckUtils]: 26: Hoare triple {1258#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1258#false} is VALID [2022-04-07 17:21:48,505 INFO L290 TraceCheckUtils]: 27: Hoare triple {1258#false} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {1258#false} is VALID [2022-04-07 17:21:48,505 INFO L272 TraceCheckUtils]: 28: Hoare triple {1258#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {1258#false} is VALID [2022-04-07 17:21:48,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {1258#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1258#false} is VALID [2022-04-07 17:21:48,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {1258#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1258#false} is VALID [2022-04-07 17:21:48,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {1258#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1258#false} is VALID [2022-04-07 17:21:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 37 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-07 17:21:48,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:21:48,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332303633] [2022-04-07 17:21:48,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332303633] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:21:48,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504860023] [2022-04-07 17:21:48,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 17:21:48,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:21:48,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:21:48,519 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-07 17:21:48,520 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-07 17:21:48,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-04-07 17:21:48,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 17:21:48,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 17:21:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:48,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:21:48,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {1257#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:48,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {1257#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1257#true} is VALID [2022-04-07 17:21:48,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:48,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:48,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {1257#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:48,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {1257#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1257#true} is VALID [2022-04-07 17:21:48,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {1257#true} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:48,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {1257#true} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1257#true} is VALID [2022-04-07 17:21:48,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {1257#true} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1257#true} is VALID [2022-04-07 17:21:48,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {1257#true} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:48,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {1257#true} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1257#true} is VALID [2022-04-07 17:21:48,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {1257#true} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1257#true} is VALID [2022-04-07 17:21:48,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {1257#true} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:48,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {1257#true} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1257#true} is VALID [2022-04-07 17:21:48,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {1257#true} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1257#true} is VALID [2022-04-07 17:21:48,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {1257#true} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:48,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {1257#true} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1319#(< (mod main_~x~0 4294967296) 500000)} is VALID [2022-04-07 17:21:48,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {1319#(< (mod main_~x~0 4294967296) 500000)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1323#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2022-04-07 17:21:48,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {1323#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1323#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2022-04-07 17:21:48,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {1323#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1323#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2022-04-07 17:21:48,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {1323#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1333#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} is VALID [2022-04-07 17:21:48,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {1333#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1333#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} is VALID [2022-04-07 17:21:48,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {1333#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1333#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} is VALID [2022-04-07 17:21:48,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {1333#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1343#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} is VALID [2022-04-07 17:21:48,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {1343#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1343#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} is VALID [2022-04-07 17:21:48,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {1343#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1343#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} is VALID [2022-04-07 17:21:48,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {1343#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1353#(< (mod (+ 4294967292 main_~x~0) 4294967296) 500000)} is VALID [2022-04-07 17:21:48,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {1353#(< (mod (+ 4294967292 main_~x~0) 4294967296) 500000)} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {1258#false} is VALID [2022-04-07 17:21:48,874 INFO L272 TraceCheckUtils]: 28: Hoare triple {1258#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {1258#false} is VALID [2022-04-07 17:21:48,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {1258#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1258#false} is VALID [2022-04-07 17:21:48,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {1258#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1258#false} is VALID [2022-04-07 17:21:48,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {1258#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1258#false} is VALID [2022-04-07 17:21:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 17:21:48,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:21:49,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {1258#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1258#false} is VALID [2022-04-07 17:21:49,167 INFO L290 TraceCheckUtils]: 30: Hoare triple {1258#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1258#false} is VALID [2022-04-07 17:21:49,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {1258#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1258#false} is VALID [2022-04-07 17:21:49,167 INFO L272 TraceCheckUtils]: 28: Hoare triple {1258#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {1258#false} is VALID [2022-04-07 17:21:49,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {1381#(< (mod main_~x~0 4294967296) 1000000)} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {1258#false} is VALID [2022-04-07 17:21:49,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {1385#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1381#(< (mod main_~x~0 4294967296) 1000000)} is VALID [2022-04-07 17:21:49,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {1385#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1385#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} is VALID [2022-04-07 17:21:49,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {1385#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1385#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} is VALID [2022-04-07 17:21:49,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {1395#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1385#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} is VALID [2022-04-07 17:21:49,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {1395#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1395#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} is VALID [2022-04-07 17:21:49,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {1395#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1395#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} is VALID [2022-04-07 17:21:49,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {1405#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1395#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} is VALID [2022-04-07 17:21:49,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {1405#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1405#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} is VALID [2022-04-07 17:21:49,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {1405#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1405#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} is VALID [2022-04-07 17:21:49,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {1415#(< (mod (+ main_~x~0 4) 4294967296) 1000000)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1405#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} is VALID [2022-04-07 17:21:49,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {1257#true} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1415#(< (mod (+ main_~x~0 4) 4294967296) 1000000)} is VALID [2022-04-07 17:21:49,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {1257#true} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:49,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {1257#true} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1257#true} is VALID [2022-04-07 17:21:49,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {1257#true} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1257#true} is VALID [2022-04-07 17:21:49,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {1257#true} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:49,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {1257#true} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1257#true} is VALID [2022-04-07 17:21:49,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {1257#true} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1257#true} is VALID [2022-04-07 17:21:49,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {1257#true} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:49,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {1257#true} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1257#true} is VALID [2022-04-07 17:21:49,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {1257#true} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1257#true} is VALID [2022-04-07 17:21:49,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {1257#true} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:49,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {1257#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1257#true} is VALID [2022-04-07 17:21:49,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {1257#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:49,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:49,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:49,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {1257#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1257#true} is VALID [2022-04-07 17:21:49,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {1257#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-07 17:21:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 17:21:49,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504860023] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:21:49,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:21:49,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-04-07 17:21:49,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126629714] [2022-04-07 17:21:49,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:21:49,175 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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 32 [2022-04-07 17:21:49,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:21:49,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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-07 17:21:49,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:21:49,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 17:21:49,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:21:49,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 17:21:49,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-04-07 17:21:49,233 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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-07 17:21:50,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:50,874 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-07 17:21:50,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-07 17:21:50,875 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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 32 [2022-04-07 17:21:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:21:50,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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-07 17:21:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 89 transitions. [2022-04-07 17:21:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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-07 17:21:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 89 transitions. [2022-04-07 17:21:50,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 89 transitions. [2022-04-07 17:21:51,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:21:51,046 INFO L225 Difference]: With dead ends: 109 [2022-04-07 17:21:51,046 INFO L226 Difference]: Without dead ends: 109 [2022-04-07 17:21:51,046 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=477, Invalid=1083, Unknown=0, NotChecked=0, Total=1560 [2022-04-07 17:21:51,047 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 128 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 17:21:51,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 58 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 17:21:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-07 17:21:51,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 57. [2022-04-07 17:21:51,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:21:51,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 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-07 17:21:51,052 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 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-07 17:21:51,052 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 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-07 17:21:51,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:51,054 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-07 17:21:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-07 17:21:51,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:21:51,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:21:51,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 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 109 states. [2022-04-07 17:21:51,055 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 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 109 states. [2022-04-07 17:21:51,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:21:51,057 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-07 17:21:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-07 17:21:51,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:21:51,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:21:51,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:21:51,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:21:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 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-07 17:21:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2022-04-07 17:21:51,059 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 32 [2022-04-07 17:21:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:21:51,059 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2022-04-07 17:21:51,059 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 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-07 17:21:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2022-04-07 17:21:51,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-07 17:21:51,060 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:21:51,060 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:21:51,067 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-07 17:21:51,263 WARN L460 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-07 17:21:51,263 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:21:51,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:21:51,264 INFO L85 PathProgramCache]: Analyzing trace with hash -912098025, now seen corresponding path program 4 times [2022-04-07 17:21:51,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:21:51,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3865763] [2022-04-07 17:21:51,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:21:51,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:21:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:51,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:21:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:51,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {1918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1906#true} is VALID [2022-04-07 17:21:51,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {1906#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1906#true} is VALID [2022-04-07 17:21:51,437 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1906#true} {1906#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1906#true} is VALID [2022-04-07 17:21:51,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {1906#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:21:51,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {1918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1906#true} is VALID [2022-04-07 17:21:51,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {1906#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1906#true} is VALID [2022-04-07 17:21:51,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1906#true} {1906#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1906#true} is VALID [2022-04-07 17:21:51,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {1906#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1906#true} is VALID [2022-04-07 17:21:51,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {1906#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1911#(= main_~x~0 0)} is VALID [2022-04-07 17:21:51,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {1911#(= main_~x~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1911#(= main_~x~0 0)} is VALID [2022-04-07 17:21:51,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {1911#(= main_~x~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1911#(= main_~x~0 0)} is VALID [2022-04-07 17:21:51,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {1911#(= main_~x~0 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:21:51,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {1912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:21:51,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {1912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:21:51,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {1912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:21:51,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {1913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:21:51,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {1913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:21:51,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {1913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1914#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:21:51,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {1914#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1914#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:21:51,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {1914#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1914#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:21:51,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {1914#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:21:51,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {1915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:21:51,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {1915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:21:51,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {1915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1916#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:21:51,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {1916#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1916#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:21:51,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {1916#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1916#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:21:51,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {1916#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1917#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-07 17:21:51,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {1917#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1917#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-07 17:21:51,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {1917#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:51,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {1907#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1907#false} is VALID [2022-04-07 17:21:51,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {1907#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:51,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {1907#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:51,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {1907#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1907#false} is VALID [2022-04-07 17:21:51,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {1907#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:51,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {1907#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:51,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {1907#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1907#false} is VALID [2022-04-07 17:21:51,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {1907#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:51,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {1907#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:51,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {1907#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1907#false} is VALID [2022-04-07 17:21:51,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {1907#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:51,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {1907#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:51,447 INFO L290 TraceCheckUtils]: 38: Hoare triple {1907#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1907#false} is VALID [2022-04-07 17:21:51,447 INFO L290 TraceCheckUtils]: 39: Hoare triple {1907#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:51,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {1907#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:51,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {1907#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1907#false} is VALID [2022-04-07 17:21:51,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {1907#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:51,448 INFO L290 TraceCheckUtils]: 43: Hoare triple {1907#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:51,448 INFO L290 TraceCheckUtils]: 44: Hoare triple {1907#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1907#false} is VALID [2022-04-07 17:21:51,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {1907#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:51,448 INFO L290 TraceCheckUtils]: 46: Hoare triple {1907#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:51,448 INFO L290 TraceCheckUtils]: 47: Hoare triple {1907#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1907#false} is VALID [2022-04-07 17:21:51,448 INFO L290 TraceCheckUtils]: 48: Hoare triple {1907#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:51,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {1907#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:51,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {1907#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1907#false} is VALID [2022-04-07 17:21:51,448 INFO L290 TraceCheckUtils]: 51: Hoare triple {1907#false} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:51,448 INFO L272 TraceCheckUtils]: 52: Hoare triple {1907#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:51,449 INFO L290 TraceCheckUtils]: 53: Hoare triple {1907#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1907#false} is VALID [2022-04-07 17:21:51,449 INFO L290 TraceCheckUtils]: 54: Hoare triple {1907#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:51,449 INFO L290 TraceCheckUtils]: 55: Hoare triple {1907#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:51,449 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 173 proven. 57 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-07 17:21:51,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:21:51,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3865763] [2022-04-07 17:21:51,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3865763] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:21:51,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233249705] [2022-04-07 17:21:51,449 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 17:21:51,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:21:51,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:21:51,450 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-07 17:21:51,451 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-07 17:21:51,509 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 17:21:51,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 17:21:51,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-07 17:21:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:21:51,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:21:52,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {1906#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1906#true} is VALID [2022-04-07 17:21:52,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {1906#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1906#true} is VALID [2022-04-07 17:21:52,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {1906#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1906#true} is VALID [2022-04-07 17:21:52,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1906#true} {1906#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1906#true} is VALID [2022-04-07 17:21:52,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {1906#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1906#true} is VALID [2022-04-07 17:21:52,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {1906#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1911#(= main_~x~0 0)} is VALID [2022-04-07 17:21:52,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {1911#(= main_~x~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1911#(= main_~x~0 0)} is VALID [2022-04-07 17:21:52,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {1911#(= main_~x~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1911#(= main_~x~0 0)} is VALID [2022-04-07 17:21:52,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {1911#(= main_~x~0 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:21:52,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {1912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:21:52,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {1912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:21:52,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {1912#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:21:52,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {1913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:21:52,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {1913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:21:52,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {1913#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1914#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:21:52,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {1914#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1914#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:21:52,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {1914#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1914#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:21:52,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {1914#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:21:52,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {1915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:21:52,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {1915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:21:52,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {1915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1916#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:21:52,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {1916#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1916#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:21:52,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {1916#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {1916#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:21:52,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {1916#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1991#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:21:52,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {1991#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1991#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:21:52,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {1991#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1991#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:21:52,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {1991#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2001#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 17:21:52,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {2001#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2001#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 17:21:52,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {2001#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2001#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 17:21:52,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {2001#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2011#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 17:21:52,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {2011#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2011#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 17:21:52,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {2011#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2011#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 17:21:52,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {2011#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2021#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 17:21:52,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {2021#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2021#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 17:21:52,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {2021#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2021#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 17:21:52,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {2021#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2031#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 17:21:52,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {2031#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2031#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 17:21:52,050 INFO L290 TraceCheckUtils]: 37: Hoare triple {2031#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2031#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 17:21:52,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {2031#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2041#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 17:21:52,051 INFO L290 TraceCheckUtils]: 39: Hoare triple {2041#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2041#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 17:21:52,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {2041#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2041#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 17:21:52,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {2041#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2051#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 17:21:52,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {2051#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2051#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 17:21:52,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {2051#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:52,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {1907#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1907#false} is VALID [2022-04-07 17:21:52,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {1907#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:52,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {1907#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:52,053 INFO L290 TraceCheckUtils]: 47: Hoare triple {1907#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1907#false} is VALID [2022-04-07 17:21:52,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {1907#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:52,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {1907#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:52,054 INFO L290 TraceCheckUtils]: 50: Hoare triple {1907#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1907#false} is VALID [2022-04-07 17:21:52,054 INFO L290 TraceCheckUtils]: 51: Hoare triple {1907#false} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:52,054 INFO L272 TraceCheckUtils]: 52: Hoare triple {1907#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:52,054 INFO L290 TraceCheckUtils]: 53: Hoare triple {1907#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1907#false} is VALID [2022-04-07 17:21:52,054 INFO L290 TraceCheckUtils]: 54: Hoare triple {1907#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:52,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {1907#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 101 proven. 222 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-07 17:21:52,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:21:52,830 INFO L290 TraceCheckUtils]: 55: Hoare triple {1907#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:52,831 INFO L290 TraceCheckUtils]: 54: Hoare triple {1907#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:52,831 INFO L290 TraceCheckUtils]: 53: Hoare triple {1907#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1907#false} is VALID [2022-04-07 17:21:52,831 INFO L272 TraceCheckUtils]: 52: Hoare triple {1907#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:52,831 INFO L290 TraceCheckUtils]: 51: Hoare triple {1907#false} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:52,831 INFO L290 TraceCheckUtils]: 50: Hoare triple {1907#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1907#false} is VALID [2022-04-07 17:21:52,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {1907#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:52,831 INFO L290 TraceCheckUtils]: 48: Hoare triple {1907#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:52,831 INFO L290 TraceCheckUtils]: 47: Hoare triple {1907#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1907#false} is VALID [2022-04-07 17:21:52,831 INFO L290 TraceCheckUtils]: 46: Hoare triple {1907#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:52,831 INFO L290 TraceCheckUtils]: 45: Hoare triple {1907#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1907#false} is VALID [2022-04-07 17:21:52,831 INFO L290 TraceCheckUtils]: 44: Hoare triple {1907#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {1907#false} is VALID [2022-04-07 17:21:52,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {2130#(< (mod main_~x~0 4294967296) 500000)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {1907#false} is VALID [2022-04-07 17:21:52,832 INFO L290 TraceCheckUtils]: 42: Hoare triple {2134#(or (< (mod main_~x~0 4294967296) 500000) (not (< (mod main_~x~0 4294967296) 1000000)))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2130#(< (mod main_~x~0 4294967296) 500000)} is VALID [2022-04-07 17:21:52,833 INFO L290 TraceCheckUtils]: 41: Hoare triple {2138#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2134#(or (< (mod main_~x~0 4294967296) 500000) (not (< (mod main_~x~0 4294967296) 1000000)))} is VALID [2022-04-07 17:21:52,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {2138#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2138#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {2138#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2138#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {2148#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2138#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,835 INFO L290 TraceCheckUtils]: 37: Hoare triple {2148#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2148#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,836 INFO L290 TraceCheckUtils]: 36: Hoare triple {2148#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2148#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {2158#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2148#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {2158#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2158#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} is VALID [2022-04-07 17:21:52,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {2158#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2158#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} is VALID [2022-04-07 17:21:52,838 INFO L290 TraceCheckUtils]: 32: Hoare triple {2168#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2158#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} is VALID [2022-04-07 17:21:52,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {2168#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2168#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} is VALID [2022-04-07 17:21:52,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {2168#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2168#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} is VALID [2022-04-07 17:21:52,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {2178#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2168#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} is VALID [2022-04-07 17:21:52,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {2178#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2178#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {2178#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2178#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {2188#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2178#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {2188#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2188#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {2188#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2188#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {2198#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2188#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {2198#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2198#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} is VALID [2022-04-07 17:21:52,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {2198#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2198#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} is VALID [2022-04-07 17:21:52,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {2208#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2198#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} is VALID [2022-04-07 17:21:52,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {2208#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2208#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} is VALID [2022-04-07 17:21:52,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {2208#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2208#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} is VALID [2022-04-07 17:21:52,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {2218#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2208#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} is VALID [2022-04-07 17:21:52,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {2218#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2218#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {2218#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2218#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {2228#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2218#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {2228#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2228#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {2228#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2228#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {2238#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2228#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {2238#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2238#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {2238#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2238#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {2248#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2238#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {2248#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2248#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {2248#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2248#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {1906#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2248#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} is VALID [2022-04-07 17:21:52,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {1906#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1906#true} is VALID [2022-04-07 17:21:52,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1906#true} {1906#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1906#true} is VALID [2022-04-07 17:21:52,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {1906#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1906#true} is VALID [2022-04-07 17:21:52,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {1906#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1906#true} is VALID [2022-04-07 17:21:52,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {1906#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1906#true} is VALID [2022-04-07 17:21:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 101 proven. 222 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-07 17:21:52,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233249705] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:21:52,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:21:52,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 16] total 31 [2022-04-07 17:21:52,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50867915] [2022-04-07 17:21:52,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:21:52,863 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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 56 [2022-04-07 17:21:52,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:21:52,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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-07 17:21:52,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:21:52,937 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-07 17:21:52,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:21:52,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-07 17:21:52,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2022-04-07 17:21:52,939 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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-07 17:22:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:22:04,408 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-04-07 17:22:04,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-07 17:22:04,408 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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 56 [2022-04-07 17:22:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:22:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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-07 17:22:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 113 transitions. [2022-04-07 17:22:04,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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-07 17:22:04,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 113 transitions. [2022-04-07 17:22:04,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 113 transitions. [2022-04-07 17:22:04,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:22:04,552 INFO L225 Difference]: With dead ends: 117 [2022-04-07 17:22:04,552 INFO L226 Difference]: Without dead ends: 117 [2022-04-07 17:22:04,553 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=924, Invalid=2382, Unknown=0, NotChecked=0, Total=3306 [2022-04-07 17:22:04,553 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 245 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-07 17:22:04,553 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 79 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-07 17:22:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-07 17:22:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-04-07 17:22:04,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:22:04,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 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-07 17:22:04,557 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 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-07 17:22:04,558 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 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-07 17:22:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:22:04,560 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-04-07 17:22:04,560 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2022-04-07 17:22:04,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:22:04,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:22:04,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-07 17:22:04,561 INFO L87 Difference]: Start difference. First operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-07 17:22:04,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:22:04,563 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-04-07 17:22:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2022-04-07 17:22:04,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:22:04,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:22:04,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:22:04,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:22:04,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 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-07 17:22:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2022-04-07 17:22:04,565 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 56 [2022-04-07 17:22:04,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:22:04,565 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2022-04-07 17:22:04,566 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 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-07 17:22:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2022-04-07 17:22:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-07 17:22:04,572 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:22:04,573 INFO L499 BasicCegarLoop]: trace histogram [35, 35, 26, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:22:04,594 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-07 17:22:04,789 WARN L460 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-07 17:22:04,789 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:22:04,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:22:04,790 INFO L85 PathProgramCache]: Analyzing trace with hash -2051530473, now seen corresponding path program 5 times [2022-04-07 17:22:04,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:22:04,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301372268] [2022-04-07 17:22:04,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:22:04,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:22:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:22:05,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:22:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:22:05,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {2829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2797#true} is VALID [2022-04-07 17:22:05,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {2797#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#true} is VALID [2022-04-07 17:22:05,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2797#true} {2797#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#true} is VALID [2022-04-07 17:22:05,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {2797#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:22:05,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {2829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2797#true} is VALID [2022-04-07 17:22:05,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {2797#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#true} is VALID [2022-04-07 17:22:05,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2797#true} {2797#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#true} is VALID [2022-04-07 17:22:05,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {2797#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#true} is VALID [2022-04-07 17:22:05,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {2797#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2802#(= main_~x~0 0)} is VALID [2022-04-07 17:22:05,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {2802#(= main_~x~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2802#(= main_~x~0 0)} is VALID [2022-04-07 17:22:05,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {2802#(= main_~x~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2802#(= main_~x~0 0)} is VALID [2022-04-07 17:22:05,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {2802#(= main_~x~0 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:22:05,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {2803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:22:05,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {2803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:22:05,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {2803#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:22:05,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {2804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:22:05,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {2804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:22:05,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {2804#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:22:05,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {2805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:22:05,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {2805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:22:05,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {2805#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2806#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:22:05,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {2806#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2806#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:22:05,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {2806#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2806#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:22:05,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {2806#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2807#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:22:05,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {2807#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2807#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:22:05,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {2807#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2807#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:22:05,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {2807#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2808#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:22:05,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {2808#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2808#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:22:05,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {2808#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2808#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:22:05,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {2808#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2809#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 17:22:05,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {2809#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2809#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 17:22:05,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {2809#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2809#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 17:22:05,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {2809#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2810#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 17:22:05,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {2810#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2810#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 17:22:05,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {2810#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2810#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 17:22:05,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {2810#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2811#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 17:22:05,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {2811#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2811#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 17:22:05,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {2811#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2811#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 17:22:05,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {2811#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2812#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 17:22:05,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {2812#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2812#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 17:22:05,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {2812#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2812#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 17:22:05,495 INFO L290 TraceCheckUtils]: 38: Hoare triple {2812#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2813#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 17:22:05,495 INFO L290 TraceCheckUtils]: 39: Hoare triple {2813#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2813#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 17:22:05,495 INFO L290 TraceCheckUtils]: 40: Hoare triple {2813#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2813#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 17:22:05,496 INFO L290 TraceCheckUtils]: 41: Hoare triple {2813#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2814#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 17:22:05,496 INFO L290 TraceCheckUtils]: 42: Hoare triple {2814#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2814#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 17:22:05,496 INFO L290 TraceCheckUtils]: 43: Hoare triple {2814#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2814#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 17:22:05,497 INFO L290 TraceCheckUtils]: 44: Hoare triple {2814#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2815#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 17:22:05,497 INFO L290 TraceCheckUtils]: 45: Hoare triple {2815#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2815#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 17:22:05,497 INFO L290 TraceCheckUtils]: 46: Hoare triple {2815#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2815#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 17:22:05,498 INFO L290 TraceCheckUtils]: 47: Hoare triple {2815#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2816#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 17:22:05,498 INFO L290 TraceCheckUtils]: 48: Hoare triple {2816#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2816#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 17:22:05,498 INFO L290 TraceCheckUtils]: 49: Hoare triple {2816#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2816#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 17:22:05,499 INFO L290 TraceCheckUtils]: 50: Hoare triple {2816#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2817#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 17:22:05,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {2817#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2817#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 17:22:05,500 INFO L290 TraceCheckUtils]: 52: Hoare triple {2817#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2817#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 17:22:05,500 INFO L290 TraceCheckUtils]: 53: Hoare triple {2817#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2818#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 17:22:05,500 INFO L290 TraceCheckUtils]: 54: Hoare triple {2818#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2818#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 17:22:05,501 INFO L290 TraceCheckUtils]: 55: Hoare triple {2818#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2818#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 17:22:05,501 INFO L290 TraceCheckUtils]: 56: Hoare triple {2818#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2819#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 17:22:05,501 INFO L290 TraceCheckUtils]: 57: Hoare triple {2819#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2819#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 17:22:05,502 INFO L290 TraceCheckUtils]: 58: Hoare triple {2819#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2819#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 17:22:05,502 INFO L290 TraceCheckUtils]: 59: Hoare triple {2819#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2820#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 17:22:05,502 INFO L290 TraceCheckUtils]: 60: Hoare triple {2820#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2820#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 17:22:05,503 INFO L290 TraceCheckUtils]: 61: Hoare triple {2820#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2820#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 17:22:05,503 INFO L290 TraceCheckUtils]: 62: Hoare triple {2820#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2821#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 17:22:05,503 INFO L290 TraceCheckUtils]: 63: Hoare triple {2821#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2821#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 17:22:05,504 INFO L290 TraceCheckUtils]: 64: Hoare triple {2821#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2821#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 17:22:05,504 INFO L290 TraceCheckUtils]: 65: Hoare triple {2821#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2822#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 17:22:05,504 INFO L290 TraceCheckUtils]: 66: Hoare triple {2822#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2822#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 17:22:05,505 INFO L290 TraceCheckUtils]: 67: Hoare triple {2822#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2822#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 17:22:05,505 INFO L290 TraceCheckUtils]: 68: Hoare triple {2822#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2823#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 17:22:05,505 INFO L290 TraceCheckUtils]: 69: Hoare triple {2823#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 17:22:05,506 INFO L290 TraceCheckUtils]: 70: Hoare triple {2823#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2823#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 17:22:05,506 INFO L290 TraceCheckUtils]: 71: Hoare triple {2823#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2824#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 17:22:05,507 INFO L290 TraceCheckUtils]: 72: Hoare triple {2824#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2824#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 17:22:05,507 INFO L290 TraceCheckUtils]: 73: Hoare triple {2824#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2824#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 17:22:05,507 INFO L290 TraceCheckUtils]: 74: Hoare triple {2824#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2825#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 17:22:05,508 INFO L290 TraceCheckUtils]: 75: Hoare triple {2825#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2825#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 17:22:05,508 INFO L290 TraceCheckUtils]: 76: Hoare triple {2825#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2825#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 17:22:05,508 INFO L290 TraceCheckUtils]: 77: Hoare triple {2825#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2826#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 17:22:05,509 INFO L290 TraceCheckUtils]: 78: Hoare triple {2826#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2826#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 17:22:05,509 INFO L290 TraceCheckUtils]: 79: Hoare triple {2826#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2826#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 17:22:05,509 INFO L290 TraceCheckUtils]: 80: Hoare triple {2826#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2827#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-07 17:22:05,510 INFO L290 TraceCheckUtils]: 81: Hoare triple {2827#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2827#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-07 17:22:05,510 INFO L290 TraceCheckUtils]: 82: Hoare triple {2827#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2827#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-07 17:22:05,511 INFO L290 TraceCheckUtils]: 83: Hoare triple {2827#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2828#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-07 17:22:05,511 INFO L290 TraceCheckUtils]: 84: Hoare triple {2828#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2828#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 85: Hoare triple {2828#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 86: Hoare triple {2798#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 87: Hoare triple {2798#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 88: Hoare triple {2798#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 89: Hoare triple {2798#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 90: Hoare triple {2798#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 91: Hoare triple {2798#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 92: Hoare triple {2798#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 93: Hoare triple {2798#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 94: Hoare triple {2798#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 95: Hoare triple {2798#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 96: Hoare triple {2798#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 97: Hoare triple {2798#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 98: Hoare triple {2798#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 99: Hoare triple {2798#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 100: Hoare triple {2798#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 101: Hoare triple {2798#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2798#false} is VALID [2022-04-07 17:22:05,512 INFO L290 TraceCheckUtils]: 102: Hoare triple {2798#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2798#false} is VALID [2022-04-07 17:22:05,513 INFO L290 TraceCheckUtils]: 103: Hoare triple {2798#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2798#false} is VALID [2022-04-07 17:22:05,513 INFO L290 TraceCheckUtils]: 104: Hoare triple {2798#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2798#false} is VALID [2022-04-07 17:22:05,513 INFO L290 TraceCheckUtils]: 105: Hoare triple {2798#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2798#false} is VALID [2022-04-07 17:22:05,513 INFO L290 TraceCheckUtils]: 106: Hoare triple {2798#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2798#false} is VALID [2022-04-07 17:22:05,513 INFO L290 TraceCheckUtils]: 107: Hoare triple {2798#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2798#false} is VALID [2022-04-07 17:22:05,513 INFO L290 TraceCheckUtils]: 108: Hoare triple {2798#false} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2798#false} is VALID [2022-04-07 17:22:05,513 INFO L290 TraceCheckUtils]: 109: Hoare triple {2798#false} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {2798#false} is VALID [2022-04-07 17:22:05,513 INFO L290 TraceCheckUtils]: 110: Hoare triple {2798#false} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2798#false} is VALID [2022-04-07 17:22:05,513 INFO L290 TraceCheckUtils]: 111: Hoare triple {2798#false} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {2798#false} is VALID [2022-04-07 17:22:05,513 INFO L272 TraceCheckUtils]: 112: Hoare triple {2798#false} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {2798#false} is VALID [2022-04-07 17:22:05,513 INFO L290 TraceCheckUtils]: 113: Hoare triple {2798#false} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2798#false} is VALID [2022-04-07 17:22:05,513 INFO L290 TraceCheckUtils]: 114: Hoare triple {2798#false} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2798#false} is VALID [2022-04-07 17:22:05,513 INFO L290 TraceCheckUtils]: 115: Hoare triple {2798#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2798#false} is VALID [2022-04-07 17:22:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 693 proven. 1027 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-07 17:22:05,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:22:05,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301372268] [2022-04-07 17:22:05,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301372268] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:22:05,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807363189] [2022-04-07 17:22:05,515 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 17:22:05,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:22:05,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:22:05,516 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-07 17:22:05,517 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-07 17:22:12,980 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2022-04-07 17:22:12,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 17:22:12,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-07 17:22:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:22:13,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:22:14,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {2797#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#true} is VALID [2022-04-07 17:22:14,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {2797#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2797#true} is VALID [2022-04-07 17:22:14,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {2797#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#true} is VALID [2022-04-07 17:22:14,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2797#true} {2797#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#true} is VALID [2022-04-07 17:22:14,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {2797#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#true} is VALID [2022-04-07 17:22:14,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {2797#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2848#(= main_~y~0 0)} is VALID [2022-04-07 17:22:14,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {2848#(= main_~y~0 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2848#(= main_~y~0 0)} is VALID [2022-04-07 17:22:14,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {2848#(= main_~y~0 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2855#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-07 17:22:14,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {2855#(= (+ (- 1) main_~y~0) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2855#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-07 17:22:14,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {2855#(= (+ (- 1) main_~y~0) 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2855#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-07 17:22:14,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {2855#(= (+ (- 1) main_~y~0) 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2865#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-07 17:22:14,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {2865#(= (+ (- 2) main_~y~0) 0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2865#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-07 17:22:14,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {2865#(= (+ (- 2) main_~y~0) 0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2865#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-07 17:22:14,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {2865#(= (+ (- 2) main_~y~0) 0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2875#(= main_~y~0 3)} is VALID [2022-04-07 17:22:14,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {2875#(= main_~y~0 3)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2875#(= main_~y~0 3)} is VALID [2022-04-07 17:22:14,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {2875#(= main_~y~0 3)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2875#(= main_~y~0 3)} is VALID [2022-04-07 17:22:14,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {2875#(= main_~y~0 3)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2885#(= 3 (+ (- 1) main_~y~0))} is VALID [2022-04-07 17:22:14,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {2885#(= 3 (+ (- 1) main_~y~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2885#(= 3 (+ (- 1) main_~y~0))} is VALID [2022-04-07 17:22:14,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {2885#(= 3 (+ (- 1) main_~y~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2885#(= 3 (+ (- 1) main_~y~0))} is VALID [2022-04-07 17:22:14,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {2885#(= 3 (+ (- 1) main_~y~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2895#(= 5 main_~y~0)} is VALID [2022-04-07 17:22:14,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {2895#(= 5 main_~y~0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2895#(= 5 main_~y~0)} is VALID [2022-04-07 17:22:14,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {2895#(= 5 main_~y~0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2895#(= 5 main_~y~0)} is VALID [2022-04-07 17:22:14,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {2895#(= 5 main_~y~0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2905#(= main_~y~0 6)} is VALID [2022-04-07 17:22:14,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {2905#(= main_~y~0 6)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2905#(= main_~y~0 6)} is VALID [2022-04-07 17:22:14,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {2905#(= main_~y~0 6)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2905#(= main_~y~0 6)} is VALID [2022-04-07 17:22:14,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {2905#(= main_~y~0 6)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2915#(= 7 main_~y~0)} is VALID [2022-04-07 17:22:14,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {2915#(= 7 main_~y~0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2915#(= 7 main_~y~0)} is VALID [2022-04-07 17:22:14,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {2915#(= 7 main_~y~0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2915#(= 7 main_~y~0)} is VALID [2022-04-07 17:22:14,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {2915#(= 7 main_~y~0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2925#(and (< (mod main_~x~0 4294967296) 500000) (= main_~y~0 8))} is VALID [2022-04-07 17:22:14,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {2925#(and (< (mod main_~x~0 4294967296) 500000) (= main_~y~0 8))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2929#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 500000) (= main_~y~0 8))} is VALID [2022-04-07 17:22:14,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {2929#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 500000) (= main_~y~0 8))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2929#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 500000) (= main_~y~0 8))} is VALID [2022-04-07 17:22:14,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {2929#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 500000) (= main_~y~0 8))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2936#(= main_~y~0 9)} is VALID [2022-04-07 17:22:14,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {2936#(= main_~y~0 9)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2936#(= main_~y~0 9)} is VALID [2022-04-07 17:22:14,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {2936#(= main_~y~0 9)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2936#(= main_~y~0 9)} is VALID [2022-04-07 17:22:14,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {2936#(= main_~y~0 9)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2946#(= 9 (+ (- 1) main_~y~0))} is VALID [2022-04-07 17:22:14,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {2946#(= 9 (+ (- 1) main_~y~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2946#(= 9 (+ (- 1) main_~y~0))} is VALID [2022-04-07 17:22:14,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {2946#(= 9 (+ (- 1) main_~y~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2946#(= 9 (+ (- 1) main_~y~0))} is VALID [2022-04-07 17:22:14,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {2946#(= 9 (+ (- 1) main_~y~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2956#(= main_~y~0 11)} is VALID [2022-04-07 17:22:14,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {2956#(= main_~y~0 11)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2956#(= main_~y~0 11)} is VALID [2022-04-07 17:22:14,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {2956#(= main_~y~0 11)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2956#(= main_~y~0 11)} is VALID [2022-04-07 17:22:14,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {2956#(= main_~y~0 11)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2966#(= (+ (- 1) main_~y~0) 11)} is VALID [2022-04-07 17:22:14,681 INFO L290 TraceCheckUtils]: 41: Hoare triple {2966#(= (+ (- 1) main_~y~0) 11)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2966#(= (+ (- 1) main_~y~0) 11)} is VALID [2022-04-07 17:22:14,681 INFO L290 TraceCheckUtils]: 42: Hoare triple {2966#(= (+ (- 1) main_~y~0) 11)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2966#(= (+ (- 1) main_~y~0) 11)} is VALID [2022-04-07 17:22:14,682 INFO L290 TraceCheckUtils]: 43: Hoare triple {2966#(= (+ (- 1) main_~y~0) 11)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2976#(= main_~y~0 13)} is VALID [2022-04-07 17:22:14,682 INFO L290 TraceCheckUtils]: 44: Hoare triple {2976#(= main_~y~0 13)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2976#(= main_~y~0 13)} is VALID [2022-04-07 17:22:14,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {2976#(= main_~y~0 13)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2976#(= main_~y~0 13)} is VALID [2022-04-07 17:22:14,683 INFO L290 TraceCheckUtils]: 46: Hoare triple {2976#(= main_~y~0 13)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2986#(= (+ (- 1) main_~y~0) 13)} is VALID [2022-04-07 17:22:14,684 INFO L290 TraceCheckUtils]: 47: Hoare triple {2986#(= (+ (- 1) main_~y~0) 13)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2986#(= (+ (- 1) main_~y~0) 13)} is VALID [2022-04-07 17:22:14,684 INFO L290 TraceCheckUtils]: 48: Hoare triple {2986#(= (+ (- 1) main_~y~0) 13)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2986#(= (+ (- 1) main_~y~0) 13)} is VALID [2022-04-07 17:22:14,684 INFO L290 TraceCheckUtils]: 49: Hoare triple {2986#(= (+ (- 1) main_~y~0) 13)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {2996#(= main_~y~0 15)} is VALID [2022-04-07 17:22:14,685 INFO L290 TraceCheckUtils]: 50: Hoare triple {2996#(= main_~y~0 15)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {2996#(= main_~y~0 15)} is VALID [2022-04-07 17:22:14,685 INFO L290 TraceCheckUtils]: 51: Hoare triple {2996#(= main_~y~0 15)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2996#(= main_~y~0 15)} is VALID [2022-04-07 17:22:14,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {2996#(= main_~y~0 15)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3006#(= 15 (+ (- 1) main_~y~0))} is VALID [2022-04-07 17:22:14,686 INFO L290 TraceCheckUtils]: 53: Hoare triple {3006#(= 15 (+ (- 1) main_~y~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3006#(= 15 (+ (- 1) main_~y~0))} is VALID [2022-04-07 17:22:14,686 INFO L290 TraceCheckUtils]: 54: Hoare triple {3006#(= 15 (+ (- 1) main_~y~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3006#(= 15 (+ (- 1) main_~y~0))} is VALID [2022-04-07 17:22:14,686 INFO L290 TraceCheckUtils]: 55: Hoare triple {3006#(= 15 (+ (- 1) main_~y~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3016#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-07 17:22:14,687 INFO L290 TraceCheckUtils]: 56: Hoare triple {3016#(= (+ (- 2) main_~y~0) 15)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3016#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-07 17:22:14,687 INFO L290 TraceCheckUtils]: 57: Hoare triple {3016#(= (+ (- 2) main_~y~0) 15)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3016#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-07 17:22:14,687 INFO L290 TraceCheckUtils]: 58: Hoare triple {3016#(= (+ (- 2) main_~y~0) 15)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3026#(= main_~y~0 18)} is VALID [2022-04-07 17:22:14,687 INFO L290 TraceCheckUtils]: 59: Hoare triple {3026#(= main_~y~0 18)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3026#(= main_~y~0 18)} is VALID [2022-04-07 17:22:14,688 INFO L290 TraceCheckUtils]: 60: Hoare triple {3026#(= main_~y~0 18)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3026#(= main_~y~0 18)} is VALID [2022-04-07 17:22:14,688 INFO L290 TraceCheckUtils]: 61: Hoare triple {3026#(= main_~y~0 18)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3036#(= 19 main_~y~0)} is VALID [2022-04-07 17:22:14,688 INFO L290 TraceCheckUtils]: 62: Hoare triple {3036#(= 19 main_~y~0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3036#(= 19 main_~y~0)} is VALID [2022-04-07 17:22:14,689 INFO L290 TraceCheckUtils]: 63: Hoare triple {3036#(= 19 main_~y~0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3036#(= 19 main_~y~0)} is VALID [2022-04-07 17:22:14,689 INFO L290 TraceCheckUtils]: 64: Hoare triple {3036#(= 19 main_~y~0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3046#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-07 17:22:14,689 INFO L290 TraceCheckUtils]: 65: Hoare triple {3046#(= 19 (+ (- 1) main_~y~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3046#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-07 17:22:14,689 INFO L290 TraceCheckUtils]: 66: Hoare triple {3046#(= 19 (+ (- 1) main_~y~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3046#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-07 17:22:14,690 INFO L290 TraceCheckUtils]: 67: Hoare triple {3046#(= 19 (+ (- 1) main_~y~0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3056#(= main_~y~0 21)} is VALID [2022-04-07 17:22:14,690 INFO L290 TraceCheckUtils]: 68: Hoare triple {3056#(= main_~y~0 21)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3056#(= main_~y~0 21)} is VALID [2022-04-07 17:22:14,690 INFO L290 TraceCheckUtils]: 69: Hoare triple {3056#(= main_~y~0 21)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3056#(= main_~y~0 21)} is VALID [2022-04-07 17:22:14,691 INFO L290 TraceCheckUtils]: 70: Hoare triple {3056#(= main_~y~0 21)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3066#(= main_~y~0 22)} is VALID [2022-04-07 17:22:14,691 INFO L290 TraceCheckUtils]: 71: Hoare triple {3066#(= main_~y~0 22)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3066#(= main_~y~0 22)} is VALID [2022-04-07 17:22:14,691 INFO L290 TraceCheckUtils]: 72: Hoare triple {3066#(= main_~y~0 22)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3066#(= main_~y~0 22)} is VALID [2022-04-07 17:22:14,692 INFO L290 TraceCheckUtils]: 73: Hoare triple {3066#(= main_~y~0 22)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3076#(= 23 main_~y~0)} is VALID [2022-04-07 17:22:14,692 INFO L290 TraceCheckUtils]: 74: Hoare triple {3076#(= 23 main_~y~0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3076#(= 23 main_~y~0)} is VALID [2022-04-07 17:22:14,692 INFO L290 TraceCheckUtils]: 75: Hoare triple {3076#(= 23 main_~y~0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3076#(= 23 main_~y~0)} is VALID [2022-04-07 17:22:14,692 INFO L290 TraceCheckUtils]: 76: Hoare triple {3076#(= 23 main_~y~0)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3086#(= main_~y~0 24)} is VALID [2022-04-07 17:22:14,693 INFO L290 TraceCheckUtils]: 77: Hoare triple {3086#(= main_~y~0 24)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3086#(= main_~y~0 24)} is VALID [2022-04-07 17:22:14,693 INFO L290 TraceCheckUtils]: 78: Hoare triple {3086#(= main_~y~0 24)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3086#(= main_~y~0 24)} is VALID [2022-04-07 17:22:14,693 INFO L290 TraceCheckUtils]: 79: Hoare triple {3086#(= main_~y~0 24)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3096#(= main_~y~0 25)} is VALID [2022-04-07 17:22:14,694 INFO L290 TraceCheckUtils]: 80: Hoare triple {3096#(= main_~y~0 25)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3096#(= main_~y~0 25)} is VALID [2022-04-07 17:22:14,694 INFO L290 TraceCheckUtils]: 81: Hoare triple {3096#(= main_~y~0 25)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3096#(= main_~y~0 25)} is VALID [2022-04-07 17:22:14,694 INFO L290 TraceCheckUtils]: 82: Hoare triple {3096#(= main_~y~0 25)} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3106#(= main_~y~0 26)} is VALID [2022-04-07 17:22:14,694 INFO L290 TraceCheckUtils]: 83: Hoare triple {3106#(= main_~y~0 26)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3106#(= main_~y~0 26)} is VALID [2022-04-07 17:22:14,695 INFO L290 TraceCheckUtils]: 84: Hoare triple {3106#(= main_~y~0 26)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3106#(= main_~y~0 26)} is VALID [2022-04-07 17:22:14,695 INFO L290 TraceCheckUtils]: 85: Hoare triple {3106#(= main_~y~0 26)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3096#(= main_~y~0 25)} is VALID [2022-04-07 17:22:14,695 INFO L290 TraceCheckUtils]: 86: Hoare triple {3096#(= main_~y~0 25)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3096#(= main_~y~0 25)} is VALID [2022-04-07 17:22:14,696 INFO L290 TraceCheckUtils]: 87: Hoare triple {3096#(= main_~y~0 25)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3096#(= main_~y~0 25)} is VALID [2022-04-07 17:22:14,696 INFO L290 TraceCheckUtils]: 88: Hoare triple {3096#(= main_~y~0 25)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3086#(= main_~y~0 24)} is VALID [2022-04-07 17:22:14,696 INFO L290 TraceCheckUtils]: 89: Hoare triple {3086#(= main_~y~0 24)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3086#(= main_~y~0 24)} is VALID [2022-04-07 17:22:14,696 INFO L290 TraceCheckUtils]: 90: Hoare triple {3086#(= main_~y~0 24)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3086#(= main_~y~0 24)} is VALID [2022-04-07 17:22:14,697 INFO L290 TraceCheckUtils]: 91: Hoare triple {3086#(= main_~y~0 24)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3076#(= 23 main_~y~0)} is VALID [2022-04-07 17:22:14,697 INFO L290 TraceCheckUtils]: 92: Hoare triple {3076#(= 23 main_~y~0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3076#(= 23 main_~y~0)} is VALID [2022-04-07 17:22:14,697 INFO L290 TraceCheckUtils]: 93: Hoare triple {3076#(= 23 main_~y~0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3076#(= 23 main_~y~0)} is VALID [2022-04-07 17:22:14,698 INFO L290 TraceCheckUtils]: 94: Hoare triple {3076#(= 23 main_~y~0)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3066#(= main_~y~0 22)} is VALID [2022-04-07 17:22:14,698 INFO L290 TraceCheckUtils]: 95: Hoare triple {3066#(= main_~y~0 22)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3066#(= main_~y~0 22)} is VALID [2022-04-07 17:22:14,698 INFO L290 TraceCheckUtils]: 96: Hoare triple {3066#(= main_~y~0 22)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3066#(= main_~y~0 22)} is VALID [2022-04-07 17:22:14,698 INFO L290 TraceCheckUtils]: 97: Hoare triple {3066#(= main_~y~0 22)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3056#(= main_~y~0 21)} is VALID [2022-04-07 17:22:14,699 INFO L290 TraceCheckUtils]: 98: Hoare triple {3056#(= main_~y~0 21)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3056#(= main_~y~0 21)} is VALID [2022-04-07 17:22:14,699 INFO L290 TraceCheckUtils]: 99: Hoare triple {3056#(= main_~y~0 21)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3056#(= main_~y~0 21)} is VALID [2022-04-07 17:22:14,700 INFO L290 TraceCheckUtils]: 100: Hoare triple {3056#(= main_~y~0 21)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3046#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-07 17:22:14,700 INFO L290 TraceCheckUtils]: 101: Hoare triple {3046#(= 19 (+ (- 1) main_~y~0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3046#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-07 17:22:14,700 INFO L290 TraceCheckUtils]: 102: Hoare triple {3046#(= 19 (+ (- 1) main_~y~0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3046#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-07 17:22:14,701 INFO L290 TraceCheckUtils]: 103: Hoare triple {3046#(= 19 (+ (- 1) main_~y~0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3036#(= 19 main_~y~0)} is VALID [2022-04-07 17:22:14,701 INFO L290 TraceCheckUtils]: 104: Hoare triple {3036#(= 19 main_~y~0)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3036#(= 19 main_~y~0)} is VALID [2022-04-07 17:22:14,701 INFO L290 TraceCheckUtils]: 105: Hoare triple {3036#(= 19 main_~y~0)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3036#(= 19 main_~y~0)} is VALID [2022-04-07 17:22:14,701 INFO L290 TraceCheckUtils]: 106: Hoare triple {3036#(= 19 main_~y~0)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3026#(= main_~y~0 18)} is VALID [2022-04-07 17:22:14,702 INFO L290 TraceCheckUtils]: 107: Hoare triple {3026#(= main_~y~0 18)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3026#(= main_~y~0 18)} is VALID [2022-04-07 17:22:14,702 INFO L290 TraceCheckUtils]: 108: Hoare triple {3026#(= main_~y~0 18)} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3026#(= main_~y~0 18)} is VALID [2022-04-07 17:22:14,702 INFO L290 TraceCheckUtils]: 109: Hoare triple {3026#(= main_~y~0 18)} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3016#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-07 17:22:14,703 INFO L290 TraceCheckUtils]: 110: Hoare triple {3016#(= (+ (- 2) main_~y~0) 15)} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3016#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-07 17:22:14,703 INFO L290 TraceCheckUtils]: 111: Hoare triple {3016#(= (+ (- 2) main_~y~0) 15)} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {3016#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-07 17:22:14,703 INFO L272 TraceCheckUtils]: 112: Hoare triple {3016#(= (+ (- 2) main_~y~0) 15)} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {3197#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:22:14,704 INFO L290 TraceCheckUtils]: 113: Hoare triple {3197#(<= 1 |__VERIFIER_assert_#in~cond|)} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3201#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:22:14,704 INFO L290 TraceCheckUtils]: 114: Hoare triple {3201#(<= 1 __VERIFIER_assert_~cond)} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2798#false} is VALID [2022-04-07 17:22:14,705 INFO L290 TraceCheckUtils]: 115: Hoare triple {2798#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2798#false} is VALID [2022-04-07 17:22:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1794 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-07 17:22:14,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:22:16,893 INFO L290 TraceCheckUtils]: 115: Hoare triple {2798#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2798#false} is VALID [2022-04-07 17:22:16,894 INFO L290 TraceCheckUtils]: 114: Hoare triple {3201#(<= 1 __VERIFIER_assert_~cond)} [61] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2798#false} is VALID [2022-04-07 17:22:16,894 INFO L290 TraceCheckUtils]: 113: Hoare triple {3197#(<= 1 |__VERIFIER_assert_#in~cond|)} [59] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3201#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:22:16,895 INFO L272 TraceCheckUtils]: 112: Hoare triple {3217#(not (= (mod main_~y~0 4294967296) 0))} [55] L9-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= (mod v_main_~y~0_7 4294967296) 0)) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {3197#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:22:16,895 INFO L290 TraceCheckUtils]: 111: Hoare triple {3217#(not (= (mod main_~y~0 4294967296) 0))} [53] L9-2-->L9-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_7} OutVars{main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[] {3217#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:22:16,895 INFO L290 TraceCheckUtils]: 110: Hoare triple {3217#(not (= (mod main_~y~0 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3217#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:22:16,896 INFO L290 TraceCheckUtils]: 109: Hoare triple {3227#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3217#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:22:16,897 INFO L290 TraceCheckUtils]: 108: Hoare triple {3227#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3227#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-07 17:22:16,897 INFO L290 TraceCheckUtils]: 107: Hoare triple {3227#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3227#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-07 17:22:16,898 INFO L290 TraceCheckUtils]: 106: Hoare triple {3237#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3227#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-07 17:22:16,898 INFO L290 TraceCheckUtils]: 105: Hoare triple {3237#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3237#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-07 17:22:16,898 INFO L290 TraceCheckUtils]: 104: Hoare triple {3237#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3237#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-07 17:22:16,899 INFO L290 TraceCheckUtils]: 103: Hoare triple {3247#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3237#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-07 17:22:16,899 INFO L290 TraceCheckUtils]: 102: Hoare triple {3247#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3247#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-07 17:22:16,899 INFO L290 TraceCheckUtils]: 101: Hoare triple {3247#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3247#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-07 17:22:16,900 INFO L290 TraceCheckUtils]: 100: Hoare triple {3257#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3247#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-07 17:22:16,900 INFO L290 TraceCheckUtils]: 99: Hoare triple {3257#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3257#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,900 INFO L290 TraceCheckUtils]: 98: Hoare triple {3257#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3257#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,901 INFO L290 TraceCheckUtils]: 97: Hoare triple {3267#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3257#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,901 INFO L290 TraceCheckUtils]: 96: Hoare triple {3267#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3267#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,902 INFO L290 TraceCheckUtils]: 95: Hoare triple {3267#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3267#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,902 INFO L290 TraceCheckUtils]: 94: Hoare triple {3277#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3267#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,902 INFO L290 TraceCheckUtils]: 93: Hoare triple {3277#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3277#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,903 INFO L290 TraceCheckUtils]: 92: Hoare triple {3277#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3277#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,903 INFO L290 TraceCheckUtils]: 91: Hoare triple {3287#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3277#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,903 INFO L290 TraceCheckUtils]: 90: Hoare triple {3287#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3287#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-07 17:22:16,904 INFO L290 TraceCheckUtils]: 89: Hoare triple {3287#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3287#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-07 17:22:16,911 INFO L290 TraceCheckUtils]: 88: Hoare triple {3297#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3287#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-07 17:22:16,911 INFO L290 TraceCheckUtils]: 87: Hoare triple {3297#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3297#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,912 INFO L290 TraceCheckUtils]: 86: Hoare triple {3297#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3297#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,927 INFO L290 TraceCheckUtils]: 85: Hoare triple {3307#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} [57] L10-->L10-2: Formula: (and (= v_main_~y~0_4 (+ v_main_~y~0_3 1)) (not (< (mod v_main_~x~0_3 4294967296) 500000))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {3297#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,927 INFO L290 TraceCheckUtils]: 84: Hoare triple {3307#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3307#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} is VALID [2022-04-07 17:22:16,928 INFO L290 TraceCheckUtils]: 83: Hoare triple {3307#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3307#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} is VALID [2022-04-07 17:22:16,928 INFO L290 TraceCheckUtils]: 82: Hoare triple {3297#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3307#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} is VALID [2022-04-07 17:22:16,929 INFO L290 TraceCheckUtils]: 81: Hoare triple {3297#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3297#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,929 INFO L290 TraceCheckUtils]: 80: Hoare triple {3297#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3297#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,929 INFO L290 TraceCheckUtils]: 79: Hoare triple {3287#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3297#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,930 INFO L290 TraceCheckUtils]: 78: Hoare triple {3287#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3287#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-07 17:22:16,930 INFO L290 TraceCheckUtils]: 77: Hoare triple {3287#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3287#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-07 17:22:16,931 INFO L290 TraceCheckUtils]: 76: Hoare triple {3277#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3287#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-07 17:22:16,931 INFO L290 TraceCheckUtils]: 75: Hoare triple {3277#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3277#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,931 INFO L290 TraceCheckUtils]: 74: Hoare triple {3277#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3277#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,932 INFO L290 TraceCheckUtils]: 73: Hoare triple {3267#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3277#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,932 INFO L290 TraceCheckUtils]: 72: Hoare triple {3267#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3267#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,932 INFO L290 TraceCheckUtils]: 71: Hoare triple {3267#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3267#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,933 INFO L290 TraceCheckUtils]: 70: Hoare triple {3257#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3267#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,933 INFO L290 TraceCheckUtils]: 69: Hoare triple {3257#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3257#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,933 INFO L290 TraceCheckUtils]: 68: Hoare triple {3257#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3257#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,934 INFO L290 TraceCheckUtils]: 67: Hoare triple {3247#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3257#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,934 INFO L290 TraceCheckUtils]: 66: Hoare triple {3247#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3247#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-07 17:22:16,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {3247#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3247#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-07 17:22:16,935 INFO L290 TraceCheckUtils]: 64: Hoare triple {3237#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3247#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-07 17:22:16,935 INFO L290 TraceCheckUtils]: 63: Hoare triple {3237#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3237#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-07 17:22:16,936 INFO L290 TraceCheckUtils]: 62: Hoare triple {3237#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3237#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-07 17:22:16,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {3227#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3237#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-07 17:22:16,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {3227#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3227#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-07 17:22:16,937 INFO L290 TraceCheckUtils]: 59: Hoare triple {3227#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3227#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-07 17:22:16,937 INFO L290 TraceCheckUtils]: 58: Hoare triple {3217#(not (= (mod main_~y~0 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3227#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-07 17:22:16,938 INFO L290 TraceCheckUtils]: 57: Hoare triple {3217#(not (= (mod main_~y~0 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3217#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:22:16,938 INFO L290 TraceCheckUtils]: 56: Hoare triple {3217#(not (= (mod main_~y~0 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3217#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:22:16,938 INFO L290 TraceCheckUtils]: 55: Hoare triple {3398#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3217#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-07 17:22:16,945 INFO L290 TraceCheckUtils]: 54: Hoare triple {3398#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3398#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-07 17:22:16,946 INFO L290 TraceCheckUtils]: 53: Hoare triple {3398#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3398#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-07 17:22:16,946 INFO L290 TraceCheckUtils]: 52: Hoare triple {3408#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3398#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-07 17:22:16,947 INFO L290 TraceCheckUtils]: 51: Hoare triple {3408#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3408#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} is VALID [2022-04-07 17:22:16,947 INFO L290 TraceCheckUtils]: 50: Hoare triple {3408#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3408#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} is VALID [2022-04-07 17:22:16,948 INFO L290 TraceCheckUtils]: 49: Hoare triple {3418#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3408#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} is VALID [2022-04-07 17:22:16,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {3418#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3418#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} is VALID [2022-04-07 17:22:16,948 INFO L290 TraceCheckUtils]: 47: Hoare triple {3418#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3418#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} is VALID [2022-04-07 17:22:16,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {3428#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3418#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} is VALID [2022-04-07 17:22:16,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {3428#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3428#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} is VALID [2022-04-07 17:22:16,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {3428#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3428#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} is VALID [2022-04-07 17:22:16,950 INFO L290 TraceCheckUtils]: 43: Hoare triple {3438#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3428#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} is VALID [2022-04-07 17:22:16,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {3438#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3438#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {3438#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3438#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {3448#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3438#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {3448#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3448#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} is VALID [2022-04-07 17:22:16,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {3448#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3448#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} is VALID [2022-04-07 17:22:16,953 INFO L290 TraceCheckUtils]: 37: Hoare triple {3458#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3448#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} is VALID [2022-04-07 17:22:16,953 INFO L290 TraceCheckUtils]: 36: Hoare triple {3458#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3458#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,953 INFO L290 TraceCheckUtils]: 35: Hoare triple {3458#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3458#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {3468#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3458#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} is VALID [2022-04-07 17:22:16,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {3468#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3468#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} is VALID [2022-04-07 17:22:16,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {3468#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3468#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} is VALID [2022-04-07 17:22:16,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {3478#(or (not (< (mod main_~x~0 4294967296) 500000)) (not (= (mod (+ main_~y~0 9) 4294967296) 0)))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3468#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} is VALID [2022-04-07 17:22:16,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {3478#(or (not (< (mod main_~x~0 4294967296) 500000)) (not (= (mod (+ main_~y~0 9) 4294967296) 0)))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3478#(or (not (< (mod main_~x~0 4294967296) 500000)) (not (= (mod (+ main_~y~0 9) 4294967296) 0)))} is VALID [2022-04-07 17:22:16,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {3485#(or (not (= (mod (+ main_~y~0 9) 4294967296) 0)) (not (< (mod (+ main_~x~0 1) 4294967296) 500000)))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3478#(or (not (< (mod main_~x~0 4294967296) 500000)) (not (= (mod (+ main_~y~0 9) 4294967296) 0)))} is VALID [2022-04-07 17:22:16,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {3489#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3485#(or (not (= (mod (+ main_~y~0 9) 4294967296) 0)) (not (< (mod (+ main_~x~0 1) 4294967296) 500000)))} is VALID [2022-04-07 17:22:16,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {3489#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3489#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} is VALID [2022-04-07 17:22:16,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {3489#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3489#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} is VALID [2022-04-07 17:22:16,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {3499#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3489#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} is VALID [2022-04-07 17:22:16,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {3499#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3499#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} is VALID [2022-04-07 17:22:16,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {3499#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3499#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} is VALID [2022-04-07 17:22:16,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {3509#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3499#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} is VALID [2022-04-07 17:22:16,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {3509#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3509#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} is VALID [2022-04-07 17:22:16,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {3509#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3509#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} is VALID [2022-04-07 17:22:16,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {3519#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3509#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} is VALID [2022-04-07 17:22:16,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {3519#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3519#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} is VALID [2022-04-07 17:22:16,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {3519#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3519#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} is VALID [2022-04-07 17:22:16,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {3529#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3519#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} is VALID [2022-04-07 17:22:16,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {3529#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3529#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} is VALID [2022-04-07 17:22:16,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {3529#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3529#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} is VALID [2022-04-07 17:22:16,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {3539#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3529#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} is VALID [2022-04-07 17:22:16,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {3539#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3539#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} is VALID [2022-04-07 17:22:16,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {3539#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3539#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} is VALID [2022-04-07 17:22:16,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {3549#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3539#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} is VALID [2022-04-07 17:22:16,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {3549#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3549#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} is VALID [2022-04-07 17:22:16,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {3549#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} [60] L10-2-->L9-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post6] {3549#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} is VALID [2022-04-07 17:22:16,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {3559#(not (= (mod (+ main_~y~0 17) 4294967296) 0))} [56] L10-->L10-2: Formula: (and (= v_main_~y~0_1 (+ v_main_~y~0_2 1)) (< (mod v_main_~x~0_2 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_#t~post4, main_~y~0] {3549#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} is VALID [2022-04-07 17:22:16,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {3559#(not (= (mod (+ main_~y~0 17) 4294967296) 0))} [54] L9-2-->L10: Formula: (< (mod v_main_~x~0_1 4294967296) 1000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3559#(not (= (mod (+ main_~y~0 17) 4294967296) 0))} is VALID [2022-04-07 17:22:16,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {2797#true} [50] mainENTRY-->L9-2: Formula: (and (= v_main_~y~0_5 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3559#(not (= (mod (+ main_~y~0 17) 4294967296) 0))} is VALID [2022-04-07 17:22:16,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {2797#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#true} is VALID [2022-04-07 17:22:16,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2797#true} {2797#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#true} is VALID [2022-04-07 17:22:16,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {2797#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#true} is VALID [2022-04-07 17:22:16,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {2797#true} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2797#true} is VALID [2022-04-07 17:22:16,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {2797#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#true} is VALID [2022-04-07 17:22:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1794 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-07 17:22:16,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807363189] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:22:16,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:22:16,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 32] total 88 [2022-04-07 17:22:16,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120594626] [2022-04-07 17:22:16,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:22:16,975 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 3.102272727272727) internal successors, (273), 86 states have internal predecessors, (273), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-07 17:22:16,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:22:16,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 88 states, 88 states have (on average 3.102272727272727) internal successors, (273), 86 states have internal predecessors, (273), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:22:17,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:22:17,164 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-04-07 17:22:17,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:22:17,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-04-07 17:22:17,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=972, Invalid=6684, Unknown=0, NotChecked=0, Total=7656 [2022-04-07 17:22:17,166 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 88 states, 88 states have (on average 3.102272727272727) internal successors, (273), 86 states have internal predecessors, (273), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:22:26,268 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 16 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (<= (+ (div c_main_~x~0 4294967296) 1) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or .cse0 (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 15 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (or (not (< (mod (+ c_main_~x~0 1) 4294967296) 500000)) .cse0) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= 0 (mod (+ 17 c_main_~y~0) 4294967296))) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (<= c_main_~x~0 26) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-04-07 17:24:26,452 WARN L232 SmtUtils]: Spent 56.80s on a formula simplification that was a NOOP. DAG size: 138 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 17:24:28,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:24:31,092 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 16 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or .cse0 (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 15 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (or (not (< (mod (+ c_main_~x~0 1) 4294967296) 500000)) .cse0) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-04-07 17:26:27,897 WARN L232 SmtUtils]: Spent 51.88s on a formula simplification that was a NOOP. DAG size: 134 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 17:26:34,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:28:32,696 WARN L232 SmtUtils]: Spent 48.69s on a formula simplification that was a NOOP. DAG size: 139 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 17:28:41,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:30:49,673 WARN L232 SmtUtils]: Spent 1.01m on a formula simplification that was a NOOP. DAG size: 144 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 17:30:53,168 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:30:57,231 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or .cse0 (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (or (not (< (mod (+ c_main_~x~0 1) 4294967296) 500000)) .cse0) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-04-07 17:30:59,238 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:31:08,445 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)) (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0))) is different from false [2022-04-07 17:32:49,777 WARN L232 SmtUtils]: Spent 36.85s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 17:34:47,470 WARN L232 SmtUtils]: Spent 43.68s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)