/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/mono-crafted_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 17:36:33,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:36:33,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:36:33,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:36:33,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:36:33,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:36:33,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:36:33,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:36:33,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:36:33,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:36:33,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:36:33,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:36:33,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:36:33,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:36:33,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:36:33,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:36:33,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:36:33,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:36:33,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:36:33,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:36:33,470 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:36:33,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:36:33,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:36:33,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:36:33,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:36:33,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:36:33,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:36:33,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:36:33,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:36:33,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:36:33,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:36:33,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:36:33,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:36:33,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:36:33,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:36:33,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:36:33,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:36:33,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:36:33,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:36:33,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:36:33,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:36:33,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:36:33,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:36:33,497 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:36:33,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:36:33,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:36:33,498 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:36:33,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:36:33,498 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:36:33,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:36:33,498 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:36:33,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:36:33,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:36:33,498 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:36:33,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:36:33,498 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:36:33,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:36:33,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:36:33,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:36:33,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:36:33,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:36:33,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:36:33,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:36:33,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:36:33,500 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:36:33,500 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:36:33,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:36:33,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:36:33,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:36:33,684 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:36:33,684 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:36:33,685 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2022-04-07 17:36:33,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62597c9e1/c2e53eb862634bf3a41ea88bb411ecaf/FLAG73fb5293f [2022-04-07 17:36:34,097 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:36:34,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2022-04-07 17:36:34,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62597c9e1/c2e53eb862634bf3a41ea88bb411ecaf/FLAG73fb5293f [2022-04-07 17:36:34,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62597c9e1/c2e53eb862634bf3a41ea88bb411ecaf [2022-04-07 17:36:34,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:36:34,114 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:36:34,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:36:34,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:36:34,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:36:34,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:36:34" (1/1) ... [2022-04-07 17:36:34,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5e10c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:36:34, skipping insertion in model container [2022-04-07 17:36:34,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:36:34" (1/1) ... [2022-04-07 17:36:34,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:36:34,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:36:34,248 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/mono-crafted_11.c[319,332] [2022-04-07 17:36:34,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:36:34,264 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:36:34,272 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/mono-crafted_11.c[319,332] [2022-04-07 17:36:34,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:36:34,283 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:36:34,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:36:34 WrapperNode [2022-04-07 17:36:34,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:36:34,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:36:34,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:36:34,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:36:34,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:36:34" (1/1) ... [2022-04-07 17:36:34,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:36:34" (1/1) ... [2022-04-07 17:36:34,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:36:34" (1/1) ... [2022-04-07 17:36:34,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:36:34" (1/1) ... [2022-04-07 17:36:34,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:36:34" (1/1) ... [2022-04-07 17:36:34,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:36:34" (1/1) ... [2022-04-07 17:36:34,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:36:34" (1/1) ... [2022-04-07 17:36:34,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:36:34,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:36:34,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:36:34,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:36:34,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:36:34" (1/1) ... [2022-04-07 17:36:34,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:36:34,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:36:34,343 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:36:34,352 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:36:34,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:36:34,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:36:34,372 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:36:34,372 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 17:36:34,372 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:36:34,372 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 17:36:34,372 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:36:34,372 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:36:34,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:36:34,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:36:34,372 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:36:34,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:36:34,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:36:34,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:36:34,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:36:34,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:36:34,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:36:34,427 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:36:34,428 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:36:34,525 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:36:34,530 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:36:34,530 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 17:36:34,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:36:34 BoogieIcfgContainer [2022-04-07 17:36:34,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:36:34,533 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:36:34,533 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:36:34,534 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:36:34,536 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:36:34" (1/1) ... [2022-04-07 17:36:34,538 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:36:34,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:36:34 BasicIcfg [2022-04-07 17:36:34,551 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:36:34,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:36:34,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:36:34,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:36:34,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:36:34" (1/4) ... [2022-04-07 17:36:34,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648c065f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:36:34, skipping insertion in model container [2022-04-07 17:36:34,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:36:34" (2/4) ... [2022-04-07 17:36:34,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648c065f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:36:34, skipping insertion in model container [2022-04-07 17:36:34,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:36:34" (3/4) ... [2022-04-07 17:36:34,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648c065f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:36:34, skipping insertion in model container [2022-04-07 17:36:34,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:36:34" (4/4) ... [2022-04-07 17:36:34,556 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_11.cJordan [2022-04-07 17:36:34,560 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:36:34,561 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 17:36:34,590 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:36:34,595 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:36:34,595 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 17:36:34,607 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:36:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 17:36:34,612 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:36:34,613 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:36:34,613 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:36:34,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:36:34,617 INFO L85 PathProgramCache]: Analyzing trace with hash -154368955, now seen corresponding path program 1 times [2022-04-07 17:36:34,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:36:34,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410298876] [2022-04-07 17:36:34,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:36:34,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:36:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:34,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:36:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:34,739 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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-07 17:36:34,739 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:36:34,739 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:36:34,741 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:36:34,742 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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-07 17:36:34,742 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:36:34,742 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:36:34,742 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:36:34,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {23#true} is VALID [2022-04-07 17:36:34,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [52] L9-2-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 17:36:34,744 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {24#false} is VALID [2022-04-07 17:36:34,744 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:36:34,744 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:36:34,744 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:36:34,745 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:36:34,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:36:34,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410298876] [2022-04-07 17:36:34,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410298876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:36:34,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:36:34,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 17:36:34,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727921471] [2022-04-07 17:36:34,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:36:34,753 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:36:34,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:36:34,757 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:36:34,770 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:36:34,771 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 17:36:34,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:36:34,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 17:36:34,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 17:36:34,787 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:36:34,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:34,868 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-07 17:36:34,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 17:36:34,869 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:36:34,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:36:34,870 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:36:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-07 17:36:34,876 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:36:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-07 17:36:34,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-04-07 17:36:34,916 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:36:34,923 INFO L225 Difference]: With dead ends: 20 [2022-04-07 17:36:34,923 INFO L226 Difference]: Without dead ends: 13 [2022-04-07 17:36:34,925 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:36:34,932 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:36:34,934 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:36:34,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-07 17:36:34,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-07 17:36:34,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:36:34,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:36:34,959 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:36:34,959 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:36:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:34,964 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-07 17:36:34,964 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-07 17:36:34,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:36:34,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:36:34,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-07 17:36:34,966 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-07 17:36:34,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:34,972 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-07 17:36:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-07 17:36:34,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:36:34,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:36:34,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:36:34,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:36:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:36:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-07 17:36:34,976 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-07 17:36:34,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:36:34,976 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-07 17:36:34,978 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:36:34,978 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-07 17:36:34,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 17:36:34,978 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:36:34,978 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:36:34,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:36:34,980 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:36:34,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:36:34,987 INFO L85 PathProgramCache]: Analyzing trace with hash -153445434, now seen corresponding path program 1 times [2022-04-07 17:36:34,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:36:34,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926718174] [2022-04-07 17:36:34,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:36:34,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:36:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:35,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:36:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:35,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {96#(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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {90#true} is VALID [2022-04-07 17:36:35,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:36:35,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:36:35,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {90#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:36:35,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#(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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {90#true} is VALID [2022-04-07 17:36:35,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:36:35,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:36:35,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {90#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:36:35,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {95#(= main_~x~0 0)} is VALID [2022-04-07 17:36:35,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {95#(= main_~x~0 0)} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-07 17:36:35,147 INFO L272 TraceCheckUtils]: 7: Hoare triple {91#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {91#false} is VALID [2022-04-07 17:36:35,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {91#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] {91#false} is VALID [2022-04-07 17:36:35,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {91#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[] {91#false} is VALID [2022-04-07 17:36:35,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {91#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-07 17:36:35,149 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:36:35,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:36:35,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926718174] [2022-04-07 17:36:35,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926718174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:36:35,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:36:35,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 17:36:35,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416461885] [2022-04-07 17:36:35,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:36:35,151 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:36:35,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:36:35,152 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:36:35,165 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:36:35,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 17:36:35,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:36:35,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 17:36:35,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 17:36:35,168 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:36:35,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:35,235 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 17:36:35,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 17:36:35,236 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:36:35,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:36:35,236 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:36:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-07 17:36:35,240 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:36:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-07 17:36:35,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-07 17:36:35,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:36:35,266 INFO L225 Difference]: With dead ends: 15 [2022-04-07 17:36:35,266 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 17:36:35,269 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 17:36:35,271 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:36:35,274 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:36:35,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 17:36:35,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-07 17:36:35,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:36:35,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:36:35,280 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:36:35,281 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:36:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:35,296 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 17:36:35,296 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 17:36:35,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:36:35,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:36:35,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 17:36:35,296 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 17:36:35,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:35,297 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 17:36:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 17:36:35,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:36:35,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:36:35,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:36:35,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:36:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:36:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-07 17:36:35,299 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-07 17:36:35,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:36:35,299 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-07 17:36:35,300 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:36:35,300 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 17:36:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 17:36:35,300 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:36:35,300 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:36:35,300 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 17:36:35,301 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:36:35,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:36:35,301 INFO L85 PathProgramCache]: Analyzing trace with hash -521762940, now seen corresponding path program 1 times [2022-04-07 17:36:35,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:36:35,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113274081] [2022-04-07 17:36:35,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:36:35,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:36:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:35,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:36:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:35,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {161#true} is VALID [2022-04-07 17:36:35,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#true} is VALID [2022-04-07 17:36:35,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#true} is VALID [2022-04-07 17:36:35,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:36:35,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {161#true} is VALID [2022-04-07 17:36:35,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#true} is VALID [2022-04-07 17:36:35,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#true} is VALID [2022-04-07 17:36:35,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#true} is VALID [2022-04-07 17:36:35,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {166#(= main_~x~0 0)} is VALID [2022-04-07 17:36:35,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {166#(= main_~x~0 0)} is VALID [2022-04-07 17:36:35,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {167#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:36:35,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {167#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {162#false} is VALID [2022-04-07 17:36:35,430 INFO L272 TraceCheckUtils]: 9: Hoare triple {162#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {162#false} is VALID [2022-04-07 17:36:35,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {162#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] {162#false} is VALID [2022-04-07 17:36:35,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#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[] {162#false} is VALID [2022-04-07 17:36:35,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {162#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#false} is VALID [2022-04-07 17:36:35,431 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:36:35,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:36:35,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113274081] [2022-04-07 17:36:35,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113274081] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:36:35,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814387505] [2022-04-07 17:36:35,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:36:35,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:36:35,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:36:35,434 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:36:35,437 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:36:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:35,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 17:36:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:35,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:36:35,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#true} is VALID [2022-04-07 17:36:35,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {161#true} is VALID [2022-04-07 17:36:35,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#true} is VALID [2022-04-07 17:36:35,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#true} is VALID [2022-04-07 17:36:35,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#true} is VALID [2022-04-07 17:36:35,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {166#(= main_~x~0 0)} is VALID [2022-04-07 17:36:35,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {166#(= main_~x~0 0)} is VALID [2022-04-07 17:36:35,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {193#(= main_~x~0 1)} is VALID [2022-04-07 17:36:35,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#(= main_~x~0 1)} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {162#false} is VALID [2022-04-07 17:36:35,533 INFO L272 TraceCheckUtils]: 9: Hoare triple {162#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {162#false} is VALID [2022-04-07 17:36:35,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {162#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] {162#false} is VALID [2022-04-07 17:36:35,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#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[] {162#false} is VALID [2022-04-07 17:36:35,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {162#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#false} is VALID [2022-04-07 17:36:35,535 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:36:35,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:36:35,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {162#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#false} is VALID [2022-04-07 17:36:35,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#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[] {162#false} is VALID [2022-04-07 17:36:35,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {162#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] {162#false} is VALID [2022-04-07 17:36:35,598 INFO L272 TraceCheckUtils]: 9: Hoare triple {162#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {162#false} is VALID [2022-04-07 17:36:35,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#(< (mod main_~x~0 4294967296) 100000000)} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {162#false} is VALID [2022-04-07 17:36:35,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {225#(< (mod (+ main_~x~0 1) 4294967296) 100000000)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {221#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-07 17:36:35,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {225#(< (mod (+ main_~x~0 1) 4294967296) 100000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {225#(< (mod (+ main_~x~0 1) 4294967296) 100000000)} is VALID [2022-04-07 17:36:35,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {225#(< (mod (+ main_~x~0 1) 4294967296) 100000000)} is VALID [2022-04-07 17:36:35,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#true} is VALID [2022-04-07 17:36:35,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#true} is VALID [2022-04-07 17:36:35,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#true} is VALID [2022-04-07 17:36:35,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {161#true} is VALID [2022-04-07 17:36:35,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#true} is VALID [2022-04-07 17:36:35,601 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:36:35,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814387505] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:36:35,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:36:35,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-07 17:36:35,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96398263] [2022-04-07 17:36:35,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:36:35,602 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 13 [2022-04-07 17:36:35,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:36:35,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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:36:35,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:36:35,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 17:36:35,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:36:35,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 17:36:35,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-07 17:36:35,619 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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:36:35,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:35,746 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-07 17:36:35,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 17:36:35,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 13 [2022-04-07 17:36:35,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:36:35,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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:36:35,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-04-07 17:36:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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:36:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-04-07 17:36:35,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2022-04-07 17:36:35,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:36:35,792 INFO L225 Difference]: With dead ends: 19 [2022-04-07 17:36:35,792 INFO L226 Difference]: Without dead ends: 19 [2022-04-07 17:36:35,793 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-07 17:36:35,793 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:36:35,794 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:36:35,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-07 17:36:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-07 17:36:35,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:36:35,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:36:35,796 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:36:35,796 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:36:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:35,797 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-07 17:36:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-07 17:36:35,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:36:35,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:36:35,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-07 17:36:35,798 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-07 17:36:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:35,799 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-07 17:36:35,799 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-07 17:36:35,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:36:35,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:36:35,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:36:35,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:36:35,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:36:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-07 17:36:35,800 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-04-07 17:36:35,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:36:35,800 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-07 17:36:35,800 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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:36:35,801 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-07 17:36:35,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 17:36:35,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:36:35,801 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:36:35,822 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:36:36,015 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:36:36,016 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:36:36,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:36:36,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1609511199, now seen corresponding path program 1 times [2022-04-07 17:36:36,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:36:36,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403541071] [2022-04-07 17:36:36,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:36:36,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:36:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:36,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:36:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:36,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {340#(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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {332#true} is VALID [2022-04-07 17:36:36,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#true} is VALID [2022-04-07 17:36:36,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {332#true} {332#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#true} is VALID [2022-04-07 17:36:36,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {332#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:36:36,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#(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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {332#true} is VALID [2022-04-07 17:36:36,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {332#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#true} is VALID [2022-04-07 17:36:36,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {332#true} {332#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#true} is VALID [2022-04-07 17:36:36,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {332#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#true} is VALID [2022-04-07 17:36:36,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {332#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {337#(= main_~x~0 0)} is VALID [2022-04-07 17:36:36,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {337#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {337#(= main_~x~0 0)} is VALID [2022-04-07 17:36:36,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:36,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:36,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {339#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:36,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {339#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {339#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:36,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {339#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {333#false} is VALID [2022-04-07 17:36:36,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {333#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {333#false} is VALID [2022-04-07 17:36:36,150 INFO L272 TraceCheckUtils]: 13: Hoare triple {333#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {333#false} is VALID [2022-04-07 17:36:36,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {333#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] {333#false} is VALID [2022-04-07 17:36:36,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {333#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[] {333#false} is VALID [2022-04-07 17:36:36,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {333#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {333#false} is VALID [2022-04-07 17:36:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:36:36,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:36:36,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403541071] [2022-04-07 17:36:36,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403541071] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:36:36,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40781289] [2022-04-07 17:36:36,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:36:36,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:36:36,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:36:36,157 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:36:36,158 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:36:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:36,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 17:36:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:36,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:36:36,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {332#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#true} is VALID [2022-04-07 17:36:36,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {332#true} is VALID [2022-04-07 17:36:36,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {332#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#true} is VALID [2022-04-07 17:36:36,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {332#true} {332#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#true} is VALID [2022-04-07 17:36:36,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {332#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#true} is VALID [2022-04-07 17:36:36,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {332#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {337#(= main_~x~0 0)} is VALID [2022-04-07 17:36:36,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {337#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {337#(= main_~x~0 0)} is VALID [2022-04-07 17:36:36,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:36,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:36,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {338#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {371#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:36,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {371#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {371#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:36,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {378#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:36:36,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {378#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {378#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:36:36,486 INFO L272 TraceCheckUtils]: 13: Hoare triple {378#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {385#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:36:36,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {385#(<= 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] {389#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:36:36,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {389#(<= 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[] {333#false} is VALID [2022-04-07 17:36:36,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {333#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {333#false} is VALID [2022-04-07 17:36:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:36:36,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:36:36,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {333#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {333#false} is VALID [2022-04-07 17:36:36,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {389#(<= 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[] {333#false} is VALID [2022-04-07 17:36:36,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {385#(<= 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] {389#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:36:36,599 INFO L272 TraceCheckUtils]: 13: Hoare triple {405#(= (mod main_~x~0 2) 0)} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {385#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:36:36,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {405#(= (mod main_~x~0 2) 0)} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {405#(= (mod main_~x~0 2) 0)} is VALID [2022-04-07 17:36:36,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {405#(= (mod main_~x~0 2) 0)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {405#(= (mod main_~x~0 2) 0)} is VALID [2022-04-07 17:36:36,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {405#(= (mod main_~x~0 2) 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {405#(= (mod main_~x~0 2) 0)} is VALID [2022-04-07 17:36:36,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {418#(= (mod (+ main_~x~0 1) 2) 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {405#(= (mod main_~x~0 2) 0)} is VALID [2022-04-07 17:36:36,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {418#(= (mod (+ main_~x~0 1) 2) 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {418#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-07 17:36:36,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {405#(= (mod main_~x~0 2) 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {418#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-07 17:36:36,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#(= (mod main_~x~0 2) 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {405#(= (mod main_~x~0 2) 0)} is VALID [2022-04-07 17:36:36,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {332#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {405#(= (mod main_~x~0 2) 0)} is VALID [2022-04-07 17:36:36,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {332#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#true} is VALID [2022-04-07 17:36:36,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {332#true} {332#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#true} is VALID [2022-04-07 17:36:36,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {332#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#true} is VALID [2022-04-07 17:36:36,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {332#true} is VALID [2022-04-07 17:36:36,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {332#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#true} is VALID [2022-04-07 17:36:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 17:36:36,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40781289] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:36:36,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:36:36,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2022-04-07 17:36:36,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079548824] [2022-04-07 17:36:36,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:36:36,619 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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 17 [2022-04-07 17:36:36,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:36:36,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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:36:36,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:36:36,639 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 17:36:36,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:36:36,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 17:36:36,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-07 17:36:36,641 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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:36:36,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:36,978 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-07 17:36:36,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 17:36:36,978 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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 17 [2022-04-07 17:36:36,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:36:36,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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:36:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2022-04-07 17:36:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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:36:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2022-04-07 17:36:36,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 28 transitions. [2022-04-07 17:36:37,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:36:37,006 INFO L225 Difference]: With dead ends: 26 [2022-04-07 17:36:37,007 INFO L226 Difference]: Without dead ends: 23 [2022-04-07 17:36:37,007 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-07 17:36:37,007 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:36:37,008 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 53 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:36:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-07 17:36:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-07 17:36:37,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:36:37,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:36:37,010 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:36:37,010 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:36:37,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:37,011 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-07 17:36:37,011 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-07 17:36:37,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:36:37,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:36:37,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 23 states. [2022-04-07 17:36:37,012 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 23 states. [2022-04-07 17:36:37,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:37,013 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-07 17:36:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-07 17:36:37,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:36:37,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:36:37,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:36:37,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:36:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:36:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-07 17:36:37,014 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2022-04-07 17:36:37,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:36:37,014 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-07 17:36:37,014 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 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:36:37,014 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-07 17:36:37,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 17:36:37,015 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:36:37,015 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:36:37,033 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:36:37,225 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:36:37,226 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:36:37,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:36:37,226 INFO L85 PathProgramCache]: Analyzing trace with hash -251734435, now seen corresponding path program 2 times [2022-04-07 17:36:37,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:36:37,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418426369] [2022-04-07 17:36:37,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:36:37,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:36:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:37,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:36:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:37,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {565#(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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {556#true} is VALID [2022-04-07 17:36:37,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-07 17:36:37,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {556#true} {556#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-07 17:36:37,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {556#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {565#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:36:37,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#(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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {556#true} is VALID [2022-04-07 17:36:37,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-07 17:36:37,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {556#true} {556#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-07 17:36:37,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {556#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-07 17:36:37,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {556#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {561#(= main_~x~0 0)} is VALID [2022-04-07 17:36:37,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {561#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {561#(= main_~x~0 0)} is VALID [2022-04-07 17:36:37,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {561#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {562#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:37,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {562#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {562#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:37,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {562#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {563#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:37,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {563#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {563#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:37,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {563#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {564#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-07 17:36:37,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {564#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-07 17:36:37,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {564#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {557#false} is VALID [2022-04-07 17:36:37,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {557#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {557#false} is VALID [2022-04-07 17:36:37,324 INFO L272 TraceCheckUtils]: 15: Hoare triple {557#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {557#false} is VALID [2022-04-07 17:36:37,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {557#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] {557#false} is VALID [2022-04-07 17:36:37,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {557#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[] {557#false} is VALID [2022-04-07 17:36:37,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {557#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#false} is VALID [2022-04-07 17:36:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:36:37,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:36:37,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418426369] [2022-04-07 17:36:37,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418426369] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:36:37,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231909249] [2022-04-07 17:36:37,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 17:36:37,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:36:37,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:36:37,326 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:36:37,327 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:36:37,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 17:36:37,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 17:36:37,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 17:36:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:37,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:36:37,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {556#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-07 17:36:37,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {556#true} is VALID [2022-04-07 17:36:37,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-07 17:36:37,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {556#true} {556#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-07 17:36:37,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {556#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-07 17:36:37,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {556#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {561#(= main_~x~0 0)} is VALID [2022-04-07 17:36:37,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {561#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {561#(= main_~x~0 0)} is VALID [2022-04-07 17:36:37,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {561#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {562#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:37,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {562#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {562#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:37,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {562#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {563#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:37,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {563#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {563#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:37,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {563#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {602#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:36:37,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {602#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {602#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:36:37,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {602#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {609#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:36:37,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {609#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {557#false} is VALID [2022-04-07 17:36:37,613 INFO L272 TraceCheckUtils]: 15: Hoare triple {557#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {557#false} is VALID [2022-04-07 17:36:37,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {557#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] {557#false} is VALID [2022-04-07 17:36:37,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {557#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[] {557#false} is VALID [2022-04-07 17:36:37,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {557#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#false} is VALID [2022-04-07 17:36:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:36:37,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:36:37,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {557#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#false} is VALID [2022-04-07 17:36:37,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {557#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[] {557#false} is VALID [2022-04-07 17:36:37,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {557#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] {557#false} is VALID [2022-04-07 17:36:37,742 INFO L272 TraceCheckUtils]: 15: Hoare triple {557#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {557#false} is VALID [2022-04-07 17:36:37,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {637#(< (mod main_~x~0 4294967296) 100000000)} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {557#false} is VALID [2022-04-07 17:36:37,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {641#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {637#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-07 17:36:37,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {641#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {641#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-07 17:36:37,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {648#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {641#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-07 17:36:37,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {648#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {648#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-07 17:36:37,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {655#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {648#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-07 17:36:37,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {655#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {655#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-07 17:36:37,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {662#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {655#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-07 17:36:37,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {662#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {662#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-07 17:36:37,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {556#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {662#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-07 17:36:37,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {556#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-07 17:36:37,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {556#true} {556#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-07 17:36:37,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-07 17:36:37,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {556#true} is VALID [2022-04-07 17:36:37,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {556#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-07 17:36:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:36:37,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231909249] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:36:37,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:36:37,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-04-07 17:36:37,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922767284] [2022-04-07 17:36:37,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:36:37,750 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 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 19 [2022-04-07 17:36:37,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:36:37,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 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:36:37,781 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:36:37,782 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 17:36:37,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:36:37,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 17:36:37,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-04-07 17:36:37,783 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 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:36:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:38,190 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-07 17:36:38,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 17:36:38,191 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 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 19 [2022-04-07 17:36:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:36:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 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:36:38,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-07 17:36:38,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 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:36:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-07 17:36:38,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-04-07 17:36:38,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:36:38,236 INFO L225 Difference]: With dead ends: 33 [2022-04-07 17:36:38,236 INFO L226 Difference]: Without dead ends: 33 [2022-04-07 17:36:38,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2022-04-07 17:36:38,237 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:36:38,237 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 38 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:36:38,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-07 17:36:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-04-07 17:36:38,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:36:38,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:36:38,240 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:36:38,240 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:36:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:38,242 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-07 17:36:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-07 17:36:38,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:36:38,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:36:38,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 33 states. [2022-04-07 17:36:38,242 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 33 states. [2022-04-07 17:36:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:38,243 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-07 17:36:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-07 17:36:38,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:36:38,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:36:38,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:36:38,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:36:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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:36:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-07 17:36:38,245 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2022-04-07 17:36:38,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:36:38,245 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-07 17:36:38,245 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 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:36:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-07 17:36:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 17:36:38,246 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:36:38,246 INFO L499 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:36:38,270 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:36:38,459 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:36:38,460 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:36:38,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:36:38,460 INFO L85 PathProgramCache]: Analyzing trace with hash -151822765, now seen corresponding path program 3 times [2022-04-07 17:36:38,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:36:38,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102561772] [2022-04-07 17:36:38,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:36:38,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:36:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:38,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:36:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:38,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {838#(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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {827#true} is VALID [2022-04-07 17:36:38,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {827#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:38,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {827#true} {827#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:38,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {827#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:36:38,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {838#(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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {827#true} is VALID [2022-04-07 17:36:38,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {827#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:38,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:38,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {827#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:38,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {827#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {832#(= main_~x~0 0)} is VALID [2022-04-07 17:36:38,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {832#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {832#(= main_~x~0 0)} is VALID [2022-04-07 17:36:38,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {832#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {833#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:38,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {833#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:38,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {834#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:38,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {834#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {834#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:38,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {834#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {835#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:36:38,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {835#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {835#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:36:38,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {835#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {836#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:36:38,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {836#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {836#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:36:38,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {836#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {837#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-07 17:36:38,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {837#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {837#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-07 17:36:38,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {837#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {828#false} is VALID [2022-04-07 17:36:38,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {828#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {828#false} is VALID [2022-04-07 17:36:38,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {828#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {828#false} is VALID [2022-04-07 17:36:38,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {828#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {828#false} is VALID [2022-04-07 17:36:38,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {828#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {828#false} is VALID [2022-04-07 17:36:38,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {828#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {828#false} is VALID [2022-04-07 17:36:38,594 INFO L272 TraceCheckUtils]: 23: Hoare triple {828#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {828#false} is VALID [2022-04-07 17:36:38,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {828#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] {828#false} is VALID [2022-04-07 17:36:38,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {828#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[] {828#false} is VALID [2022-04-07 17:36:38,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {828#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {828#false} is VALID [2022-04-07 17:36:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 17:36:38,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:36:38,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102561772] [2022-04-07 17:36:38,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102561772] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:36:38,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215106818] [2022-04-07 17:36:38,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 17:36:38,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:36:38,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:36:38,596 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:36:38,597 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:36:38,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-04-07 17:36:38,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 17:36:38,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-07 17:36:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:38,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:36:39,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {827#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {827#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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {827#true} is VALID [2022-04-07 17:36:39,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {827#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {827#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {827#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {827#true} is VALID [2022-04-07 17:36:39,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {827#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {827#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {827#true} is VALID [2022-04-07 17:36:39,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {827#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {827#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {827#true} is VALID [2022-04-07 17:36:39,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {827#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {827#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {827#true} is VALID [2022-04-07 17:36:39,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {827#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {827#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {827#true} is VALID [2022-04-07 17:36:39,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {827#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {827#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {887#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-07 17:36:39,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {887#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {887#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-07 17:36:39,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {887#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {894#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-07 17:36:39,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {894#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {894#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-07 17:36:39,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {894#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {901#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-07 17:36:39,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {901#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {901#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-07 17:36:39,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {901#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {908#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 10000000) (<= 10000000 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-07 17:36:39,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {908#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 10000000) (<= 10000000 (mod (+ 4294967292 main_~x~0) 4294967296)))} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {828#false} is VALID [2022-04-07 17:36:39,236 INFO L272 TraceCheckUtils]: 23: Hoare triple {828#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {828#false} is VALID [2022-04-07 17:36:39,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {828#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] {828#false} is VALID [2022-04-07 17:36:39,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {828#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[] {828#false} is VALID [2022-04-07 17:36:39,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {828#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {828#false} is VALID [2022-04-07 17:36:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-07 17:36:39,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:36:39,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {828#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {828#false} is VALID [2022-04-07 17:36:39,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {828#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[] {828#false} is VALID [2022-04-07 17:36:39,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {828#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] {828#false} is VALID [2022-04-07 17:36:39,865 INFO L272 TraceCheckUtils]: 23: Hoare triple {828#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {828#false} is VALID [2022-04-07 17:36:39,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {936#(< (mod main_~x~0 4294967296) 100000000)} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {828#false} is VALID [2022-04-07 17:36:39,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {940#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {936#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-07 17:36:39,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {944#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {940#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-07 17:36:39,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {948#(or (<= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {944#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-07 17:36:39,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {948#(or (<= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {948#(or (<= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-07 17:36:39,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {955#(or (<= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {948#(or (<= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-07 17:36:39,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {955#(or (<= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {955#(or (<= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-07 17:36:39,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {827#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {955#(or (<= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-07 17:36:39,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {827#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {827#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {827#true} is VALID [2022-04-07 17:36:39,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {827#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {827#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {827#true} is VALID [2022-04-07 17:36:39,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {827#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {827#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {827#true} is VALID [2022-04-07 17:36:39,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {827#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {827#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {827#true} is VALID [2022-04-07 17:36:39,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {827#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {827#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {827#true} is VALID [2022-04-07 17:36:39,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {827#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {827#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {827#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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {827#true} is VALID [2022-04-07 17:36:39,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {827#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {827#true} is VALID [2022-04-07 17:36:39,878 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-07 17:36:39,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215106818] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:36:39,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:36:39,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 18 [2022-04-07 17:36:39,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089215321] [2022-04-07 17:36:39,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:36:39,879 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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 27 [2022-04-07 17:36:39,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:36:39,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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:36:39,921 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:36:39,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 17:36:39,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:36:39,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 17:36:39,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-04-07 17:36:39,922 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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:36:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:41,493 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-07 17:36:41,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-07 17:36:41,493 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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 27 [2022-04-07 17:36:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:36:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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:36:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 58 transitions. [2022-04-07 17:36:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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:36:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 58 transitions. [2022-04-07 17:36:41,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 58 transitions. [2022-04-07 17:36:41,590 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:36:41,591 INFO L225 Difference]: With dead ends: 61 [2022-04-07 17:36:41,591 INFO L226 Difference]: Without dead ends: 61 [2022-04-07 17:36:41,591 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2022-04-07 17:36:41,592 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 17:36:41,592 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 38 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 17:36:41,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-07 17:36:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2022-04-07 17:36:41,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:36:41,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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:36:41,595 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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:36:41,595 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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:36:41,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:41,597 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-07 17:36:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-07 17:36:41,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:36:41,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:36:41,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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 61 states. [2022-04-07 17:36:41,598 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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 61 states. [2022-04-07 17:36:41,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:41,599 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-07 17:36:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-07 17:36:41,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:36:41,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:36:41,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:36:41,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:36:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 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:36:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-04-07 17:36:41,601 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 27 [2022-04-07 17:36:41,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:36:41,601 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-04-07 17:36:41,602 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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:36:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-07 17:36:41,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 17:36:41,602 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:36:41,602 INFO L499 BasicCegarLoop]: trace histogram [15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:36:41,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 17:36:41,807 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:36:41,808 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:36:41,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:36:41,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1469545376, now seen corresponding path program 4 times [2022-04-07 17:36:41,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:36:41,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952664240] [2022-04-07 17:36:41,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:36:41,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:36:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:41,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:36:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:41,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {1294#(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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1281#true} is VALID [2022-04-07 17:36:41,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {1281#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1281#true} is VALID [2022-04-07 17:36:41,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1281#true} {1281#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1281#true} is VALID [2022-04-07 17:36:41,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {1281#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:36:41,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {1294#(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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1281#true} is VALID [2022-04-07 17:36:41,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {1281#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1281#true} is VALID [2022-04-07 17:36:41,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1281#true} {1281#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1281#true} is VALID [2022-04-07 17:36:41,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {1281#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1281#true} is VALID [2022-04-07 17:36:41,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {1281#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1286#(= main_~x~0 0)} is VALID [2022-04-07 17:36:41,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {1286#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1286#(= main_~x~0 0)} is VALID [2022-04-07 17:36:41,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {1286#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1287#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:41,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {1287#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1287#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:41,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {1287#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1288#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:41,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {1288#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1288#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:41,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {1288#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1289#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:36:41,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {1289#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1289#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:36:41,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {1289#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1290#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:36:41,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {1290#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1290#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:36:41,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {1290#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1291#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:36:41,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {1291#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1291#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:36:41,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {1291#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1292#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:36:41,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {1292#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1292#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:36:41,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {1292#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1293#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-07 17:36:41,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {1293#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1293#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-07 17:36:41,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {1293#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:41,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:41,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:41,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:41,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:41,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:41,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:41,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:41,978 INFO L290 TraceCheckUtils]: 29: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:41,978 INFO L290 TraceCheckUtils]: 30: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:41,978 INFO L290 TraceCheckUtils]: 31: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:41,978 INFO L290 TraceCheckUtils]: 32: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:41,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:41,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:41,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:41,978 INFO L290 TraceCheckUtils]: 36: Hoare triple {1282#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:41,979 INFO L272 TraceCheckUtils]: 37: Hoare triple {1282#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1282#false} is VALID [2022-04-07 17:36:41,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {1282#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] {1282#false} is VALID [2022-04-07 17:36:41,979 INFO L290 TraceCheckUtils]: 39: Hoare triple {1282#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[] {1282#false} is VALID [2022-04-07 17:36:41,979 INFO L290 TraceCheckUtils]: 40: Hoare triple {1282#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-07 17:36:41,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:36:41,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952664240] [2022-04-07 17:36:41,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952664240] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:36:41,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041024649] [2022-04-07 17:36:41,979 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 17:36:41,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:36:41,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:36:41,980 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:36:41,981 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:36:42,027 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 17:36:42,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 17:36:42,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 17:36:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:42,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:36:42,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {1281#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1281#true} is VALID [2022-04-07 17:36:42,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {1281#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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1281#true} is VALID [2022-04-07 17:36:42,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {1281#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1281#true} is VALID [2022-04-07 17:36:42,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1281#true} {1281#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1281#true} is VALID [2022-04-07 17:36:42,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {1281#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1281#true} is VALID [2022-04-07 17:36:42,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {1281#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1286#(= main_~x~0 0)} is VALID [2022-04-07 17:36:42,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {1286#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1286#(= main_~x~0 0)} is VALID [2022-04-07 17:36:42,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {1286#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1287#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:42,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {1287#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1287#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:42,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {1287#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1288#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:42,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {1288#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1288#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:42,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {1288#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1289#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:36:42,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {1289#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1289#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:36:42,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {1289#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1290#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:36:42,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {1290#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1290#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:36:42,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {1290#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1291#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:36:42,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {1291#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1291#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:36:42,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {1291#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1292#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:36:42,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {1292#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1292#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:36:42,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {1292#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1355#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 17:36:42,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {1355#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1355#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 17:36:42,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {1355#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {1282#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,312 INFO L272 TraceCheckUtils]: 37: Hoare triple {1282#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {1282#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] {1282#false} is VALID [2022-04-07 17:36:42,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {1282#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[] {1282#false} is VALID [2022-04-07 17:36:42,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {1282#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-07 17:36:42,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:36:42,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {1282#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {1282#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[] {1282#false} is VALID [2022-04-07 17:36:42,682 INFO L290 TraceCheckUtils]: 38: Hoare triple {1282#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] {1282#false} is VALID [2022-04-07 17:36:42,682 INFO L272 TraceCheckUtils]: 37: Hoare triple {1282#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {1282#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {1282#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {1282#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1282#false} is VALID [2022-04-07 17:36:42,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {1476#(< (mod main_~x~0 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1282#false} is VALID [2022-04-07 17:36:42,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {1480#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1476#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-07 17:36:42,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {1484#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1480#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-07 17:36:42,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {1484#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1484#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:42,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {1491#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1484#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:42,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {1491#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1491#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:42,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {1498#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1491#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:42,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {1498#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1498#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-07 17:36:42,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {1505#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1498#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-07 17:36:42,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {1505#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1505#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:42,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {1512#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1505#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:42,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {1512#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1512#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-07 17:36:42,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {1519#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1512#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-07 17:36:42,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {1519#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1519#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-07 17:36:42,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {1526#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1519#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-07 17:36:42,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {1526#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1526#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-07 17:36:42,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {1281#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1526#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-07 17:36:42,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {1281#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1281#true} is VALID [2022-04-07 17:36:42,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1281#true} {1281#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1281#true} is VALID [2022-04-07 17:36:42,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {1281#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1281#true} is VALID [2022-04-07 17:36:42,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {1281#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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1281#true} is VALID [2022-04-07 17:36:42,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {1281#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1281#true} is VALID [2022-04-07 17:36:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-07 17:36:42,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041024649] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:36:42,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:36:42,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 21 [2022-04-07 17:36:42,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789133407] [2022-04-07 17:36:42,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:36:42,693 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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 41 [2022-04-07 17:36:42,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:36:42,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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:36:42,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:36:42,729 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-07 17:36:42,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:36:42,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-07 17:36:42,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2022-04-07 17:36:42,730 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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:36:45,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:45,912 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-07 17:36:45,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-07 17:36:45,912 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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 41 [2022-04-07 17:36:45,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:36:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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:36:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions. [2022-04-07 17:36:45,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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:36:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions. [2022-04-07 17:36:45,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 56 transitions. [2022-04-07 17:36:46,030 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:36:46,035 INFO L225 Difference]: With dead ends: 70 [2022-04-07 17:36:46,035 INFO L226 Difference]: Without dead ends: 70 [2022-04-07 17:36:46,036 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=421, Invalid=985, Unknown=0, NotChecked=0, Total=1406 [2022-04-07 17:36:46,036 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 17:36:46,036 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 59 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 17:36:46,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-07 17:36:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-07 17:36:46,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:36:46,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 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:36:46,040 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 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:36:46,040 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 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:36:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:46,041 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-07 17:36:46,041 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-07 17:36:46,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:36:46,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:36:46,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 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 70 states. [2022-04-07 17:36:46,042 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 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 70 states. [2022-04-07 17:36:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:36:46,044 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-07 17:36:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-07 17:36:46,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:36:46,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:36:46,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:36:46,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:36:46,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.123076923076923) internal successors, (73), 65 states have internal predecessors, (73), 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:36:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2022-04-07 17:36:46,046 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 41 [2022-04-07 17:36:46,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:36:46,046 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2022-04-07 17:36:46,046 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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:36:46,046 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-07 17:36:46,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-07 17:36:46,047 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:36:46,047 INFO L499 BasicCegarLoop]: trace histogram [25, 17, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:36:46,064 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:36:46,252 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:36:46,253 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:36:46,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:36:46,253 INFO L85 PathProgramCache]: Analyzing trace with hash 249795404, now seen corresponding path program 5 times [2022-04-07 17:36:46,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:36:46,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618369524] [2022-04-07 17:36:46,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:36:46,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:36:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:46,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:36:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:46,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {1887#(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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1864#true} is VALID [2022-04-07 17:36:46,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {1864#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1864#true} is VALID [2022-04-07 17:36:46,604 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1864#true} {1864#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1864#true} is VALID [2022-04-07 17:36:46,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {1864#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1887#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:36:46,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {1887#(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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1864#true} is VALID [2022-04-07 17:36:46,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {1864#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1864#true} is VALID [2022-04-07 17:36:46,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1864#true} {1864#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1864#true} is VALID [2022-04-07 17:36:46,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {1864#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1864#true} is VALID [2022-04-07 17:36:46,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {1864#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1869#(= main_~x~0 0)} is VALID [2022-04-07 17:36:46,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {1869#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1869#(= main_~x~0 0)} is VALID [2022-04-07 17:36:46,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {1869#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1870#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:46,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {1870#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1870#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:46,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {1870#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:46,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {1871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:46,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {1871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1872#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:36:46,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {1872#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1872#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:36:46,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {1872#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1873#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:36:46,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {1873#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1873#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:36:46,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {1873#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1874#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:36:46,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {1874#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1874#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:36:46,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {1874#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1875#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:36:46,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {1875#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1875#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:36:46,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {1875#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1876#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 17:36:46,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {1876#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1876#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 17:36:46,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {1876#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1877#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 17:36:46,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {1877#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1877#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 17:36:46,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {1877#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1878#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 17:36:46,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {1878#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1878#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 17:36:46,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {1878#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1879#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 17:36:46,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {1879#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1879#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 17:36:46,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {1879#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1880#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 17:36:46,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {1880#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1880#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 17:36:46,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {1880#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1881#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 17:36:46,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {1881#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1881#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 17:36:46,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {1881#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1882#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 17:36:46,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {1882#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1882#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 17:36:46,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {1882#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1883#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 17:36:46,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {1883#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1883#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 17:36:46,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {1883#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1884#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 17:36:46,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {1884#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1884#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 17:36:46,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {1884#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1885#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 17:36:46,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {1885#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1885#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 17:36:46,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {1885#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1886#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-07 17:36:46,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {1886#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1886#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-07 17:36:46,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {1886#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:46,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {1865#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:46,619 INFO L290 TraceCheckUtils]: 43: Hoare triple {1865#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:46,619 INFO L290 TraceCheckUtils]: 44: Hoare triple {1865#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:46,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {1865#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:46,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {1865#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:46,620 INFO L290 TraceCheckUtils]: 47: Hoare triple {1865#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:46,620 INFO L290 TraceCheckUtils]: 48: Hoare triple {1865#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:46,620 INFO L290 TraceCheckUtils]: 49: Hoare triple {1865#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:46,620 INFO L290 TraceCheckUtils]: 50: Hoare triple {1865#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:46,620 INFO L290 TraceCheckUtils]: 51: Hoare triple {1865#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:46,620 INFO L290 TraceCheckUtils]: 52: Hoare triple {1865#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:46,620 INFO L290 TraceCheckUtils]: 53: Hoare triple {1865#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:46,620 INFO L290 TraceCheckUtils]: 54: Hoare triple {1865#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:46,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {1865#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:46,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {1865#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:46,620 INFO L272 TraceCheckUtils]: 57: Hoare triple {1865#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1865#false} is VALID [2022-04-07 17:36:46,620 INFO L290 TraceCheckUtils]: 58: Hoare triple {1865#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] {1865#false} is VALID [2022-04-07 17:36:46,620 INFO L290 TraceCheckUtils]: 59: Hoare triple {1865#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[] {1865#false} is VALID [2022-04-07 17:36:46,621 INFO L290 TraceCheckUtils]: 60: Hoare triple {1865#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 270 proven. 306 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-07 17:36:46,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:36:46,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618369524] [2022-04-07 17:36:46,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618369524] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:36:46,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685545750] [2022-04-07 17:36:46,621 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 17:36:46,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:36:46,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:36:46,622 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:36:46,623 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:36:48,547 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2022-04-07 17:36:48,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 17:36:48,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-07 17:36:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:36:48,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:36:49,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {1864#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1864#true} is VALID [2022-04-07 17:36:49,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {1864#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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1864#true} is VALID [2022-04-07 17:36:49,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {1864#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1864#true} is VALID [2022-04-07 17:36:49,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1864#true} {1864#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1864#true} is VALID [2022-04-07 17:36:49,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {1864#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1864#true} is VALID [2022-04-07 17:36:49,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {1864#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1869#(= main_~x~0 0)} is VALID [2022-04-07 17:36:49,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {1869#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1869#(= main_~x~0 0)} is VALID [2022-04-07 17:36:49,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {1869#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1870#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:49,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {1870#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1870#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:36:49,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {1870#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:49,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {1871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:36:49,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {1871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1872#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:36:49,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {1872#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1872#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:36:49,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {1872#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1873#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:36:49,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {1873#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1873#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:36:49,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {1873#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1874#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:36:49,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {1874#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1874#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:36:49,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {1874#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1875#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:36:49,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {1875#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1875#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:36:49,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {1875#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1876#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 17:36:49,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {1876#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1876#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 17:36:49,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {1876#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1877#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 17:36:49,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {1877#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1877#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 17:36:49,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {1877#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1878#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 17:36:49,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {1878#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1878#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 17:36:49,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {1878#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1879#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 17:36:49,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {1879#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1879#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 17:36:49,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {1879#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1880#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 17:36:49,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {1880#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1880#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 17:36:49,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {1880#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1881#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 17:36:49,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {1881#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1881#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 17:36:49,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {1881#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1882#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 17:36:49,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {1882#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1882#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 17:36:49,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {1882#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1883#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 17:36:49,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {1883#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1883#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 17:36:49,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {1883#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1884#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 17:36:49,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {1884#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1884#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 17:36:49,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {1884#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1885#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 17:36:49,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {1885#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1885#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 17:36:49,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {1885#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2008#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 17:36:49,125 INFO L290 TraceCheckUtils]: 40: Hoare triple {2008#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2008#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 17:36:49,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {2008#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2015#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 17:36:49,126 INFO L290 TraceCheckUtils]: 42: Hoare triple {2015#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2015#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 17:36:49,127 INFO L290 TraceCheckUtils]: 43: Hoare triple {2015#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2022#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 17:36:49,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {2022#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2022#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 17:36:49,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {2022#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2029#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 17:36:49,129 INFO L290 TraceCheckUtils]: 46: Hoare triple {2029#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2029#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 17:36:49,130 INFO L290 TraceCheckUtils]: 47: Hoare triple {2029#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:49,130 INFO L290 TraceCheckUtils]: 48: Hoare triple {1865#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:49,130 INFO L290 TraceCheckUtils]: 49: Hoare triple {1865#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:49,130 INFO L290 TraceCheckUtils]: 50: Hoare triple {1865#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:49,130 INFO L290 TraceCheckUtils]: 51: Hoare triple {1865#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:49,130 INFO L290 TraceCheckUtils]: 52: Hoare triple {1865#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:49,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {1865#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:49,130 INFO L290 TraceCheckUtils]: 54: Hoare triple {1865#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:49,130 INFO L290 TraceCheckUtils]: 55: Hoare triple {1865#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:49,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {1865#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:49,130 INFO L272 TraceCheckUtils]: 57: Hoare triple {1865#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1865#false} is VALID [2022-04-07 17:36:49,130 INFO L290 TraceCheckUtils]: 58: Hoare triple {1865#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] {1865#false} is VALID [2022-04-07 17:36:49,130 INFO L290 TraceCheckUtils]: 59: Hoare triple {1865#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[] {1865#false} is VALID [2022-04-07 17:36:49,131 INFO L290 TraceCheckUtils]: 60: Hoare triple {1865#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 189 proven. 420 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 17:36:49,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:36:50,530 INFO L290 TraceCheckUtils]: 60: Hoare triple {1865#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:50,531 INFO L290 TraceCheckUtils]: 59: Hoare triple {1865#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[] {1865#false} is VALID [2022-04-07 17:36:50,531 INFO L290 TraceCheckUtils]: 58: Hoare triple {1865#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] {1865#false} is VALID [2022-04-07 17:36:50,531 INFO L272 TraceCheckUtils]: 57: Hoare triple {1865#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1865#false} is VALID [2022-04-07 17:36:50,531 INFO L290 TraceCheckUtils]: 56: Hoare triple {1865#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:50,531 INFO L290 TraceCheckUtils]: 55: Hoare triple {1865#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:50,531 INFO L290 TraceCheckUtils]: 54: Hoare triple {1865#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:50,531 INFO L290 TraceCheckUtils]: 53: Hoare triple {1865#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:50,531 INFO L290 TraceCheckUtils]: 52: Hoare triple {1865#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:50,531 INFO L290 TraceCheckUtils]: 51: Hoare triple {1865#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:50,531 INFO L290 TraceCheckUtils]: 50: Hoare triple {1865#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:50,531 INFO L290 TraceCheckUtils]: 49: Hoare triple {1865#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:50,531 INFO L290 TraceCheckUtils]: 48: Hoare triple {1865#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1865#false} is VALID [2022-04-07 17:36:50,539 INFO L290 TraceCheckUtils]: 47: Hoare triple {2114#(< (mod main_~x~0 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1865#false} is VALID [2022-04-07 17:36:50,540 INFO L290 TraceCheckUtils]: 46: Hoare triple {2118#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2114#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-07 17:36:50,541 INFO L290 TraceCheckUtils]: 45: Hoare triple {2122#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2118#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,541 INFO L290 TraceCheckUtils]: 44: Hoare triple {2122#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2122#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {2129#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2122#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {2129#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2129#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,543 INFO L290 TraceCheckUtils]: 41: Hoare triple {2136#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2129#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,543 INFO L290 TraceCheckUtils]: 40: Hoare triple {2136#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2136#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-07 17:36:50,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {2143#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2136#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-07 17:36:50,544 INFO L290 TraceCheckUtils]: 38: Hoare triple {2143#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2143#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-07 17:36:50,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {2150#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2143#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-07 17:36:50,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {2150#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2150#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-07 17:36:50,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {2157#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2150#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-07 17:36:50,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {2157#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2157#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {2164#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2157#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {2164#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2164#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {2171#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2164#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {2171#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2171#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-07 17:36:50,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {2178#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2171#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-07 17:36:50,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {2178#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2178#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-07 17:36:50,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {2185#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2178#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-07 17:36:50,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {2185#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2185#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {2192#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2185#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {2192#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2192#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {2199#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2192#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {2199#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2199#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {2206#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2199#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {2206#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2206#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {2213#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2206#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {2213#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2213#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {2220#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2213#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {2220#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2220#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {2227#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2220#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {2227#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2227#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2227#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {2234#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2234#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {2241#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2234#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {2241#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2241#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {2248#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2241#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {2248#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2248#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {2255#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2248#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {2255#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2255#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {1864#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {2255#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-07 17:36:50,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {1864#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1864#true} is VALID [2022-04-07 17:36:50,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1864#true} {1864#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1864#true} is VALID [2022-04-07 17:36:50,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {1864#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1864#true} is VALID [2022-04-07 17:36:50,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {1864#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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1864#true} is VALID [2022-04-07 17:36:50,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {1864#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1864#true} is VALID [2022-04-07 17:36:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 189 proven. 420 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 17:36:50,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685545750] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:36:50,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:36:50,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 24] total 47 [2022-04-07 17:36:50,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767668783] [2022-04-07 17:36:50,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:36:50,563 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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 61 [2022-04-07 17:36:50,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:36:50,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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:36:50,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:36:50,660 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-07 17:36:50,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:36:50,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-07 17:36:50,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=594, Invalid=1568, Unknown=0, NotChecked=0, Total=2162 [2022-04-07 17:36:50,662 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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:38:16,376 WARN L232 SmtUtils]: Spent 7.07s on a formula simplification. DAG size of input: 156 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 17:38:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:38:16,525 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-04-07 17:38:16,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-07 17:38:16,526 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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 61 [2022-04-07 17:38:16,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:38:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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:38:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 115 transitions. [2022-04-07 17:38:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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:38:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 115 transitions. [2022-04-07 17:38:16,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 115 transitions. [2022-04-07 17:38:16,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:38:16,713 INFO L225 Difference]: With dead ends: 116 [2022-04-07 17:38:16,713 INFO L226 Difference]: Without dead ends: 116 [2022-04-07 17:38:16,715 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 85.0s TimeCoverageRelationStatistics Valid=2026, Invalid=5456, Unknown=0, NotChecked=0, Total=7482 [2022-04-07 17:38:16,715 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-07 17:38:16,715 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 124 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-07 17:38:16,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-07 17:38:16,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-07 17:38:16,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:38:16,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 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:38:16,720 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 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:38:16,720 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 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:38:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:38:16,722 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-04-07 17:38:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-04-07 17:38:16,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:38:16,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:38:16,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 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 116 states. [2022-04-07 17:38:16,723 INFO L87 Difference]: Start difference. First operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 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 116 states. [2022-04-07 17:38:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:38:16,725 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-04-07 17:38:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-04-07 17:38:16,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:38:16,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:38:16,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:38:16,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:38:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.072072072072072) internal successors, (119), 111 states have internal predecessors, (119), 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:38:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2022-04-07 17:38:16,728 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 61 [2022-04-07 17:38:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:38:16,728 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2022-04-07 17:38:16,728 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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:38:16,729 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-04-07 17:38:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-07 17:38:16,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:38:16,730 INFO L499 BasicCegarLoop]: trace histogram [47, 39, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:38:16,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-07 17:38:16,935 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:38:16,935 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:38:16,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:38:16,935 INFO L85 PathProgramCache]: Analyzing trace with hash -371956704, now seen corresponding path program 6 times [2022-04-07 17:38:16,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:38:16,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032960813] [2022-04-07 17:38:16,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:38:16,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:38:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:38:17,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:38:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:38:17,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {2868#(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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2823#true} is VALID [2022-04-07 17:38:17,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {2823#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:17,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2823#true} {2823#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:17,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {2823#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:38:17,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {2868#(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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2823#true} is VALID [2022-04-07 17:38:17,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {2823#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:17,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2823#true} {2823#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:17,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {2823#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:17,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {2823#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {2828#(= main_~x~0 0)} is VALID [2022-04-07 17:38:17,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {2828#(= main_~x~0 0)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2828#(= main_~x~0 0)} is VALID [2022-04-07 17:38:17,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {2828#(= main_~x~0 0)} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2829#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:38:17,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {2829#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2829#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-07 17:38:17,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {2829#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:38:17,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {2830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-07 17:38:17,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {2830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2831#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:38:17,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {2831#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2831#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-07 17:38:17,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {2831#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2832#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:38:17,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {2832#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2832#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-07 17:38:17,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {2832#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2833#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:38:17,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {2833#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2833#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-07 17:38:17,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {2833#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2834#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:38:17,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {2834#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2834#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-07 17:38:17,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {2834#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2835#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 17:38:17,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {2835#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2835#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-07 17:38:17,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {2835#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2836#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 17:38:17,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {2836#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2836#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-07 17:38:17,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {2836#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2837#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 17:38:17,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {2837#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2837#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-07 17:38:17,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {2837#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2838#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 17:38:17,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {2838#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2838#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-07 17:38:17,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {2838#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2839#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 17:38:17,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {2839#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2839#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-07 17:38:17,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {2839#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2840#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 17:38:17,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {2840#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2840#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-07 17:38:17,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {2840#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2841#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 17:38:17,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {2841#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2841#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-07 17:38:17,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {2841#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2842#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 17:38:17,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {2842#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2842#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-07 17:38:17,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {2842#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2843#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 17:38:17,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {2843#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2843#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-07 17:38:17,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {2843#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2844#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 17:38:17,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {2844#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2844#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-07 17:38:17,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {2844#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2845#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 17:38:17,976 INFO L290 TraceCheckUtils]: 40: Hoare triple {2845#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2845#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-07 17:38:17,976 INFO L290 TraceCheckUtils]: 41: Hoare triple {2845#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2846#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 17:38:17,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {2846#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2846#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-07 17:38:17,977 INFO L290 TraceCheckUtils]: 43: Hoare triple {2846#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2847#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 17:38:17,978 INFO L290 TraceCheckUtils]: 44: Hoare triple {2847#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2847#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-07 17:38:17,978 INFO L290 TraceCheckUtils]: 45: Hoare triple {2847#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2848#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 17:38:17,979 INFO L290 TraceCheckUtils]: 46: Hoare triple {2848#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2848#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-07 17:38:17,980 INFO L290 TraceCheckUtils]: 47: Hoare triple {2848#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2849#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 17:38:17,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {2849#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2849#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-07 17:38:17,981 INFO L290 TraceCheckUtils]: 49: Hoare triple {2849#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2850#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 17:38:17,982 INFO L290 TraceCheckUtils]: 50: Hoare triple {2850#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2850#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-07 17:38:17,982 INFO L290 TraceCheckUtils]: 51: Hoare triple {2850#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2851#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 17:38:17,983 INFO L290 TraceCheckUtils]: 52: Hoare triple {2851#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2851#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-07 17:38:17,983 INFO L290 TraceCheckUtils]: 53: Hoare triple {2851#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2852#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 17:38:17,983 INFO L290 TraceCheckUtils]: 54: Hoare triple {2852#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2852#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-07 17:38:17,984 INFO L290 TraceCheckUtils]: 55: Hoare triple {2852#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2853#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-07 17:38:17,984 INFO L290 TraceCheckUtils]: 56: Hoare triple {2853#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2853#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-07 17:38:17,985 INFO L290 TraceCheckUtils]: 57: Hoare triple {2853#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2854#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 17:38:17,985 INFO L290 TraceCheckUtils]: 58: Hoare triple {2854#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2854#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-07 17:38:17,985 INFO L290 TraceCheckUtils]: 59: Hoare triple {2854#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2855#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-07 17:38:17,986 INFO L290 TraceCheckUtils]: 60: Hoare triple {2855#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2855#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-07 17:38:17,986 INFO L290 TraceCheckUtils]: 61: Hoare triple {2855#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2856#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-07 17:38:17,987 INFO L290 TraceCheckUtils]: 62: Hoare triple {2856#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2856#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-07 17:38:17,987 INFO L290 TraceCheckUtils]: 63: Hoare triple {2856#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2857#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-07 17:38:17,987 INFO L290 TraceCheckUtils]: 64: Hoare triple {2857#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2857#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-07 17:38:17,988 INFO L290 TraceCheckUtils]: 65: Hoare triple {2857#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2858#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-07 17:38:17,988 INFO L290 TraceCheckUtils]: 66: Hoare triple {2858#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2858#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-07 17:38:17,989 INFO L290 TraceCheckUtils]: 67: Hoare triple {2858#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2859#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-07 17:38:17,989 INFO L290 TraceCheckUtils]: 68: Hoare triple {2859#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2859#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-07 17:38:17,989 INFO L290 TraceCheckUtils]: 69: Hoare triple {2859#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2860#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-07 17:38:17,990 INFO L290 TraceCheckUtils]: 70: Hoare triple {2860#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2860#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-07 17:38:17,990 INFO L290 TraceCheckUtils]: 71: Hoare triple {2860#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2861#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-07 17:38:17,991 INFO L290 TraceCheckUtils]: 72: Hoare triple {2861#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2861#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-07 17:38:17,991 INFO L290 TraceCheckUtils]: 73: Hoare triple {2861#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2862#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-07 17:38:17,991 INFO L290 TraceCheckUtils]: 74: Hoare triple {2862#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2862#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-07 17:38:17,992 INFO L290 TraceCheckUtils]: 75: Hoare triple {2862#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2863#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-07 17:38:17,992 INFO L290 TraceCheckUtils]: 76: Hoare triple {2863#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2863#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-07 17:38:17,993 INFO L290 TraceCheckUtils]: 77: Hoare triple {2863#(and (<= 35 main_~x~0) (<= main_~x~0 35))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2864#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-07 17:38:17,993 INFO L290 TraceCheckUtils]: 78: Hoare triple {2864#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2864#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-07 17:38:17,993 INFO L290 TraceCheckUtils]: 79: Hoare triple {2864#(and (<= main_~x~0 36) (<= 36 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2865#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-07 17:38:17,994 INFO L290 TraceCheckUtils]: 80: Hoare triple {2865#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2865#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-07 17:38:17,994 INFO L290 TraceCheckUtils]: 81: Hoare triple {2865#(and (<= main_~x~0 37) (<= 37 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2866#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-07 17:38:17,994 INFO L290 TraceCheckUtils]: 82: Hoare triple {2866#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2866#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-07 17:38:17,995 INFO L290 TraceCheckUtils]: 83: Hoare triple {2866#(and (<= main_~x~0 38) (<= 38 main_~x~0))} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2867#(and (<= main_~x~0 39) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:38:17,995 INFO L290 TraceCheckUtils]: 84: Hoare triple {2867#(and (<= main_~x~0 39) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2867#(and (<= main_~x~0 39) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:38:17,996 INFO L290 TraceCheckUtils]: 85: Hoare triple {2867#(and (<= main_~x~0 39) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2824#false} is VALID [2022-04-07 17:38:17,996 INFO L290 TraceCheckUtils]: 86: Hoare triple {2824#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2824#false} is VALID [2022-04-07 17:38:17,996 INFO L290 TraceCheckUtils]: 87: Hoare triple {2824#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2824#false} is VALID [2022-04-07 17:38:17,996 INFO L290 TraceCheckUtils]: 88: Hoare triple {2824#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2824#false} is VALID [2022-04-07 17:38:17,996 INFO L290 TraceCheckUtils]: 89: Hoare triple {2824#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2824#false} is VALID [2022-04-07 17:38:17,996 INFO L290 TraceCheckUtils]: 90: Hoare triple {2824#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2824#false} is VALID [2022-04-07 17:38:17,996 INFO L290 TraceCheckUtils]: 91: Hoare triple {2824#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2824#false} is VALID [2022-04-07 17:38:17,996 INFO L290 TraceCheckUtils]: 92: Hoare triple {2824#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2824#false} is VALID [2022-04-07 17:38:17,996 INFO L290 TraceCheckUtils]: 93: Hoare triple {2824#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2824#false} is VALID [2022-04-07 17:38:17,996 INFO L290 TraceCheckUtils]: 94: Hoare triple {2824#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2824#false} is VALID [2022-04-07 17:38:17,996 INFO L290 TraceCheckUtils]: 95: Hoare triple {2824#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2824#false} is VALID [2022-04-07 17:38:17,997 INFO L290 TraceCheckUtils]: 96: Hoare triple {2824#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2824#false} is VALID [2022-04-07 17:38:17,997 INFO L290 TraceCheckUtils]: 97: Hoare triple {2824#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2824#false} is VALID [2022-04-07 17:38:17,997 INFO L290 TraceCheckUtils]: 98: Hoare triple {2824#false} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2824#false} is VALID [2022-04-07 17:38:17,997 INFO L290 TraceCheckUtils]: 99: Hoare triple {2824#false} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2824#false} is VALID [2022-04-07 17:38:17,997 INFO L290 TraceCheckUtils]: 100: Hoare triple {2824#false} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2824#false} is VALID [2022-04-07 17:38:17,997 INFO L272 TraceCheckUtils]: 101: Hoare triple {2824#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {2824#false} is VALID [2022-04-07 17:38:17,997 INFO L290 TraceCheckUtils]: 102: Hoare triple {2824#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] {2824#false} is VALID [2022-04-07 17:38:17,997 INFO L290 TraceCheckUtils]: 103: Hoare triple {2824#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[] {2824#false} is VALID [2022-04-07 17:38:17,997 INFO L290 TraceCheckUtils]: 104: Hoare triple {2824#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2824#false} is VALID [2022-04-07 17:38:17,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 600 proven. 1560 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-07 17:38:17,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:38:17,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032960813] [2022-04-07 17:38:17,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032960813] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:38:17,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931680400] [2022-04-07 17:38:17,998 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-07 17:38:17,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:38:17,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:38:17,999 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:38:18,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-07 17:38:20,099 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2022-04-07 17:38:20,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 17:38:20,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 17:38:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:38:20,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:38:20,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {2823#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {2823#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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2823#true} is VALID [2022-04-07 17:38:20,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {2823#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2823#true} {2823#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {2823#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {2823#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {2823#true} is VALID [2022-04-07 17:38:20,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,771 INFO L290 TraceCheckUtils]: 39: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,771 INFO L290 TraceCheckUtils]: 40: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,771 INFO L290 TraceCheckUtils]: 46: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,771 INFO L290 TraceCheckUtils]: 47: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,772 INFO L290 TraceCheckUtils]: 50: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,772 INFO L290 TraceCheckUtils]: 51: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,772 INFO L290 TraceCheckUtils]: 53: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,772 INFO L290 TraceCheckUtils]: 54: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,772 INFO L290 TraceCheckUtils]: 55: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,772 INFO L290 TraceCheckUtils]: 56: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,772 INFO L290 TraceCheckUtils]: 57: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,772 INFO L290 TraceCheckUtils]: 58: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,772 INFO L290 TraceCheckUtils]: 59: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,772 INFO L290 TraceCheckUtils]: 60: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,772 INFO L290 TraceCheckUtils]: 61: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,772 INFO L290 TraceCheckUtils]: 62: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,772 INFO L290 TraceCheckUtils]: 63: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,772 INFO L290 TraceCheckUtils]: 64: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,772 INFO L290 TraceCheckUtils]: 65: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 66: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 67: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 68: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 69: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 70: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 71: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 72: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 73: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 74: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 75: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 76: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 77: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 78: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 79: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 80: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 81: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:20,773 INFO L290 TraceCheckUtils]: 82: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:20,774 INFO L290 TraceCheckUtils]: 83: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3121#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-07 17:38:20,775 INFO L290 TraceCheckUtils]: 84: Hoare triple {3121#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3121#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-07 17:38:20,775 INFO L290 TraceCheckUtils]: 85: Hoare triple {3121#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3128#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-07 17:38:20,776 INFO L290 TraceCheckUtils]: 86: Hoare triple {3128#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3128#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-07 17:38:20,776 INFO L290 TraceCheckUtils]: 87: Hoare triple {3128#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3135#(< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-07 17:38:20,791 INFO L290 TraceCheckUtils]: 88: Hoare triple {3135#(< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3135#(< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-07 17:38:20,792 INFO L290 TraceCheckUtils]: 89: Hoare triple {3135#(< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3142#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} is VALID [2022-04-07 17:38:20,793 INFO L290 TraceCheckUtils]: 90: Hoare triple {3142#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3142#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} is VALID [2022-04-07 17:38:20,793 INFO L290 TraceCheckUtils]: 91: Hoare triple {3142#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3149#(< (mod (+ main_~x~0 4294967287) 4294967296) 10000000)} is VALID [2022-04-07 17:38:20,794 INFO L290 TraceCheckUtils]: 92: Hoare triple {3149#(< (mod (+ main_~x~0 4294967287) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3149#(< (mod (+ main_~x~0 4294967287) 4294967296) 10000000)} is VALID [2022-04-07 17:38:20,799 INFO L290 TraceCheckUtils]: 93: Hoare triple {3149#(< (mod (+ main_~x~0 4294967287) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3156#(< (mod (+ main_~x~0 4294967285) 4294967296) 10000000)} is VALID [2022-04-07 17:38:20,800 INFO L290 TraceCheckUtils]: 94: Hoare triple {3156#(< (mod (+ main_~x~0 4294967285) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3156#(< (mod (+ main_~x~0 4294967285) 4294967296) 10000000)} is VALID [2022-04-07 17:38:20,802 INFO L290 TraceCheckUtils]: 95: Hoare triple {3156#(< (mod (+ main_~x~0 4294967285) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3163#(< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-07 17:38:20,802 INFO L290 TraceCheckUtils]: 96: Hoare triple {3163#(< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3163#(< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000)} is VALID [2022-04-07 17:38:20,803 INFO L290 TraceCheckUtils]: 97: Hoare triple {3163#(< (mod (+ 4294967283 main_~x~0) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3170#(< (mod (+ main_~x~0 4294967281) 4294967296) 10000000)} is VALID [2022-04-07 17:38:20,803 INFO L290 TraceCheckUtils]: 98: Hoare triple {3170#(< (mod (+ main_~x~0 4294967281) 4294967296) 10000000)} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3170#(< (mod (+ main_~x~0 4294967281) 4294967296) 10000000)} is VALID [2022-04-07 17:38:20,808 INFO L290 TraceCheckUtils]: 99: Hoare triple {3170#(< (mod (+ main_~x~0 4294967281) 4294967296) 10000000)} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3177#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ main_~x~0 4294967279) 4294967296) 10000000))} is VALID [2022-04-07 17:38:20,813 INFO L290 TraceCheckUtils]: 100: Hoare triple {3177#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ main_~x~0 4294967279) 4294967296) 10000000))} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2824#false} is VALID [2022-04-07 17:38:20,814 INFO L272 TraceCheckUtils]: 101: Hoare triple {2824#false} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {2824#false} is VALID [2022-04-07 17:38:20,814 INFO L290 TraceCheckUtils]: 102: Hoare triple {2824#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] {2824#false} is VALID [2022-04-07 17:38:20,814 INFO L290 TraceCheckUtils]: 103: Hoare triple {2824#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[] {2824#false} is VALID [2022-04-07 17:38:20,814 INFO L290 TraceCheckUtils]: 104: Hoare triple {2824#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2824#false} is VALID [2022-04-07 17:38:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 663 proven. 64 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2022-04-07 17:38:20,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:38:23,298 INFO L290 TraceCheckUtils]: 104: Hoare triple {2824#false} [63] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2824#false} is VALID [2022-04-07 17:38:23,299 INFO L290 TraceCheckUtils]: 103: Hoare triple {3196#(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[] {2824#false} is VALID [2022-04-07 17:38:23,299 INFO L290 TraceCheckUtils]: 102: Hoare triple {3200#(< 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] {3196#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:38:23,300 INFO L272 TraceCheckUtils]: 101: Hoare triple {3204#(= (mod main_~x~0 2) 0)} [55] L8-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {3200#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:38:23,300 INFO L290 TraceCheckUtils]: 100: Hoare triple {3208#(or (< (mod main_~x~0 4294967296) 100000000) (= (mod main_~x~0 2) 0))} [53] L9-2-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3204#(= (mod main_~x~0 2) 0)} is VALID [2022-04-07 17:38:23,301 INFO L290 TraceCheckUtils]: 99: Hoare triple {3212#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3208#(or (< (mod main_~x~0 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 17:38:23,301 INFO L290 TraceCheckUtils]: 98: Hoare triple {3216#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3212#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 17:38:23,332 INFO L290 TraceCheckUtils]: 97: Hoare triple {3220#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3216#(or (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 17:38:23,333 INFO L290 TraceCheckUtils]: 96: Hoare triple {3220#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3220#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 17:38:23,334 INFO L290 TraceCheckUtils]: 95: Hoare triple {3227#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3220#(or (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)) (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 17:38:23,334 INFO L290 TraceCheckUtils]: 94: Hoare triple {3227#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3227#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-07 17:38:23,367 INFO L290 TraceCheckUtils]: 93: Hoare triple {3234#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3227#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= (mod main_~x~0 2) 0) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-07 17:38:23,368 INFO L290 TraceCheckUtils]: 92: Hoare triple {3234#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3234#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 17:38:23,369 INFO L290 TraceCheckUtils]: 91: Hoare triple {3241#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3234#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 17:38:23,370 INFO L290 TraceCheckUtils]: 90: Hoare triple {3241#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3241#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 17:38:23,371 INFO L290 TraceCheckUtils]: 89: Hoare triple {3248#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3241#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 17:38:23,371 INFO L290 TraceCheckUtils]: 88: Hoare triple {3248#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3248#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 17:38:23,372 INFO L290 TraceCheckUtils]: 87: Hoare triple {3255#(or (< (mod (+ main_~x~0 14) 4294967296) 100000000) (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3248#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 17:38:23,372 INFO L290 TraceCheckUtils]: 86: Hoare triple {3255#(or (< (mod (+ main_~x~0 14) 4294967296) 100000000) (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3255#(or (< (mod (+ main_~x~0 14) 4294967296) 100000000) (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 17:38:23,375 INFO L290 TraceCheckUtils]: 85: Hoare triple {3262#(or (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)) (< (mod (+ main_~x~0 16) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} [57] L9-->L9-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 10000000))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3255#(or (< (mod (+ main_~x~0 14) 4294967296) 100000000) (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 17:38:23,376 INFO L290 TraceCheckUtils]: 84: Hoare triple {3262#(or (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)) (< (mod (+ main_~x~0 16) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3262#(or (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)) (< (mod (+ main_~x~0 16) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 17:38:23,377 INFO L290 TraceCheckUtils]: 83: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3262#(or (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)) (< (mod (+ main_~x~0 16) 4294967296) 100000000) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 17:38:23,377 INFO L290 TraceCheckUtils]: 82: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,377 INFO L290 TraceCheckUtils]: 81: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 80: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 79: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 78: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 77: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 76: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 75: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 74: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 73: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 72: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 71: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 70: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 69: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 68: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 67: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 66: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 65: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,378 INFO L290 TraceCheckUtils]: 64: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 61: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 60: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 59: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 58: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 57: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 56: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 55: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 54: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 53: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 52: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 51: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 50: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 46: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 45: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 44: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 39: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {2823#true} [56] L9-->L9-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 10000000) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2823#true} is VALID [2022-04-07 17:38:23,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {2823#true} [54] L9-2-->L9: Formula: (< (mod v_main_~x~0_1 4294967296) 100000000) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {2823#true} [50] mainENTRY-->L9-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {2823#true} is VALID [2022-04-07 17:38:23,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {2823#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2823#true} {2823#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {2823#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {2823#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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2823#true} is VALID [2022-04-07 17:38:23,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {2823#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2823#true} is VALID [2022-04-07 17:38:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 663 proven. 64 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2022-04-07 17:38:23,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931680400] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:38:23,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:38:23,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 11, 15] total 65 [2022-04-07 17:38:23,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220179598] [2022-04-07 17:38:23,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:38:23,385 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 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 105 [2022-04-07 17:38:23,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:38:23,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 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:38:23,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:38:23,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-07 17:38:23,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:38:23,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-07 17:38:23,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=935, Invalid=3225, Unknown=0, NotChecked=0, Total=4160 [2022-04-07 17:38:23,536 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 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:38:36,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:38:36,415 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2022-04-07 17:38:36,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-07 17:38:36,416 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 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 105 [2022-04-07 17:38:36,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:38:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 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:38:36,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 122 transitions. [2022-04-07 17:38:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 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:38:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 122 transitions. [2022-04-07 17:38:36,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 122 transitions. [2022-04-07 17:38:36,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:38:36,707 INFO L225 Difference]: With dead ends: 133 [2022-04-07 17:38:36,707 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 17:38:36,710 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=2162, Invalid=11644, Unknown=0, NotChecked=0, Total=13806 [2022-04-07 17:38:36,711 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 145 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-07 17:38:36,711 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 94 Invalid, 2726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 2329 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-07 17:38:36,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 17:38:36,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 17:38:36,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:38:36,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:38:36,711 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:38:36,711 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:38:36,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:38:36,712 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:38:36,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:38:36,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:38:36,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:38:36,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 17:38:36,712 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 17:38:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:38:36,712 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:38:36,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:38:36,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:38:36,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:38:36,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:38:36,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:38:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:38:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 17:38:36,712 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2022-04-07 17:38:36,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:38:36,712 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 17:38:36,713 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.046875) internal successors, (131), 63 states have internal predecessors, (131), 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:38:36,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:38:36,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:38:36,715 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 17:38:36,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-07 17:38:36,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:38:36,918 INFO L719 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-04-07 17:38:36,919 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 17:38:36,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:38:36 BasicIcfg [2022-04-07 17:38:36,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 17:38:36,922 INFO L158 Benchmark]: Toolchain (without parser) took 122808.44ms. Allocated memory was 190.8MB in the beginning and 239.1MB in the end (delta: 48.2MB). Free memory was 139.7MB in the beginning and 138.2MB in the end (delta: 1.5MB). Peak memory consumption was 49.5MB. Max. memory is 8.0GB. [2022-04-07 17:38:36,922 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory was 156.4MB in the beginning and 156.2MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:38:36,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.89ms. Allocated memory is still 190.8MB. Free memory was 139.6MB in the beginning and 166.7MB in the end (delta: -27.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 17:38:36,922 INFO L158 Benchmark]: Boogie Preprocessor took 36.25ms. Allocated memory is still 190.8MB. Free memory was 166.7MB in the beginning and 165.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 17:38:36,922 INFO L158 Benchmark]: RCFGBuilder took 211.19ms. Allocated memory is still 190.8MB. Free memory was 165.1MB in the beginning and 155.2MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-07 17:38:36,923 INFO L158 Benchmark]: IcfgTransformer took 18.59ms. Allocated memory is still 190.8MB. Free memory was 155.0MB in the beginning and 153.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 17:38:36,923 INFO L158 Benchmark]: TraceAbstraction took 122368.99ms. Allocated memory was 190.8MB in the beginning and 239.1MB in the end (delta: 48.2MB). Free memory was 153.1MB in the beginning and 138.2MB in the end (delta: 14.9MB). Peak memory consumption was 64.5MB. Max. memory is 8.0GB. [2022-04-07 17:38:36,924 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory was 156.4MB in the beginning and 156.2MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 168.89ms. Allocated memory is still 190.8MB. Free memory was 139.6MB in the beginning and 166.7MB in the end (delta: -27.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.25ms. Allocated memory is still 190.8MB. Free memory was 166.7MB in the beginning and 165.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 211.19ms. Allocated memory is still 190.8MB. Free memory was 165.1MB in the beginning and 155.2MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 18.59ms. Allocated memory is still 190.8MB. Free memory was 155.0MB in the beginning and 153.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 122368.99ms. Allocated memory was 190.8MB in the beginning and 239.1MB in the end (delta: 48.2MB). Free memory was 153.1MB in the beginning and 138.2MB in the end (delta: 14.9MB). Peak memory consumption was 64.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 122.3s, OverallIterations: 9, TraceHistogramMax: 47, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 105.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 385 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 384 mSDsluCounter, 471 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 364 mSDsCounter, 798 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3865 IncrementalHoareTripleChecker+Invalid, 4663 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 798 mSolverCounterUnsat, 107 mSDtfsCounter, 3865 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 846 GetRequests, 515 SyntacticMatches, 12 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2743 ImplicationChecksByTransitivity, 99.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=8, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 588 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 848 ConstructedInterpolants, 0 QuantifiedInterpolants, 3842 SizeOfPredicates, 6 NumberOfNonLiveVariables, 713 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 6330/9447 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-07 17:38:36,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...