/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:46:29,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:46:29,103 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:46:29,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:46:29,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:46:29,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:46:29,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:46:29,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:46:29,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:46:29,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:46:29,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:46:29,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:46:29,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:46:29,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:46:29,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:46:29,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:46:29,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:46:29,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:46:29,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:46:29,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:46:29,186 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:46:29,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:46:29,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:46:29,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:46:29,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:46:29,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:46:29,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:46:29,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:46:29,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:46:29,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:46:29,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:46:29,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:46:29,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:46:29,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:46:29,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:46:29,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:46:29,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:46:29,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:46:29,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:46:29,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:46:29,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:46:29,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:46:29,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:46:29,215 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:46:29,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:46:29,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:46:29,217 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:46:29,217 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:46:29,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:46:29,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:46:29,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:46:29,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:46:29,218 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:46:29,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:46:29,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:46:29,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:46:29,219 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:46:29,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:46:29,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:46:29,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:46:29,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:46:29,219 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:46:29,219 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:46:29,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:46:29,220 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:46:29,220 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-15 12:46:29,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:46:29,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:46:29,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:46:29,450 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:46:29,450 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:46:29,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2022-04-15 12:46:29,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07125239e/9c2fc9c8a3e845ee8ea7ad1934163e97/FLAG9b1b19bbb [2022-04-15 12:46:29,871 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:46:29,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2022-04-15 12:46:29,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07125239e/9c2fc9c8a3e845ee8ea7ad1934163e97/FLAG9b1b19bbb [2022-04-15 12:46:30,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07125239e/9c2fc9c8a3e845ee8ea7ad1934163e97 [2022-04-15 12:46:30,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:46:30,307 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:46:30,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:46:30,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:46:30,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:46:30,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:46:30" (1/1) ... [2022-04-15 12:46:30,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5076b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:30, skipping insertion in model container [2022-04-15 12:46:30,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:46:30" (1/1) ... [2022-04-15 12:46:30,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:46:30,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:46:30,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c[313,326] [2022-04-15 12:46:30,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:46:30,488 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:46:30,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c[313,326] [2022-04-15 12:46:30,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:46:30,511 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:46:30,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:30 WrapperNode [2022-04-15 12:46:30,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:46:30,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:46:30,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:46:30,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:46:30,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:30" (1/1) ... [2022-04-15 12:46:30,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:30" (1/1) ... [2022-04-15 12:46:30,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:30" (1/1) ... [2022-04-15 12:46:30,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:30" (1/1) ... [2022-04-15 12:46:30,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:30" (1/1) ... [2022-04-15 12:46:30,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:30" (1/1) ... [2022-04-15 12:46:30,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:30" (1/1) ... [2022-04-15 12:46:30,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:46:30,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:46:30,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:46:30,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:46:30,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:30" (1/1) ... [2022-04-15 12:46:30,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:46:30,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:30,574 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-15 12:46:30,575 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-15 12:46:30,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:46:30,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:46:30,602 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:46:30,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:46:30,603 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:46:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:46:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:46:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:46:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:46:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:46:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:46:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:46:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:46:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:46:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:46:30,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:46:30,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:46:30,664 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:46:30,666 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:46:30,782 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:46:30,804 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:46:30,804 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:46:30,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:46:30 BoogieIcfgContainer [2022-04-15 12:46:30,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:46:30,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:46:30,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:46:30,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:46:30,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:46:30" (1/3) ... [2022-04-15 12:46:30,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33401806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:46:30, skipping insertion in model container [2022-04-15 12:46:30,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:30" (2/3) ... [2022-04-15 12:46:30,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33401806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:46:30, skipping insertion in model container [2022-04-15 12:46:30,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:46:30" (3/3) ... [2022-04-15 12:46:30,815 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.c [2022-04-15 12:46:30,819 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:46:30,820 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:46:30,887 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:46:30,893 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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-15 12:46:30,893 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:46:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:46:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:46:30,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:30,935 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:30,937 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:30,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:30,946 INFO L85 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 1 times [2022-04-15 12:46:30,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:30,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1399682342] [2022-04-15 12:46:30,965 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:46:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 2 times [2022-04-15 12:46:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:30,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237214246] [2022-04-15 12:46:30,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:31,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:31,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-15 12:46:31,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:46:31,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #40#return; {22#true} is VALID [2022-04-15 12:46:31,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:31,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-15 12:46:31,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:46:31,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #40#return; {22#true} is VALID [2022-04-15 12:46:31,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret5 := main(); {22#true} is VALID [2022-04-15 12:46:31,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~x~0 := 0; {22#true} is VALID [2022-04-15 12:46:31,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-15 12:46:31,177 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {23#false} is VALID [2022-04-15 12:46:31,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-15 12:46:31,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-15 12:46:31,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-15 12:46:31,178 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-15 12:46:31,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:31,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237214246] [2022-04-15 12:46:31,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237214246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:31,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:31,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:46:31,184 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:31,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1399682342] [2022-04-15 12:46:31,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1399682342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:31,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:31,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:46:31,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118649530] [2022-04-15 12:46:31,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:31,190 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-15 12:46:31,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:31,195 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-15 12:46:31,212 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-15 12:46:31,213 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:46:31,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:31,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:46:31,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:46:31,246 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:31,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:31,356 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 12:46:31,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:46:31,356 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-15 12:46:31,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:31,358 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-15 12:46:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-15 12:46:31,369 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-15 12:46:31,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-15 12:46:31,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-15 12:46:31,441 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-15 12:46:31,447 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:46:31,447 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 12:46:31,449 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-15 12:46:31,452 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:31,453 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 12:46:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 12:46:31,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:31,477 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-15 12:46:31,477 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-15 12:46:31,478 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-15 12:46:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:31,480 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 12:46:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 12:46:31,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:31,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:31,480 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-15 12:46:31,481 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-15 12:46:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:31,482 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 12:46:31,483 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 12:46:31,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:31,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:31,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:31,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:31,484 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-15 12:46:31,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-15 12:46:31,486 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-15 12:46:31,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:31,486 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-15 12:46:31,487 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-15 12:46:31,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-15 12:46:31,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:31,509 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 12:46:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:46:31,509 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:31,511 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:31,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:46:31,514 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:31,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 1 times [2022-04-15 12:46:31,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:31,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [559352568] [2022-04-15 12:46:31,523 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:46:31,524 INFO L85 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 2 times [2022-04-15 12:46:31,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:31,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574483419] [2022-04-15 12:46:31,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:31,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:31,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:31,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-15 12:46:31,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-15 12:46:31,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #40#return; {142#true} is VALID [2022-04-15 12:46:31,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:31,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-15 12:46:31,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-15 12:46:31,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #40#return; {142#true} is VALID [2022-04-15 12:46:31,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret5 := main(); {142#true} is VALID [2022-04-15 12:46:31,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#true} ~x~0 := 0; {147#(= main_~x~0 0)} is VALID [2022-04-15 12:46:31,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 100000000); {143#false} is VALID [2022-04-15 12:46:31,684 INFO L272 TraceCheckUtils]: 7: Hoare triple {143#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {143#false} is VALID [2022-04-15 12:46:31,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2022-04-15 12:46:31,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2022-04-15 12:46:31,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2022-04-15 12:46:31,685 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-15 12:46:31,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:31,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574483419] [2022-04-15 12:46:31,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574483419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:31,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:31,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:31,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:31,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [559352568] [2022-04-15 12:46:31,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [559352568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:31,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:31,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:31,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456541507] [2022-04-15 12:46:31,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:31,689 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-15 12:46:31,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:31,690 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-15 12:46:31,706 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-15 12:46:31,707 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:46:31,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:31,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:46:31,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:46:31,708 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-15 12:46:31,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:31,779 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 12:46:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:46:31,779 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-15 12:46:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:31,780 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-15 12:46:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 12:46:31,781 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-15 12:46:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 12:46:31,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-15 12:46:31,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:31,808 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:46:31,808 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 12:46:31,808 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-15 12:46:31,809 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-15 12:46:31,810 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-15 12:46:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 12:46:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 12:46:31,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:31,814 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-15 12:46:31,814 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-15 12:46:31,814 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-15 12:46:31,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:31,816 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 12:46:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:46:31,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:31,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:31,817 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-15 12:46:31,817 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-15 12:46:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:31,818 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 12:46:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:46:31,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:31,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:31,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:31,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:31,819 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-15 12:46:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 12:46:31,820 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-15 12:46:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:31,821 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 12:46:31,821 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-15 12:46:31,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 12:46:31,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:46:31,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:46:31,838 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:31,838 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:31,838 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:46:31,838 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:31,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:31,839 INFO L85 PathProgramCache]: Analyzing trace with hash 925229631, now seen corresponding path program 1 times [2022-04-15 12:46:31,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:31,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1583569059] [2022-04-15 12:46:31,956 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:46:31,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1303175503, now seen corresponding path program 1 times [2022-04-15 12:46:31,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:31,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724936524] [2022-04-15 12:46:31,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:31,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:32,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:32,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {264#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {257#true} is VALID [2022-04-15 12:46:32,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-15 12:46:32,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {257#true} {257#true} #40#return; {257#true} is VALID [2022-04-15 12:46:32,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {264#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:32,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {264#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {257#true} is VALID [2022-04-15 12:46:32,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-15 12:46:32,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #40#return; {257#true} is VALID [2022-04-15 12:46:32,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret5 := main(); {257#true} is VALID [2022-04-15 12:46:32,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#true} ~x~0 := 0; {262#(= main_~x~0 0)} is VALID [2022-04-15 12:46:32,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#(= main_~x~0 0)} [46] L9-2-->L8-2_primed: Formula: (or (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (= |v_main_#t~post4_Out_2| 0) (< (mod (+ v_main_~x~0_Out_2 4294967295) 4294967296) 10000000)) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) InVars {main_~x~0=v_main_~x~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_2, main_#t~post4=|v_main_#t~post4_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {263#(or (<= (+ 4284967296 main_~x~0) (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296)) (and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0))))} is VALID [2022-04-15 12:46:32,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(or (<= (+ 4284967296 main_~x~0) (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296)) (and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0))))} [45] L8-2_primed-->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[] {258#false} is VALID [2022-04-15 12:46:32,084 INFO L272 TraceCheckUtils]: 8: Hoare triple {258#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {258#false} is VALID [2022-04-15 12:46:32,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {258#false} ~cond := #in~cond; {258#false} is VALID [2022-04-15 12:46:32,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {258#false} assume 0 == ~cond; {258#false} is VALID [2022-04-15 12:46:32,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {258#false} assume !false; {258#false} is VALID [2022-04-15 12:46:32,085 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-15 12:46:32,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:32,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724936524] [2022-04-15 12:46:32,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724936524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:32,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:32,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:46:32,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:32,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1583569059] [2022-04-15 12:46:32,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1583569059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:32,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:32,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:46:32,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938325184] [2022-04-15 12:46:32,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:32,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-15 12:46:32,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:32,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-15 12:46:32,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:32,290 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:46:32,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:32,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:46:32,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:46:32,291 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-15 12:46:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:32,536 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 12:46:32,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:46:32,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-15 12:46:32,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-15 12:46:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 12:46:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-15 12:46:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 12:46:32,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-15 12:46:32,582 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-15 12:46:32,583 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:46:32,583 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:46:32,583 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:46:32,584 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:32,585 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:46:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:46:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:46:32,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:32,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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-15 12:46:32,596 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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-15 12:46:32,597 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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-15 12:46:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:32,598 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:46:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:46:32,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:32,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:32,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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 17 states. [2022-04-15 12:46:32,599 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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 17 states. [2022-04-15 12:46:32,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:32,601 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:46:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:46:32,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:32,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:32,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:32,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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-15 12:46:32,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 12:46:32,602 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-15 12:46:32,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:32,603 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 12:46:32,603 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-15 12:46:32,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 12:46:32,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:46:32,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:46:32,632 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:32,632 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:32,633 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:46:32,633 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:32,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:32,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1220035546, now seen corresponding path program 1 times [2022-04-15 12:46:32,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:32,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1408867077] [2022-04-15 12:46:32,944 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1244070159, now seen corresponding path program 1 times [2022-04-15 12:46:32,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:32,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4626709] [2022-04-15 12:46:32,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:32,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:32,970 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:33,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:33,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1220035546, now seen corresponding path program 2 times [2022-04-15 12:46:33,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:33,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575401399] [2022-04-15 12:46:33,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:33,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:33,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:33,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-15 12:46:33,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 12:46:33,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-15 12:46:33,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:33,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-15 12:46:33,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 12:46:33,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-15 12:46:33,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-15 12:46:33,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} ~x~0 := 0; {390#(= main_~x~0 0)} is VALID [2022-04-15 12:46:33,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {390#(= main_~x~0 0)} is VALID [2022-04-15 12:46:33,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {391#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:33,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {391#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:33,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {386#false} is VALID [2022-04-15 12:46:33,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {386#false} assume !(~x~0 % 4294967296 < 100000000); {386#false} is VALID [2022-04-15 12:46:33,089 INFO L272 TraceCheckUtils]: 11: Hoare triple {386#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {386#false} is VALID [2022-04-15 12:46:33,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 12:46:33,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 12:46:33,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 12:46:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:33,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:33,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575401399] [2022-04-15 12:46:33,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575401399] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:33,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842836905] [2022-04-15 12:46:33,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:46:33,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:33,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:33,093 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-15 12:46:33,103 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-15 12:46:33,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:46:33,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:33,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:46:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:33,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:33,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-15 12:46:33,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-15 12:46:33,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 12:46:33,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-15 12:46:33,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-15 12:46:33,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} ~x~0 := 0; {390#(= main_~x~0 0)} is VALID [2022-04-15 12:46:33,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {390#(= main_~x~0 0)} is VALID [2022-04-15 12:46:33,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {417#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 12:46:33,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#(= (+ (- 1) main_~x~0) 0)} assume !!(~x~0 % 4294967296 < 100000000); {417#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 12:46:33,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#(= (+ (- 1) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {386#false} is VALID [2022-04-15 12:46:33,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {386#false} assume !(~x~0 % 4294967296 < 100000000); {386#false} is VALID [2022-04-15 12:46:33,222 INFO L272 TraceCheckUtils]: 11: Hoare triple {386#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {386#false} is VALID [2022-04-15 12:46:33,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 12:46:33,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 12:46:33,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 12:46:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:33,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:33,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 12:46:33,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 12:46:33,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 12:46:33,372 INFO L272 TraceCheckUtils]: 11: Hoare triple {386#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {386#false} is VALID [2022-04-15 12:46:33,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {386#false} assume !(~x~0 % 4294967296 < 100000000); {386#false} is VALID [2022-04-15 12:46:33,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {454#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {386#false} is VALID [2022-04-15 12:46:33,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {454#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:46:33,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {458#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:46:33,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {462#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:33,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} ~x~0 := 0; {462#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:33,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-15 12:46:33,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-15 12:46:33,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 12:46:33,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-15 12:46:33,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-15 12:46:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:33,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842836905] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:33,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:33,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2022-04-15 12:46:33,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:33,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1408867077] [2022-04-15 12:46:33,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1408867077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:33,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:33,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:46:33,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711374630] [2022-04-15 12:46:33,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:33,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-15 12:46:33,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:33,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 12:46:33,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:33,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:46:33,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:33,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:46:33,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:46:33,394 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 12:46:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:33,492 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 12:46:33,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:46:33,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2022-04-15 12:46:33,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:33,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 12:46:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-15 12:46:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 12:46:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-15 12:46:33,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-15 12:46:33,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:33,525 INFO L225 Difference]: With dead ends: 26 [2022-04-15 12:46:33,526 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 12:46:33,526 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:46:33,531 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:33,532 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 24 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:33,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 12:46:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 12:46:33,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:33,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-15 12:46:33,553 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-15 12:46:33,554 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-15 12:46:33,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:33,556 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 12:46:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:46:33,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:33,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:33,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-15 12:46:33,559 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-15 12:46:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:33,561 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 12:46:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:46:33,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:33,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:33,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:33,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:33,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-15 12:46:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 12:46:33,565 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-15 12:46:33,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:33,565 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 12:46:33,565 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-15 12:46:33,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 12:46:33,588 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-15 12:46:33,589 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:46:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:46:33,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:33,591 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:33,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 12:46:33,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:33,812 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:33,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1870024951, now seen corresponding path program 3 times [2022-04-15 12:46:33,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:33,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1948194119] [2022-04-15 12:46:34,093 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:34,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1184964815, now seen corresponding path program 1 times [2022-04-15 12:46:34,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:34,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146311979] [2022-04-15 12:46:34,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:34,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:34,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:34,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:34,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1870024951, now seen corresponding path program 4 times [2022-04-15 12:46:34,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:34,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391948511] [2022-04-15 12:46:34,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:34,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:34,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:34,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {618#true} is VALID [2022-04-15 12:46:34,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {618#true} assume true; {618#true} is VALID [2022-04-15 12:46:34,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {618#true} {618#true} #40#return; {618#true} is VALID [2022-04-15 12:46:34,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {618#true} call ULTIMATE.init(); {626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:34,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {618#true} is VALID [2022-04-15 12:46:34,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {618#true} assume true; {618#true} is VALID [2022-04-15 12:46:34,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {618#true} {618#true} #40#return; {618#true} is VALID [2022-04-15 12:46:34,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {618#true} call #t~ret5 := main(); {618#true} is VALID [2022-04-15 12:46:34,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {618#true} ~x~0 := 0; {623#(= main_~x~0 0)} is VALID [2022-04-15 12:46:34,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {623#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {623#(= main_~x~0 0)} is VALID [2022-04-15 12:46:34,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {624#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:34,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {624#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {624#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:34,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {624#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {625#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:34,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {625#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {625#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:34,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {625#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {619#false} is VALID [2022-04-15 12:46:34,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {619#false} assume !(~x~0 % 4294967296 < 100000000); {619#false} is VALID [2022-04-15 12:46:34,298 INFO L272 TraceCheckUtils]: 13: Hoare triple {619#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {619#false} is VALID [2022-04-15 12:46:34,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {619#false} ~cond := #in~cond; {619#false} is VALID [2022-04-15 12:46:34,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {619#false} assume 0 == ~cond; {619#false} is VALID [2022-04-15 12:46:34,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {619#false} assume !false; {619#false} is VALID [2022-04-15 12:46:34,299 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-15 12:46:34,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:34,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391948511] [2022-04-15 12:46:34,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391948511] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:34,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126795734] [2022-04-15 12:46:34,299 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:46:34,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:34,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:34,304 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-15 12:46:34,319 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-15 12:46:34,353 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:46:34,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:34,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:46:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:34,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:34,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {618#true} call ULTIMATE.init(); {618#true} is VALID [2022-04-15 12:46:34,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {618#true} is VALID [2022-04-15 12:46:34,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {618#true} assume true; {618#true} is VALID [2022-04-15 12:46:34,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {618#true} {618#true} #40#return; {618#true} is VALID [2022-04-15 12:46:34,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {618#true} call #t~ret5 := main(); {618#true} is VALID [2022-04-15 12:46:34,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {618#true} ~x~0 := 0; {623#(= main_~x~0 0)} is VALID [2022-04-15 12:46:34,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {623#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {623#(= main_~x~0 0)} is VALID [2022-04-15 12:46:34,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {624#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:34,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {624#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {624#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:34,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {624#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {657#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:34,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {657#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {657#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:34,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {657#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {619#false} is VALID [2022-04-15 12:46:34,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {619#false} assume !(~x~0 % 4294967296 < 100000000); {619#false} is VALID [2022-04-15 12:46:34,599 INFO L272 TraceCheckUtils]: 13: Hoare triple {619#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {619#false} is VALID [2022-04-15 12:46:34,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {619#false} ~cond := #in~cond; {619#false} is VALID [2022-04-15 12:46:34,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {619#false} assume 0 == ~cond; {619#false} is VALID [2022-04-15 12:46:34,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {619#false} assume !false; {619#false} is VALID [2022-04-15 12:46:34,600 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-15 12:46:34,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:34,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {619#false} assume !false; {619#false} is VALID [2022-04-15 12:46:34,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {619#false} assume 0 == ~cond; {619#false} is VALID [2022-04-15 12:46:34,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {619#false} ~cond := #in~cond; {619#false} is VALID [2022-04-15 12:46:34,748 INFO L272 TraceCheckUtils]: 13: Hoare triple {619#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {619#false} is VALID [2022-04-15 12:46:34,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {619#false} assume !(~x~0 % 4294967296 < 100000000); {619#false} is VALID [2022-04-15 12:46:34,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {694#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {619#false} is VALID [2022-04-15 12:46:34,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {698#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {694#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:46:34,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {702#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {698#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:46:34,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {702#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {702#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:34,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {709#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {702#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:34,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {709#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {709#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:34,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {618#true} ~x~0 := 0; {709#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:34,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {618#true} call #t~ret5 := main(); {618#true} is VALID [2022-04-15 12:46:34,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {618#true} {618#true} #40#return; {618#true} is VALID [2022-04-15 12:46:34,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {618#true} assume true; {618#true} is VALID [2022-04-15 12:46:34,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {618#true} is VALID [2022-04-15 12:46:34,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {618#true} call ULTIMATE.init(); {618#true} is VALID [2022-04-15 12:46:34,754 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-15 12:46:34,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126795734] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:34,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:34,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-04-15 12:46:34,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:34,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1948194119] [2022-04-15 12:46:34,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1948194119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:34,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:34,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:46:34,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935539161] [2022-04-15 12:46:34,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:34,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-15 12:46:34,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:34,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-15 12:46:34,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:34,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:46:34,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:34,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:46:34,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:46:34,775 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-15 12:46:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:34,925 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 12:46:34,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:46:34,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-15 12:46:34,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-15 12:46:34,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-15 12:46:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-15 12:46:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-15 12:46:34,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2022-04-15 12:46:34,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:34,962 INFO L225 Difference]: With dead ends: 28 [2022-04-15 12:46:34,962 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:46:34,963 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:46:34,964 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:34,965 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:46:35,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 12:46:35,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:35,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-15 12:46:35,002 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-15 12:46:35,002 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-15 12:46:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:35,003 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 12:46:35,003 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:46:35,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:35,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:35,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 21 states. [2022-04-15 12:46:35,004 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 21 states. [2022-04-15 12:46:35,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:35,005 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 12:46:35,005 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:46:35,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:35,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:35,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:35,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-15 12:46:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-15 12:46:35,007 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-04-15 12:46:35,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:35,007 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-15 12:46:35,007 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-15 12:46:35,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-15 12:46:35,047 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-15 12:46:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:46:35,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:46:35,047 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:35,048 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:35,073 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-15 12:46:35,248 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,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2022-04-15 12:46:35,248 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:35,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:35,249 INFO L85 PathProgramCache]: Analyzing trace with hash -555382060, now seen corresponding path program 5 times [2022-04-15 12:46:35,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:35,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1254451513] [2022-04-15 12:46:35,463 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:35,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1125859471, now seen corresponding path program 1 times [2022-04-15 12:46:35,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:35,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442655201] [2022-04-15 12:46:35,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:35,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:35,490 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:35,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:35,513 INFO L85 PathProgramCache]: Analyzing trace with hash -555382060, now seen corresponding path program 6 times [2022-04-15 12:46:35,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:35,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391348861] [2022-04-15 12:46:35,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:35,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:35,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:35,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {879#true} is VALID [2022-04-15 12:46:35,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {879#true} assume true; {879#true} is VALID [2022-04-15 12:46:35,642 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {879#true} {879#true} #40#return; {879#true} is VALID [2022-04-15 12:46:35,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {879#true} call ULTIMATE.init(); {888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:35,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {879#true} is VALID [2022-04-15 12:46:35,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {879#true} assume true; {879#true} is VALID [2022-04-15 12:46:35,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {879#true} {879#true} #40#return; {879#true} is VALID [2022-04-15 12:46:35,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {879#true} call #t~ret5 := main(); {879#true} is VALID [2022-04-15 12:46:35,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {879#true} ~x~0 := 0; {884#(= main_~x~0 0)} is VALID [2022-04-15 12:46:35,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {884#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {884#(= main_~x~0 0)} is VALID [2022-04-15 12:46:35,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {884#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {885#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:35,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {885#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {885#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:35,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {885#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {886#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:35,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {886#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {886#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:35,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {886#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {887#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-15 12:46:35,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {887#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !!(~x~0 % 4294967296 < 100000000); {887#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-15 12:46:35,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {887#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {880#false} is VALID [2022-04-15 12:46:35,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {880#false} assume !(~x~0 % 4294967296 < 100000000); {880#false} is VALID [2022-04-15 12:46:35,653 INFO L272 TraceCheckUtils]: 15: Hoare triple {880#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {880#false} is VALID [2022-04-15 12:46:35,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {880#false} ~cond := #in~cond; {880#false} is VALID [2022-04-15 12:46:35,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {880#false} assume 0 == ~cond; {880#false} is VALID [2022-04-15 12:46:35,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {880#false} assume !false; {880#false} is VALID [2022-04-15 12:46:35,654 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-15 12:46:35,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:35,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391348861] [2022-04-15 12:46:35,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391348861] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:35,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192553510] [2022-04-15 12:46:35,655 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:46:35,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:35,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:35,660 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-15 12:46:35,661 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-15 12:46:35,719 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 12:46:35,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:35,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:46:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:35,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:35,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {879#true} call ULTIMATE.init(); {879#true} is VALID [2022-04-15 12:46:35,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {879#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {879#true} is VALID [2022-04-15 12:46:35,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {879#true} assume true; {879#true} is VALID [2022-04-15 12:46:35,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {879#true} {879#true} #40#return; {879#true} is VALID [2022-04-15 12:46:35,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {879#true} call #t~ret5 := main(); {879#true} is VALID [2022-04-15 12:46:35,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {879#true} ~x~0 := 0; {879#true} is VALID [2022-04-15 12:46:35,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {879#true} assume !!(~x~0 % 4294967296 < 100000000); {879#true} is VALID [2022-04-15 12:46:35,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {879#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {879#true} is VALID [2022-04-15 12:46:35,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {879#true} assume !!(~x~0 % 4294967296 < 100000000); {879#true} is VALID [2022-04-15 12:46:35,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {879#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {919#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:35,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {919#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {919#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:35,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {919#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {926#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} is VALID [2022-04-15 12:46:35,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {926#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {926#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} is VALID [2022-04-15 12:46:35,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {926#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {933#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:46:35,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {933#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000))} assume !(~x~0 % 4294967296 < 100000000); {880#false} is VALID [2022-04-15 12:46:35,914 INFO L272 TraceCheckUtils]: 15: Hoare triple {880#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {880#false} is VALID [2022-04-15 12:46:35,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {880#false} ~cond := #in~cond; {880#false} is VALID [2022-04-15 12:46:35,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {880#false} assume 0 == ~cond; {880#false} is VALID [2022-04-15 12:46:35,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {880#false} assume !false; {880#false} is VALID [2022-04-15 12:46:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:46:35,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:36,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {880#false} assume !false; {880#false} is VALID [2022-04-15 12:46:36,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {952#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {880#false} is VALID [2022-04-15 12:46:36,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {956#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {952#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:46:36,103 INFO L272 TraceCheckUtils]: 15: Hoare triple {960#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {956#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:46:36,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {964#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {960#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:46:36,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {968#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {964#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:46:36,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {968#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {968#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:36,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {879#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {968#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:36,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {879#true} assume !!(~x~0 % 4294967296 < 100000000); {879#true} is VALID [2022-04-15 12:46:36,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {879#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {879#true} is VALID [2022-04-15 12:46:36,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {879#true} assume !!(~x~0 % 4294967296 < 100000000); {879#true} is VALID [2022-04-15 12:46:36,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {879#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {879#true} is VALID [2022-04-15 12:46:36,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {879#true} assume !!(~x~0 % 4294967296 < 100000000); {879#true} is VALID [2022-04-15 12:46:36,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {879#true} ~x~0 := 0; {879#true} is VALID [2022-04-15 12:46:36,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {879#true} call #t~ret5 := main(); {879#true} is VALID [2022-04-15 12:46:36,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {879#true} {879#true} #40#return; {879#true} is VALID [2022-04-15 12:46:36,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {879#true} assume true; {879#true} is VALID [2022-04-15 12:46:36,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {879#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {879#true} is VALID [2022-04-15 12:46:36,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {879#true} call ULTIMATE.init(); {879#true} is VALID [2022-04-15 12:46:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:46:36,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192553510] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:36,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:36,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 7] total 15 [2022-04-15 12:46:36,109 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:36,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1254451513] [2022-04-15 12:46:36,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1254451513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:36,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:36,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:46:36,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611862734] [2022-04-15 12:46:36,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:36,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 19 [2022-04-15 12:46:36,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:36,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-15 12:46:36,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:36,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:46:36,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:36,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:46:36,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:46:36,131 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-15 12:46:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:36,309 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 12:46:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:46:36,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 19 [2022-04-15 12:46:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-15 12:46:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 12:46:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-15 12:46:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 12:46:36,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-15 12:46:36,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:36,341 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:46:36,341 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:46:36,342 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:46:36,342 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:36,342 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 24 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:46:36,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 12:46:36,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:36,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-15 12:46:36,370 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-15 12:46:36,371 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-15 12:46:36,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:36,372 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 12:46:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:46:36,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:36,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:36,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-15 12:46:36,372 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-15 12:46:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:36,373 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 12:46:36,373 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:46:36,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:36,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:36,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:36,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-15 12:46:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-15 12:46:36,375 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2022-04-15 12:46:36,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:36,375 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-15 12:46:36,375 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-15 12:46:36,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-15 12:46:36,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:36,407 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:46:36,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:46:36,408 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:36,408 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:36,413 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-15 12:46:36,608 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:36,609 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:36,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:36,609 INFO L85 PathProgramCache]: Analyzing trace with hash 795722097, now seen corresponding path program 7 times [2022-04-15 12:46:36,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:36,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [992298365] [2022-04-15 12:46:36,851 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:36,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1066754127, now seen corresponding path program 1 times [2022-04-15 12:46:36,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:36,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633288749] [2022-04-15 12:46:36,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:36,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:36,882 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:36,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:36,901 INFO L85 PathProgramCache]: Analyzing trace with hash 795722097, now seen corresponding path program 8 times [2022-04-15 12:46:36,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:36,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169287286] [2022-04-15 12:46:36,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:36,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:37,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:37,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {1180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1170#true} is VALID [2022-04-15 12:46:37,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {1170#true} assume true; {1170#true} is VALID [2022-04-15 12:46:37,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1170#true} {1170#true} #40#return; {1170#true} is VALID [2022-04-15 12:46:37,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {1170#true} call ULTIMATE.init(); {1180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:37,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {1180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1170#true} is VALID [2022-04-15 12:46:37,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {1170#true} assume true; {1170#true} is VALID [2022-04-15 12:46:37,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1170#true} {1170#true} #40#return; {1170#true} is VALID [2022-04-15 12:46:37,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {1170#true} call #t~ret5 := main(); {1170#true} is VALID [2022-04-15 12:46:37,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {1170#true} ~x~0 := 0; {1175#(= main_~x~0 0)} is VALID [2022-04-15 12:46:37,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {1175#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1175#(= main_~x~0 0)} is VALID [2022-04-15 12:46:37,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {1175#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1176#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:37,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {1176#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1176#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:37,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {1176#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1177#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:37,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {1177#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1177#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:37,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {1177#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1178#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:37,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1178#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:37,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1179#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:37,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {1179#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:37,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1171#false} is VALID [2022-04-15 12:46:37,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {1171#false} assume !(~x~0 % 4294967296 < 100000000); {1171#false} is VALID [2022-04-15 12:46:37,055 INFO L272 TraceCheckUtils]: 17: Hoare triple {1171#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {1171#false} is VALID [2022-04-15 12:46:37,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {1171#false} ~cond := #in~cond; {1171#false} is VALID [2022-04-15 12:46:37,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {1171#false} assume 0 == ~cond; {1171#false} is VALID [2022-04-15 12:46:37,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2022-04-15 12:46:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:37,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:37,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169287286] [2022-04-15 12:46:37,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169287286] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:37,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561376438] [2022-04-15 12:46:37,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:46:37,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:37,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:37,057 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-15 12:46:37,059 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-15 12:46:37,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:46:37,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:37,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:46:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:37,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:37,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {1170#true} call ULTIMATE.init(); {1170#true} is VALID [2022-04-15 12:46:37,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {1170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1170#true} is VALID [2022-04-15 12:46:37,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {1170#true} assume true; {1170#true} is VALID [2022-04-15 12:46:37,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1170#true} {1170#true} #40#return; {1170#true} is VALID [2022-04-15 12:46:37,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {1170#true} call #t~ret5 := main(); {1170#true} is VALID [2022-04-15 12:46:37,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {1170#true} ~x~0 := 0; {1175#(= main_~x~0 0)} is VALID [2022-04-15 12:46:37,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {1175#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1175#(= main_~x~0 0)} is VALID [2022-04-15 12:46:37,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {1175#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1176#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:37,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {1176#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1176#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:37,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {1176#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1177#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:37,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {1177#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1177#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:37,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {1177#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1178#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:37,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1178#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:37,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1223#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:37,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {1223#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1223#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:37,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {1223#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1230#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:37,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {1230#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 100000000); {1171#false} is VALID [2022-04-15 12:46:37,264 INFO L272 TraceCheckUtils]: 17: Hoare triple {1171#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {1171#false} is VALID [2022-04-15 12:46:37,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {1171#false} ~cond := #in~cond; {1171#false} is VALID [2022-04-15 12:46:37,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {1171#false} assume 0 == ~cond; {1171#false} is VALID [2022-04-15 12:46:37,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2022-04-15 12:46:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:37,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:37,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2022-04-15 12:46:37,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {1249#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1171#false} is VALID [2022-04-15 12:46:37,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {1253#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1249#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:46:37,612 INFO L272 TraceCheckUtils]: 17: Hoare triple {1257#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {1253#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:46:37,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {1261#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {1257#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:46:37,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {1265#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1261#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:46:37,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {1265#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {1265#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:37,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {1272#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1265#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:37,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {1272#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {1272#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-15 12:46:37,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {1279#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1272#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-15 12:46:37,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {1279#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {1279#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-15 12:46:37,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {1286#(or (= 100000000 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1279#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-15 12:46:37,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {1286#(or (= 100000000 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {1286#(or (= 100000000 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-15 12:46:37,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {1293#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1286#(or (= 100000000 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-15 12:46:37,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {1293#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {1293#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-15 12:46:37,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {1170#true} ~x~0 := 0; {1293#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-15 12:46:37,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {1170#true} call #t~ret5 := main(); {1170#true} is VALID [2022-04-15 12:46:37,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1170#true} {1170#true} #40#return; {1170#true} is VALID [2022-04-15 12:46:37,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {1170#true} assume true; {1170#true} is VALID [2022-04-15 12:46:37,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {1170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1170#true} is VALID [2022-04-15 12:46:37,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {1170#true} call ULTIMATE.init(); {1170#true} is VALID [2022-04-15 12:46:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:37,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561376438] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:37,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:37,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 19 [2022-04-15 12:46:37,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:37,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [992298365] [2022-04-15 12:46:37,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [992298365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:37,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:37,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:46:37,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580088087] [2022-04-15 12:46:37,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:37,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 21 [2022-04-15 12:46:37,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:37,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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-15 12:46:37,644 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-15 12:46:37,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:46:37,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:37,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:46:37,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:46:37,645 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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-15 12:46:37,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:37,891 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 12:46:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:46:37,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 21 [2022-04-15 12:46:37,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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-15 12:46:37,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-15 12:46:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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-15 12:46:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-15 12:46:37,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2022-04-15 12:46:37,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:37,922 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:46:37,922 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:46:37,922 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:46:37,923 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:37,923 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 34 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:46:37,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:46:37,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 12:46:37,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:37,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,961 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,961 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:37,964 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 12:46:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:46:37,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:37,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:37,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 12:46:37,965 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 12:46:37,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:37,969 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 12:46:37,969 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:46:37,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:37,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:37,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:37,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 12:46:37,970 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-04-15 12:46:37,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:37,971 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 12:46:37,971 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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-15 12:46:37,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-15 12:46:38,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:46:38,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:46:38,015 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:38,015 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:38,039 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-15 12:46:38,215 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:38,216 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:38,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:38,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2126693582, now seen corresponding path program 9 times [2022-04-15 12:46:38,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:38,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [237670659] [2022-04-15 12:46:38,410 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:38,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1007648783, now seen corresponding path program 1 times [2022-04-15 12:46:38,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:38,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432536195] [2022-04-15 12:46:38,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:38,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:38,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:38,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:38,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2126693582, now seen corresponding path program 10 times [2022-04-15 12:46:38,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:38,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102231526] [2022-04-15 12:46:38,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:38,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:38,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1491#true} is VALID [2022-04-15 12:46:38,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {1491#true} assume true; {1491#true} is VALID [2022-04-15 12:46:38,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1491#true} {1491#true} #40#return; {1491#true} is VALID [2022-04-15 12:46:38,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {1491#true} call ULTIMATE.init(); {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:38,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1491#true} is VALID [2022-04-15 12:46:38,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {1491#true} assume true; {1491#true} is VALID [2022-04-15 12:46:38,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1491#true} {1491#true} #40#return; {1491#true} is VALID [2022-04-15 12:46:38,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {1491#true} call #t~ret5 := main(); {1491#true} is VALID [2022-04-15 12:46:38,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {1491#true} ~x~0 := 0; {1496#(= main_~x~0 0)} is VALID [2022-04-15 12:46:38,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {1496#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1496#(= main_~x~0 0)} is VALID [2022-04-15 12:46:38,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {1496#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1497#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:38,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {1497#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1497#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:38,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {1497#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1498#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:38,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {1498#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1498#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:38,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {1498#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1499#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:38,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {1499#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1499#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:38,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {1499#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1500#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:38,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {1500#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1500#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:38,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {1500#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1501#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:38,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {1501#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1501#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:38,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {1501#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1492#false} is VALID [2022-04-15 12:46:38,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {1492#false} assume !(~x~0 % 4294967296 < 100000000); {1492#false} is VALID [2022-04-15 12:46:38,571 INFO L272 TraceCheckUtils]: 19: Hoare triple {1492#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {1492#false} is VALID [2022-04-15 12:46:38,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {1492#false} ~cond := #in~cond; {1492#false} is VALID [2022-04-15 12:46:38,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {1492#false} assume 0 == ~cond; {1492#false} is VALID [2022-04-15 12:46:38,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {1492#false} assume !false; {1492#false} is VALID [2022-04-15 12:46:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:38,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:38,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102231526] [2022-04-15 12:46:38,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102231526] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:38,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57084967] [2022-04-15 12:46:38,576 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:46:38,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:38,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:38,580 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-15 12:46:38,595 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-15 12:46:38,626 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:46:38,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:38,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:46:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:38,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:38,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {1491#true} call ULTIMATE.init(); {1491#true} is VALID [2022-04-15 12:46:38,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {1491#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1491#true} is VALID [2022-04-15 12:46:38,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {1491#true} assume true; {1491#true} is VALID [2022-04-15 12:46:38,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1491#true} {1491#true} #40#return; {1491#true} is VALID [2022-04-15 12:46:38,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {1491#true} call #t~ret5 := main(); {1491#true} is VALID [2022-04-15 12:46:38,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {1491#true} ~x~0 := 0; {1496#(= main_~x~0 0)} is VALID [2022-04-15 12:46:38,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {1496#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1496#(= main_~x~0 0)} is VALID [2022-04-15 12:46:38,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {1496#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1497#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:38,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {1497#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1497#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:38,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {1497#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1498#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:38,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {1498#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1498#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:38,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {1498#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1499#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:38,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {1499#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1499#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:38,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {1499#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1500#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:38,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {1500#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1500#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:38,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {1500#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1551#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:38,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {1551#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1551#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:38,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {1551#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1492#false} is VALID [2022-04-15 12:46:38,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {1492#false} assume !(~x~0 % 4294967296 < 100000000); {1492#false} is VALID [2022-04-15 12:46:38,907 INFO L272 TraceCheckUtils]: 19: Hoare triple {1492#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {1492#false} is VALID [2022-04-15 12:46:38,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {1492#false} ~cond := #in~cond; {1492#false} is VALID [2022-04-15 12:46:38,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {1492#false} assume 0 == ~cond; {1492#false} is VALID [2022-04-15 12:46:38,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {1492#false} assume !false; {1492#false} is VALID [2022-04-15 12:46:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:38,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:39,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {1492#false} assume !false; {1492#false} is VALID [2022-04-15 12:46:39,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {1492#false} assume 0 == ~cond; {1492#false} is VALID [2022-04-15 12:46:39,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {1492#false} ~cond := #in~cond; {1492#false} is VALID [2022-04-15 12:46:39,210 INFO L272 TraceCheckUtils]: 19: Hoare triple {1492#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {1492#false} is VALID [2022-04-15 12:46:39,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {1492#false} assume !(~x~0 % 4294967296 < 100000000); {1492#false} is VALID [2022-04-15 12:46:39,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {1588#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1492#false} is VALID [2022-04-15 12:46:39,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {1592#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1588#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:46:39,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {1596#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1592#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:46:39,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {1596#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1596#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:39,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {1603#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1596#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:39,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {1603#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1603#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:39,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {1610#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1603#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:39,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {1610#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {1610#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:46:39,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {1617#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1610#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:46:39,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {1617#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1617#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:39,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {1624#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1617#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:39,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {1624#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {1624#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:46:39,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {1491#true} ~x~0 := 0; {1624#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:46:39,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {1491#true} call #t~ret5 := main(); {1491#true} is VALID [2022-04-15 12:46:39,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1491#true} {1491#true} #40#return; {1491#true} is VALID [2022-04-15 12:46:39,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {1491#true} assume true; {1491#true} is VALID [2022-04-15 12:46:39,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {1491#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1491#true} is VALID [2022-04-15 12:46:39,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {1491#true} call ULTIMATE.init(); {1491#true} is VALID [2022-04-15 12:46:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:39,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57084967] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:39,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:39,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2022-04-15 12:46:39,227 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:39,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [237670659] [2022-04-15 12:46:39,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [237670659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:39,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:39,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:46:39,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354523189] [2022-04-15 12:46:39,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:39,228 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 23 [2022-04-15 12:46:39,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:39,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-15 12:46:39,246 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-15 12:46:39,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:46:39,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:39,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:46:39,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:46:39,247 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-15 12:46:39,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:39,544 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 12:46:39,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:46:39,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 23 [2022-04-15 12:46:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-15 12:46:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-15 12:46:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-15 12:46:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-15 12:46:39,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-15 12:46:39,578 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-15 12:46:39,579 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:46:39,579 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:46:39,579 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:46:39,580 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:39,580 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 39 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:46:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:46:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 12:46:39,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:39,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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-15 12:46:39,627 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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-15 12:46:39,628 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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-15 12:46:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:39,629 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:46:39,629 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:46:39,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:39,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:39,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 12:46:39,629 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 12:46:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:39,630 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:46:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:46:39,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:39,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:39,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:39,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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-15 12:46:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-15 12:46:39,632 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2022-04-15 12:46:39,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:39,632 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-15 12:46:39,632 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-15 12:46:39,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-15 12:46:39,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:39,680 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:46:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:46:39,681 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:39,681 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:39,702 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-15 12:46:39,881 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12 [2022-04-15 12:46:39,881 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:39,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:39,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1290036459, now seen corresponding path program 11 times [2022-04-15 12:46:39,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:39,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1712381638] [2022-04-15 12:46:40,093 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:40,096 INFO L85 PathProgramCache]: Analyzing trace with hash -948543439, now seen corresponding path program 1 times [2022-04-15 12:46:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:40,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908850827] [2022-04-15 12:46:40,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:40,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:40,117 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:40,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:40,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1290036459, now seen corresponding path program 12 times [2022-04-15 12:46:40,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:40,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578755965] [2022-04-15 12:46:40,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:40,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:40,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:40,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {1848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1836#true} is VALID [2022-04-15 12:46:40,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#true} assume true; {1836#true} is VALID [2022-04-15 12:46:40,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1836#true} {1836#true} #40#return; {1836#true} is VALID [2022-04-15 12:46:40,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {1836#true} call ULTIMATE.init(); {1848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:40,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {1848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1836#true} is VALID [2022-04-15 12:46:40,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {1836#true} assume true; {1836#true} is VALID [2022-04-15 12:46:40,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1836#true} {1836#true} #40#return; {1836#true} is VALID [2022-04-15 12:46:40,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {1836#true} call #t~ret5 := main(); {1836#true} is VALID [2022-04-15 12:46:40,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {1836#true} ~x~0 := 0; {1841#(= main_~x~0 0)} is VALID [2022-04-15 12:46:40,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {1841#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1841#(= main_~x~0 0)} is VALID [2022-04-15 12:46:40,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {1841#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1842#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:40,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {1842#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1842#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:40,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {1842#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1843#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:40,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {1843#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1843#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:40,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {1843#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1844#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:40,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {1844#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1844#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:40,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {1844#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1845#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:40,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {1845#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1845#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:40,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {1845#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1846#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:40,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {1846#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1846#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:40,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1847#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:40,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {1847#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {1847#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:40,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {1847#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1837#false} is VALID [2022-04-15 12:46:40,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {1837#false} assume !(~x~0 % 4294967296 < 100000000); {1837#false} is VALID [2022-04-15 12:46:40,281 INFO L272 TraceCheckUtils]: 21: Hoare triple {1837#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {1837#false} is VALID [2022-04-15 12:46:40,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {1837#false} ~cond := #in~cond; {1837#false} is VALID [2022-04-15 12:46:40,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {1837#false} assume 0 == ~cond; {1837#false} is VALID [2022-04-15 12:46:40,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {1837#false} assume !false; {1837#false} is VALID [2022-04-15 12:46:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:40,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:40,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578755965] [2022-04-15 12:46:40,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578755965] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:40,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310742561] [2022-04-15 12:46:40,282 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:46:40,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:40,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:40,283 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-15 12:46:40,284 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-15 12:46:40,351 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:46:40,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:40,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:46:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:40,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:40,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {1836#true} call ULTIMATE.init(); {1836#true} is VALID [2022-04-15 12:46:40,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1836#true} is VALID [2022-04-15 12:46:40,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {1836#true} assume true; {1836#true} is VALID [2022-04-15 12:46:40,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1836#true} {1836#true} #40#return; {1836#true} is VALID [2022-04-15 12:46:40,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {1836#true} call #t~ret5 := main(); {1836#true} is VALID [2022-04-15 12:46:40,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {1836#true} ~x~0 := 0; {1836#true} is VALID [2022-04-15 12:46:40,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {1836#true} assume !!(~x~0 % 4294967296 < 100000000); {1836#true} is VALID [2022-04-15 12:46:40,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {1836#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1836#true} is VALID [2022-04-15 12:46:40,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {1836#true} assume !!(~x~0 % 4294967296 < 100000000); {1836#true} is VALID [2022-04-15 12:46:40,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {1836#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1836#true} is VALID [2022-04-15 12:46:40,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {1836#true} assume !!(~x~0 % 4294967296 < 100000000); {1836#true} is VALID [2022-04-15 12:46:40,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {1836#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1836#true} is VALID [2022-04-15 12:46:40,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {1836#true} assume !!(~x~0 % 4294967296 < 100000000); {1836#true} is VALID [2022-04-15 12:46:40,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {1836#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1891#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:40,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {1891#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {1891#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:40,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {1891#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1898#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} is VALID [2022-04-15 12:46:40,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {1898#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {1898#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} is VALID [2022-04-15 12:46:40,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {1898#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1905#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000))} is VALID [2022-04-15 12:46:40,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {1905#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {1905#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000))} is VALID [2022-04-15 12:46:40,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {1905#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1912#(and (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:46:40,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {1912#(and (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000) (< (mod (+ 4294967291 main_~x~0) 4294967296) 10000000))} assume !(~x~0 % 4294967296 < 100000000); {1837#false} is VALID [2022-04-15 12:46:40,554 INFO L272 TraceCheckUtils]: 21: Hoare triple {1837#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {1837#false} is VALID [2022-04-15 12:46:40,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {1837#false} ~cond := #in~cond; {1837#false} is VALID [2022-04-15 12:46:40,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {1837#false} assume 0 == ~cond; {1837#false} is VALID [2022-04-15 12:46:40,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {1837#false} assume !false; {1837#false} is VALID [2022-04-15 12:46:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 30 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 12:46:40,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:40,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {1837#false} assume !false; {1837#false} is VALID [2022-04-15 12:46:40,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {1931#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1837#false} is VALID [2022-04-15 12:46:40,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {1935#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1931#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:46:40,815 INFO L272 TraceCheckUtils]: 21: Hoare triple {1939#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {1935#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:46:40,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {1943#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {1939#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:46:40,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {1947#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1943#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:46:40,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {1947#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {1947#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:40,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {1954#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1947#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:40,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {1954#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {1954#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-15 12:46:40,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {1836#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1954#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-15 12:46:40,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {1836#true} assume !!(~x~0 % 4294967296 < 100000000); {1836#true} is VALID [2022-04-15 12:46:40,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {1836#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1836#true} is VALID [2022-04-15 12:46:40,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {1836#true} assume !!(~x~0 % 4294967296 < 100000000); {1836#true} is VALID [2022-04-15 12:46:40,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {1836#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1836#true} is VALID [2022-04-15 12:46:40,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {1836#true} assume !!(~x~0 % 4294967296 < 100000000); {1836#true} is VALID [2022-04-15 12:46:40,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {1836#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1836#true} is VALID [2022-04-15 12:46:40,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {1836#true} assume !!(~x~0 % 4294967296 < 100000000); {1836#true} is VALID [2022-04-15 12:46:40,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {1836#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1836#true} is VALID [2022-04-15 12:46:40,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {1836#true} assume !!(~x~0 % 4294967296 < 100000000); {1836#true} is VALID [2022-04-15 12:46:40,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {1836#true} ~x~0 := 0; {1836#true} is VALID [2022-04-15 12:46:40,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {1836#true} call #t~ret5 := main(); {1836#true} is VALID [2022-04-15 12:46:40,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1836#true} {1836#true} #40#return; {1836#true} is VALID [2022-04-15 12:46:40,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {1836#true} assume true; {1836#true} is VALID [2022-04-15 12:46:40,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1836#true} is VALID [2022-04-15 12:46:40,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {1836#true} call ULTIMATE.init(); {1836#true} is VALID [2022-04-15 12:46:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 12:46:40,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310742561] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:40,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:40,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 8] total 20 [2022-04-15 12:46:40,821 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:40,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1712381638] [2022-04-15 12:46:40,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1712381638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:40,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:40,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:46:40,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697827508] [2022-04-15 12:46:40,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:40,822 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 25 [2022-04-15 12:46:40,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:40,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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-15 12:46:40,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:40,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:46:40,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:40,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:46:40,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:46:40,846 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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-15 12:46:41,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:41,216 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-15 12:46:41,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:46:41,217 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 25 [2022-04-15 12:46:41,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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-15 12:46:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-15 12:46:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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-15 12:46:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-15 12:46:41,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 37 transitions. [2022-04-15 12:46:41,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:41,256 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:46:41,256 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:46:41,256 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:46:41,257 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:41,257 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 44 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:46:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:46:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 12:46:41,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:41,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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-15 12:46:41,303 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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-15 12:46:41,303 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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-15 12:46:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:41,304 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 12:46:41,304 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:46:41,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:41,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:41,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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 29 states. [2022-04-15 12:46:41,305 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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 29 states. [2022-04-15 12:46:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:41,306 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 12:46:41,306 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:46:41,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:41,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:41,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:41,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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-15 12:46:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-15 12:46:41,307 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2022-04-15 12:46:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:41,307 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-15 12:46:41,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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-15 12:46:41,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-15 12:46:41,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:46:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:46:41,353 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:41,353 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:41,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:41,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 12:46:41,562 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:41,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:41,562 INFO L85 PathProgramCache]: Analyzing trace with hash 421425608, now seen corresponding path program 13 times [2022-04-15 12:46:41,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:41,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1070362308] [2022-04-15 12:46:41,776 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:41,779 INFO L85 PathProgramCache]: Analyzing trace with hash -889438095, now seen corresponding path program 1 times [2022-04-15 12:46:41,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:41,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849696860] [2022-04-15 12:46:41,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:41,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:41,803 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:41,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:41,822 INFO L85 PathProgramCache]: Analyzing trace with hash 421425608, now seen corresponding path program 14 times [2022-04-15 12:46:41,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:41,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842716355] [2022-04-15 12:46:41,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:41,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:41,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:41,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {2223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2210#true} is VALID [2022-04-15 12:46:41,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-15 12:46:41,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2210#true} {2210#true} #40#return; {2210#true} is VALID [2022-04-15 12:46:41,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {2210#true} call ULTIMATE.init(); {2223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:41,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {2223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2210#true} is VALID [2022-04-15 12:46:41,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-15 12:46:41,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2210#true} {2210#true} #40#return; {2210#true} is VALID [2022-04-15 12:46:41,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {2210#true} call #t~ret5 := main(); {2210#true} is VALID [2022-04-15 12:46:41,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {2210#true} ~x~0 := 0; {2215#(= main_~x~0 0)} is VALID [2022-04-15 12:46:41,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {2215#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {2215#(= main_~x~0 0)} is VALID [2022-04-15 12:46:41,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {2215#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2216#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:41,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {2216#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {2216#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:41,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {2216#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2217#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:41,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {2217#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2217#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:41,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {2217#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2218#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:41,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {2218#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2218#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:41,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {2218#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2219#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:41,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {2219#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2219#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:41,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {2219#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2220#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:41,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {2220#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2220#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:41,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {2220#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2221#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:41,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {2221#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {2221#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:41,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {2221#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2222#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-15 12:46:41,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {2222#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !!(~x~0 % 4294967296 < 100000000); {2222#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-15 12:46:41,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {2222#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2211#false} is VALID [2022-04-15 12:46:41,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {2211#false} assume !(~x~0 % 4294967296 < 100000000); {2211#false} is VALID [2022-04-15 12:46:41,997 INFO L272 TraceCheckUtils]: 23: Hoare triple {2211#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {2211#false} is VALID [2022-04-15 12:46:41,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {2211#false} ~cond := #in~cond; {2211#false} is VALID [2022-04-15 12:46:41,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {2211#false} assume 0 == ~cond; {2211#false} is VALID [2022-04-15 12:46:41,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {2211#false} assume !false; {2211#false} is VALID [2022-04-15 12:46:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:41,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:41,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842716355] [2022-04-15 12:46:41,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842716355] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:41,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483386925] [2022-04-15 12:46:41,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:46:41,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:41,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:42,003 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-15 12:46:42,004 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-15 12:46:42,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:46:42,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:42,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 12:46:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:42,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:42,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {2210#true} call ULTIMATE.init(); {2210#true} is VALID [2022-04-15 12:46:42,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {2210#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2210#true} is VALID [2022-04-15 12:46:42,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-15 12:46:42,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2210#true} {2210#true} #40#return; {2210#true} is VALID [2022-04-15 12:46:42,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {2210#true} call #t~ret5 := main(); {2210#true} is VALID [2022-04-15 12:46:42,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {2210#true} ~x~0 := 0; {2215#(= main_~x~0 0)} is VALID [2022-04-15 12:46:42,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {2215#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {2215#(= main_~x~0 0)} is VALID [2022-04-15 12:46:42,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {2215#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2216#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:42,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {2216#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {2216#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:42,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {2216#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2217#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:42,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {2217#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2217#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:42,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {2217#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2218#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:42,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {2218#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2218#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:42,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {2218#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2219#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:42,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {2219#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2219#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:42,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {2219#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2220#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:42,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {2220#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2220#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:42,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {2220#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2221#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:42,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {2221#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {2221#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:42,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {2221#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2284#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:42,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {2284#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2284#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:42,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {2284#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2291#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:42,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {2291#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {2211#false} is VALID [2022-04-15 12:46:42,278 INFO L272 TraceCheckUtils]: 23: Hoare triple {2211#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {2211#false} is VALID [2022-04-15 12:46:42,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {2211#false} ~cond := #in~cond; {2211#false} is VALID [2022-04-15 12:46:42,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {2211#false} assume 0 == ~cond; {2211#false} is VALID [2022-04-15 12:46:42,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {2211#false} assume !false; {2211#false} is VALID [2022-04-15 12:46:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:42,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:42,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {2211#false} assume !false; {2211#false} is VALID [2022-04-15 12:46:42,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {2310#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2211#false} is VALID [2022-04-15 12:46:42,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {2314#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2310#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:46:42,746 INFO L272 TraceCheckUtils]: 23: Hoare triple {2318#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {2314#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:46:42,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {2322#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {2318#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:46:42,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {2326#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2322#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:46:42,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {2326#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {2326#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:42,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {2333#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2326#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:42,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {2333#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {2333#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-15 12:46:42,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {2340#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2333#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-15 12:46:42,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {2340#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {2340#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-15 12:46:42,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {2347#(or (= 100000000 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2340#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-15 12:46:42,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {2347#(or (= 100000000 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {2347#(or (= 100000000 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-15 12:46:42,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {2354#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2347#(or (= 100000000 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-15 12:46:42,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {2354#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {2354#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-15 12:46:42,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {2361#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000000 (mod (+ 7 main_~x~0) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2354#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-15 12:46:42,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {2361#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000000 (mod (+ 7 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {2361#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:46:42,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {2368#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2361#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:46:42,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {2368#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {2368#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-15 12:46:42,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {2375#(or (< (mod (+ main_~x~0 9) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 9) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2368#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-15 12:46:42,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {2375#(or (< (mod (+ main_~x~0 9) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 9) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {2375#(or (< (mod (+ main_~x~0 9) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-15 12:46:42,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {2210#true} ~x~0 := 0; {2375#(or (< (mod (+ main_~x~0 9) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-15 12:46:42,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {2210#true} call #t~ret5 := main(); {2210#true} is VALID [2022-04-15 12:46:42,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2210#true} {2210#true} #40#return; {2210#true} is VALID [2022-04-15 12:46:42,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {2210#true} assume true; {2210#true} is VALID [2022-04-15 12:46:42,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {2210#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2210#true} is VALID [2022-04-15 12:46:42,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {2210#true} call ULTIMATE.init(); {2210#true} is VALID [2022-04-15 12:46:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:42,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483386925] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:42,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:42,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 25 [2022-04-15 12:46:42,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:42,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1070362308] [2022-04-15 12:46:42,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1070362308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:42,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:42,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:46:42,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111351936] [2022-04-15 12:46:42,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:42,761 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 27 [2022-04-15 12:46:42,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:42,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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-15 12:46:42,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:42,782 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:46:42,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:42,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:46:42,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:46:42,783 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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-15 12:46:43,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:43,183 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-15 12:46:43,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:46:43,183 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 27 [2022-04-15 12:46:43,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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-15 12:46:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-15 12:46:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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-15 12:46:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-15 12:46:43,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 39 transitions. [2022-04-15 12:46:43,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:43,218 INFO L225 Difference]: With dead ends: 38 [2022-04-15 12:46:43,218 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 12:46:43,219 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:46:43,220 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:43,220 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 44 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:46:43,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 12:46:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 12:46:43,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:43,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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-15 12:46:43,269 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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-15 12:46:43,270 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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-15 12:46:43,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:43,271 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 12:46:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 12:46:43,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:43,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:43,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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 31 states. [2022-04-15 12:46:43,271 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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 31 states. [2022-04-15 12:46:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:43,272 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 12:46:43,272 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 12:46:43,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:43,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:43,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:43,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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-15 12:46:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-15 12:46:43,274 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2022-04-15 12:46:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:43,274 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-15 12:46:43,274 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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-15 12:46:43,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-15 12:46:43,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 12:46:43,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:46:43,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:43,334 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:43,359 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-15 12:46:43,534 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:43,535 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:43,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:43,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1089946779, now seen corresponding path program 15 times [2022-04-15 12:46:43,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:43,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1864862867] [2022-04-15 12:46:43,713 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:43,714 INFO L85 PathProgramCache]: Analyzing trace with hash -830332751, now seen corresponding path program 1 times [2022-04-15 12:46:43,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:43,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336647768] [2022-04-15 12:46:43,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:43,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:43,744 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:43,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1089946779, now seen corresponding path program 16 times [2022-04-15 12:46:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:43,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569889014] [2022-04-15 12:46:43,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:43,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:43,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:43,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {2629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2615#true} is VALID [2022-04-15 12:46:43,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {2615#true} assume true; {2615#true} is VALID [2022-04-15 12:46:43,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2615#true} {2615#true} #40#return; {2615#true} is VALID [2022-04-15 12:46:43,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:43,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {2629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2615#true} is VALID [2022-04-15 12:46:43,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {2615#true} assume true; {2615#true} is VALID [2022-04-15 12:46:43,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} #40#return; {2615#true} is VALID [2022-04-15 12:46:43,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {2615#true} call #t~ret5 := main(); {2615#true} is VALID [2022-04-15 12:46:43,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {2615#true} ~x~0 := 0; {2620#(= main_~x~0 0)} is VALID [2022-04-15 12:46:43,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {2620#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {2620#(= main_~x~0 0)} is VALID [2022-04-15 12:46:43,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {2620#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2621#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:43,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {2621#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {2621#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:43,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {2621#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2622#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:43,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {2622#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2622#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:43,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {2622#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2623#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:43,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {2623#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2623#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:43,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {2623#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2624#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:43,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {2624#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2624#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:43,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {2624#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2625#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:43,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {2625#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2625#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:43,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {2625#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:43,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {2626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {2626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:43,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {2626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2627#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:43,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {2627#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2627#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:43,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {2627#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2628#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:43,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {2628#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {2628#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:43,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {2628#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2616#false} is VALID [2022-04-15 12:46:43,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {2616#false} assume !(~x~0 % 4294967296 < 100000000); {2616#false} is VALID [2022-04-15 12:46:43,936 INFO L272 TraceCheckUtils]: 25: Hoare triple {2616#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {2616#false} is VALID [2022-04-15 12:46:43,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {2616#false} ~cond := #in~cond; {2616#false} is VALID [2022-04-15 12:46:43,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {2616#false} assume 0 == ~cond; {2616#false} is VALID [2022-04-15 12:46:43,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2022-04-15 12:46:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:43,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:43,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569889014] [2022-04-15 12:46:43,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569889014] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:43,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285107714] [2022-04-15 12:46:43,937 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:46:43,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:43,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:43,940 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:43,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 12:46:43,971 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:46:43,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:43,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 12:46:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:43,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:44,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2615#true} is VALID [2022-04-15 12:46:44,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {2615#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2615#true} is VALID [2022-04-15 12:46:44,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {2615#true} assume true; {2615#true} is VALID [2022-04-15 12:46:44,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} #40#return; {2615#true} is VALID [2022-04-15 12:46:44,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {2615#true} call #t~ret5 := main(); {2615#true} is VALID [2022-04-15 12:46:44,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {2615#true} ~x~0 := 0; {2620#(= main_~x~0 0)} is VALID [2022-04-15 12:46:44,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {2620#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {2620#(= main_~x~0 0)} is VALID [2022-04-15 12:46:44,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {2620#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2621#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:44,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {2621#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {2621#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:44,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {2621#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2622#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:44,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {2622#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2622#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:44,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {2622#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2623#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:44,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {2623#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2623#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:44,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {2623#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2624#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:44,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {2624#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2624#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:44,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {2624#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2625#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:44,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {2625#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2625#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:44,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {2625#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:44,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {2626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {2626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:44,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {2626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2627#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:44,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {2627#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2627#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:44,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {2627#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2696#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:44,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {2696#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2696#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:44,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {2696#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2703#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:44,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {2703#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {2616#false} is VALID [2022-04-15 12:46:44,321 INFO L272 TraceCheckUtils]: 25: Hoare triple {2616#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {2616#false} is VALID [2022-04-15 12:46:44,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {2616#false} ~cond := #in~cond; {2616#false} is VALID [2022-04-15 12:46:44,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {2616#false} assume 0 == ~cond; {2616#false} is VALID [2022-04-15 12:46:44,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2022-04-15 12:46:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:44,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:44,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2022-04-15 12:46:44,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {2616#false} assume 0 == ~cond; {2616#false} is VALID [2022-04-15 12:46:44,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {2616#false} ~cond := #in~cond; {2616#false} is VALID [2022-04-15 12:46:44,641 INFO L272 TraceCheckUtils]: 25: Hoare triple {2616#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {2616#false} is VALID [2022-04-15 12:46:44,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {2731#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {2616#false} is VALID [2022-04-15 12:46:44,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {2735#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2731#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {2735#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2735#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {2742#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2735#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {2742#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2742#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {2749#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2742#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {2749#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2749#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {2756#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2749#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {2756#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2756#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {2763#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2756#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {2763#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2763#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {2770#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2763#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {2770#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2770#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {2777#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2770#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {2777#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2777#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {2784#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2777#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {2784#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2784#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {2791#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2784#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {2791#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2791#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {2615#true} ~x~0 := 0; {2791#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:46:44,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {2615#true} call #t~ret5 := main(); {2615#true} is VALID [2022-04-15 12:46:44,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} #40#return; {2615#true} is VALID [2022-04-15 12:46:44,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {2615#true} assume true; {2615#true} is VALID [2022-04-15 12:46:44,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {2615#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2615#true} is VALID [2022-04-15 12:46:44,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2615#true} is VALID [2022-04-15 12:46:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:44,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285107714] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:44,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:44,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2022-04-15 12:46:44,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:44,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1864862867] [2022-04-15 12:46:44,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1864862867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:44,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:44,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:46:44,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942379491] [2022-04-15 12:46:44,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:44,654 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 29 [2022-04-15 12:46:44,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:44,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-15 12:46:44,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:44,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:46:44,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:44,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:46:44,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:46:44,676 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-15 12:46:45,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:45,188 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-15 12:46:45,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:46:45,188 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 29 [2022-04-15 12:46:45,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-15 12:46:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2022-04-15 12:46:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-15 12:46:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2022-04-15 12:46:45,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2022-04-15 12:46:45,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:45,235 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:46:45,235 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:46:45,236 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=750, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:46:45,236 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:45,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 39 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:46:45,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:46:45,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 12:46:45,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:45,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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-15 12:46:45,293 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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-15 12:46:45,294 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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-15 12:46:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:45,295 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 12:46:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:46:45,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:45,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:45,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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-15 12:46:45,295 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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-15 12:46:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:45,296 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 12:46:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:46:45,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:45,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:45,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:45,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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-15 12:46:45,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-15 12:46:45,298 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-15 12:46:45,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:45,298 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-15 12:46:45,299 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-15 12:46:45,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-15 12:46:45,356 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-15 12:46:45,356 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:46:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:46:45,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:45,356 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:45,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:45,557 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 12:46:45,557 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:45,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:45,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1819864638, now seen corresponding path program 17 times [2022-04-15 12:46:45,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:45,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [50987722] [2022-04-15 12:46:45,749 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:45,750 INFO L85 PathProgramCache]: Analyzing trace with hash -771227407, now seen corresponding path program 1 times [2022-04-15 12:46:45,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:45,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273195972] [2022-04-15 12:46:45,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:45,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:45,782 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:45,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1819864638, now seen corresponding path program 18 times [2022-04-15 12:46:45,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:45,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363323810] [2022-04-15 12:46:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:45,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:45,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:45,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {3060#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3045#true} is VALID [2022-04-15 12:46:45,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {3045#true} assume true; {3045#true} is VALID [2022-04-15 12:46:45,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3045#true} {3045#true} #40#return; {3045#true} is VALID [2022-04-15 12:46:45,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {3045#true} call ULTIMATE.init(); {3060#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:45,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {3060#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3045#true} is VALID [2022-04-15 12:46:45,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {3045#true} assume true; {3045#true} is VALID [2022-04-15 12:46:45,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3045#true} {3045#true} #40#return; {3045#true} is VALID [2022-04-15 12:46:45,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {3045#true} call #t~ret5 := main(); {3045#true} is VALID [2022-04-15 12:46:45,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {3045#true} ~x~0 := 0; {3050#(= main_~x~0 0)} is VALID [2022-04-15 12:46:45,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {3050#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {3050#(= main_~x~0 0)} is VALID [2022-04-15 12:46:45,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {3050#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3051#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:45,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {3051#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {3051#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:45,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {3051#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3052#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:45,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {3052#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {3052#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:45,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {3052#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3053#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:45,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {3053#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3053#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:45,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {3053#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3054#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:45,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {3054#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3054#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:45,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {3054#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3055#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:45,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {3055#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {3055#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:45,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {3055#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3056#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:45,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {3056#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {3056#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:45,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {3056#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3057#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:45,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {3057#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3057#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:45,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {3057#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3058#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:45,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {3058#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3058#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:45,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {3058#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3059#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:45,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {3059#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {3059#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:45,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {3059#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3046#false} is VALID [2022-04-15 12:46:45,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {3046#false} assume !(~x~0 % 4294967296 < 100000000); {3046#false} is VALID [2022-04-15 12:46:45,994 INFO L272 TraceCheckUtils]: 27: Hoare triple {3046#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {3046#false} is VALID [2022-04-15 12:46:45,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {3046#false} ~cond := #in~cond; {3046#false} is VALID [2022-04-15 12:46:45,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {3046#false} assume 0 == ~cond; {3046#false} is VALID [2022-04-15 12:46:45,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {3046#false} assume !false; {3046#false} is VALID [2022-04-15 12:46:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:45,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:45,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363323810] [2022-04-15 12:46:45,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363323810] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:45,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264576022] [2022-04-15 12:46:45,995 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:46:45,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:45,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:45,996 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:46,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 12:46:46,060 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:46:46,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:46,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:46:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:46,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:46,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {3045#true} call ULTIMATE.init(); {3045#true} is VALID [2022-04-15 12:46:46,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {3045#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3045#true} is VALID [2022-04-15 12:46:46,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {3045#true} assume true; {3045#true} is VALID [2022-04-15 12:46:46,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3045#true} {3045#true} #40#return; {3045#true} is VALID [2022-04-15 12:46:46,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {3045#true} call #t~ret5 := main(); {3045#true} is VALID [2022-04-15 12:46:46,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {3045#true} ~x~0 := 0; {3045#true} is VALID [2022-04-15 12:46:46,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:46,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3045#true} is VALID [2022-04-15 12:46:46,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:46,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3045#true} is VALID [2022-04-15 12:46:46,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:46,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3045#true} is VALID [2022-04-15 12:46:46,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:46,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3045#true} is VALID [2022-04-15 12:46:46,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:46,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3045#true} is VALID [2022-04-15 12:46:46,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:46,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3045#true} is VALID [2022-04-15 12:46:46,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:46,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3045#true} is VALID [2022-04-15 12:46:46,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:46,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3045#true} is VALID [2022-04-15 12:46:46,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:46,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3133#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:46,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {3133#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {3133#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:46,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {3133#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3140#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 12:46:46,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {3140#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {3046#false} is VALID [2022-04-15 12:46:46,199 INFO L272 TraceCheckUtils]: 27: Hoare triple {3046#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {3046#false} is VALID [2022-04-15 12:46:46,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {3046#false} ~cond := #in~cond; {3046#false} is VALID [2022-04-15 12:46:46,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {3046#false} assume 0 == ~cond; {3046#false} is VALID [2022-04-15 12:46:46,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {3046#false} assume !false; {3046#false} is VALID [2022-04-15 12:46:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-15 12:46:46,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:47,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {3046#false} assume !false; {3046#false} is VALID [2022-04-15 12:46:47,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {3159#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3046#false} is VALID [2022-04-15 12:46:47,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {3163#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3159#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:46:47,155 INFO L272 TraceCheckUtils]: 27: Hoare triple {3167#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {3163#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:46:47,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {3171#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {3167#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:46:47,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {3175#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3171#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:46:47,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {3179#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {3175#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:47,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3179#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:46:47,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:47,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3045#true} is VALID [2022-04-15 12:46:47,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:47,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3045#true} is VALID [2022-04-15 12:46:47,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:47,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3045#true} is VALID [2022-04-15 12:46:47,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:47,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3045#true} is VALID [2022-04-15 12:46:47,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:47,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3045#true} is VALID [2022-04-15 12:46:47,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:47,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3045#true} is VALID [2022-04-15 12:46:47,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:47,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3045#true} is VALID [2022-04-15 12:46:47,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:47,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {3045#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3045#true} is VALID [2022-04-15 12:46:47,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {3045#true} assume !!(~x~0 % 4294967296 < 100000000); {3045#true} is VALID [2022-04-15 12:46:47,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {3045#true} ~x~0 := 0; {3045#true} is VALID [2022-04-15 12:46:47,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {3045#true} call #t~ret5 := main(); {3045#true} is VALID [2022-04-15 12:46:47,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3045#true} {3045#true} #40#return; {3045#true} is VALID [2022-04-15 12:46:47,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {3045#true} assume true; {3045#true} is VALID [2022-04-15 12:46:47,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {3045#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3045#true} is VALID [2022-04-15 12:46:47,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {3045#true} call ULTIMATE.init(); {3045#true} is VALID [2022-04-15 12:46:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-15 12:46:47,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264576022] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:47,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:47,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 8] total 21 [2022-04-15 12:46:47,165 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:47,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [50987722] [2022-04-15 12:46:47,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [50987722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:47,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:47,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:46:47,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017359289] [2022-04-15 12:46:47,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:47,165 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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 31 [2022-04-15 12:46:47,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:47,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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-15 12:46:47,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:47,191 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:46:47,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:47,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:46:47,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:46:47,195 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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-15 12:46:47,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:47,754 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 12:46:47,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:46:47,754 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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 31 [2022-04-15 12:46:47,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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-15 12:46:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 43 transitions. [2022-04-15 12:46:47,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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-15 12:46:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 43 transitions. [2022-04-15 12:46:47,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 43 transitions. [2022-04-15 12:46:47,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:47,801 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:46:47,801 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:46:47,801 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:46:47,802 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:47,802 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 39 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:46:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:46:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 12:46:47,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:47,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 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-15 12:46:47,866 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 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-15 12:46:47,866 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 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-15 12:46:47,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:47,866 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 12:46:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:46:47,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:47,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:47,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 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 35 states. [2022-04-15 12:46:47,867 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 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 35 states. [2022-04-15 12:46:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:47,868 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 12:46:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:46:47,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:47,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:47,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:47,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:47,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 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-15 12:46:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-15 12:46:47,870 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 31 [2022-04-15 12:46:47,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:47,870 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-15 12:46:47,870 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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-15 12:46:47,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2022-04-15 12:46:47,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:47,921 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:46:47,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:46:47,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:47,921 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:47,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:48,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:48,123 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:48,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:48,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1103709407, now seen corresponding path program 19 times [2022-04-15 12:46:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:48,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1219404723] [2022-04-15 12:46:48,281 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:48,283 INFO L85 PathProgramCache]: Analyzing trace with hash -712122063, now seen corresponding path program 1 times [2022-04-15 12:46:48,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:48,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802087734] [2022-04-15 12:46:48,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:48,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:48,292 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:48,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:48,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1103709407, now seen corresponding path program 20 times [2022-04-15 12:46:48,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:48,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588904179] [2022-04-15 12:46:48,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:48,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:48,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:48,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {3514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3498#true} is VALID [2022-04-15 12:46:48,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {3498#true} assume true; {3498#true} is VALID [2022-04-15 12:46:48,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3498#true} {3498#true} #40#return; {3498#true} is VALID [2022-04-15 12:46:48,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {3498#true} call ULTIMATE.init(); {3514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:48,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {3514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3498#true} is VALID [2022-04-15 12:46:48,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {3498#true} assume true; {3498#true} is VALID [2022-04-15 12:46:48,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3498#true} {3498#true} #40#return; {3498#true} is VALID [2022-04-15 12:46:48,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {3498#true} call #t~ret5 := main(); {3498#true} is VALID [2022-04-15 12:46:48,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {3498#true} ~x~0 := 0; {3503#(= main_~x~0 0)} is VALID [2022-04-15 12:46:48,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {3503#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {3503#(= main_~x~0 0)} is VALID [2022-04-15 12:46:48,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {3503#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3504#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:48,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {3504#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {3504#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:48,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {3504#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3505#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:48,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {3505#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {3505#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:48,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {3505#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3506#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:48,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {3506#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3506#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:48,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {3506#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3507#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:48,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {3507#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3507#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:48,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {3507#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3508#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:48,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {3508#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {3508#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:48,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {3508#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3509#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:48,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {3509#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {3509#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:48,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {3509#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3510#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:48,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {3510#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3510#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:48,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {3510#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3511#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:48,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {3511#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3511#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:48,498 INFO L290 TraceCheckUtils]: 23: Hoare triple {3511#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3512#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:48,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {3512#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3512#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:48,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {3512#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3513#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:48,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {3513#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {3513#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:48,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {3513#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3499#false} is VALID [2022-04-15 12:46:48,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {3499#false} assume !(~x~0 % 4294967296 < 100000000); {3499#false} is VALID [2022-04-15 12:46:48,500 INFO L272 TraceCheckUtils]: 29: Hoare triple {3499#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {3499#false} is VALID [2022-04-15 12:46:48,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {3499#false} ~cond := #in~cond; {3499#false} is VALID [2022-04-15 12:46:48,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {3499#false} assume 0 == ~cond; {3499#false} is VALID [2022-04-15 12:46:48,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {3499#false} assume !false; {3499#false} is VALID [2022-04-15 12:46:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:48,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:48,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588904179] [2022-04-15 12:46:48,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588904179] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:48,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049189231] [2022-04-15 12:46:48,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:46:48,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:48,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:48,524 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:48,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 12:46:48,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:46:48,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:48,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:46:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:48,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:48,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {3498#true} call ULTIMATE.init(); {3498#true} is VALID [2022-04-15 12:46:48,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {3498#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3498#true} is VALID [2022-04-15 12:46:48,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {3498#true} assume true; {3498#true} is VALID [2022-04-15 12:46:48,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3498#true} {3498#true} #40#return; {3498#true} is VALID [2022-04-15 12:46:48,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {3498#true} call #t~ret5 := main(); {3498#true} is VALID [2022-04-15 12:46:48,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {3498#true} ~x~0 := 0; {3503#(= main_~x~0 0)} is VALID [2022-04-15 12:46:48,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {3503#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {3503#(= main_~x~0 0)} is VALID [2022-04-15 12:46:48,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {3503#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3504#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:48,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {3504#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {3504#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:48,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {3504#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3505#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:48,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {3505#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {3505#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:48,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {3505#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3506#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:48,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {3506#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3506#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:48,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {3506#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3507#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:48,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {3507#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3507#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:48,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {3507#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3508#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:48,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {3508#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {3508#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:48,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {3508#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3509#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:48,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {3509#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {3509#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:48,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {3509#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3510#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:48,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {3510#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3510#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:48,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {3510#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3511#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:48,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {3511#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3511#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:48,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {3511#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3512#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:48,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {3512#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3512#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:48,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {3512#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3593#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:48,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {3593#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3593#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:48,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {3593#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3499#false} is VALID [2022-04-15 12:46:48,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {3499#false} assume !(~x~0 % 4294967296 < 100000000); {3499#false} is VALID [2022-04-15 12:46:48,859 INFO L272 TraceCheckUtils]: 29: Hoare triple {3499#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {3499#false} is VALID [2022-04-15 12:46:48,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {3499#false} ~cond := #in~cond; {3499#false} is VALID [2022-04-15 12:46:48,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {3499#false} assume 0 == ~cond; {3499#false} is VALID [2022-04-15 12:46:48,859 INFO L290 TraceCheckUtils]: 32: Hoare triple {3499#false} assume !false; {3499#false} is VALID [2022-04-15 12:46:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:48,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:49,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {3499#false} assume !false; {3499#false} is VALID [2022-04-15 12:46:49,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {3499#false} assume 0 == ~cond; {3499#false} is VALID [2022-04-15 12:46:49,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {3499#false} ~cond := #in~cond; {3499#false} is VALID [2022-04-15 12:46:49,435 INFO L272 TraceCheckUtils]: 29: Hoare triple {3499#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {3499#false} is VALID [2022-04-15 12:46:49,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {3499#false} assume !(~x~0 % 4294967296 < 100000000); {3499#false} is VALID [2022-04-15 12:46:49,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {3630#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3499#false} is VALID [2022-04-15 12:46:49,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {3634#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {3630#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:46:49,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {3638#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3634#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:46:49,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {3638#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {3638#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:49,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {3645#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3638#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:49,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {3645#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {3645#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:49,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {3652#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3645#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:49,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {3652#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {3652#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:46:49,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {3659#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3652#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:46:49,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {3659#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {3659#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:49,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {3666#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3659#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:49,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {3666#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {3666#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:46:49,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {3673#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3666#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:46:49,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {3673#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {3673#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:46:49,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {3680#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3673#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:46:49,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {3680#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {3680#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:46:49,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {3687#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3680#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:46:49,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {3687#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {3687#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:46:49,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {3694#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3687#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:46:49,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {3694#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {3694#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:49,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {3701#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3694#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:49,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {3701#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {3701#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:49,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {3498#true} ~x~0 := 0; {3701#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:49,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {3498#true} call #t~ret5 := main(); {3498#true} is VALID [2022-04-15 12:46:49,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3498#true} {3498#true} #40#return; {3498#true} is VALID [2022-04-15 12:46:49,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {3498#true} assume true; {3498#true} is VALID [2022-04-15 12:46:49,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {3498#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3498#true} is VALID [2022-04-15 12:46:49,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {3498#true} call ULTIMATE.init(); {3498#true} is VALID [2022-04-15 12:46:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:49,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049189231] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:49,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:49,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 27 [2022-04-15 12:46:49,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:49,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1219404723] [2022-04-15 12:46:49,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1219404723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:49,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:49,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:46:49,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896784156] [2022-04-15 12:46:49,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:49,453 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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 33 [2022-04-15 12:46:49,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:49,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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-15 12:46:49,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:49,479 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:46:49,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:49,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:46:49,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:46:49,480 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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-15 12:46:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:50,156 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-15 12:46:50,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:46:50,156 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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 33 [2022-04-15 12:46:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:50,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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-15 12:46:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2022-04-15 12:46:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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-15 12:46:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2022-04-15 12:46:50,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 45 transitions. [2022-04-15 12:46:50,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:50,197 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:46:50,197 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 12:46:50,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=403, Invalid=1003, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:46:50,198 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:50,199 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 59 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:46:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 12:46:50,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 12:46:50,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:50,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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-15 12:46:50,279 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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-15 12:46:50,279 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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-15 12:46:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:50,280 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 12:46:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 12:46:50,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:50,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:50,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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 37 states. [2022-04-15 12:46:50,281 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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 37 states. [2022-04-15 12:46:50,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:50,281 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 12:46:50,281 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 12:46:50,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:50,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:50,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:50,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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-15 12:46:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-15 12:46:50,282 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 33 [2022-04-15 12:46:50,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:50,283 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-15 12:46:50,283 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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-15 12:46:50,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-15 12:46:50,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:50,344 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 12:46:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:46:50,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:50,344 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:50,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:50,545 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22 [2022-04-15 12:46:50,545 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:50,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:50,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1749755068, now seen corresponding path program 21 times [2022-04-15 12:46:50,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:50,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1064801759] [2022-04-15 12:46:50,724 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:50,726 INFO L85 PathProgramCache]: Analyzing trace with hash -653016719, now seen corresponding path program 1 times [2022-04-15 12:46:50,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:50,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53918046] [2022-04-15 12:46:50,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:50,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:50,744 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:50,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:50,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1749755068, now seen corresponding path program 22 times [2022-04-15 12:46:50,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:50,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567182456] [2022-04-15 12:46:50,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:50,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:50,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:50,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {4000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3983#true} is VALID [2022-04-15 12:46:50,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {3983#true} assume true; {3983#true} is VALID [2022-04-15 12:46:50,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3983#true} {3983#true} #40#return; {3983#true} is VALID [2022-04-15 12:46:50,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {3983#true} call ULTIMATE.init(); {4000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:50,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {4000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3983#true} is VALID [2022-04-15 12:46:50,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {3983#true} assume true; {3983#true} is VALID [2022-04-15 12:46:50,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3983#true} {3983#true} #40#return; {3983#true} is VALID [2022-04-15 12:46:50,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {3983#true} call #t~ret5 := main(); {3983#true} is VALID [2022-04-15 12:46:50,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {3983#true} ~x~0 := 0; {3988#(= main_~x~0 0)} is VALID [2022-04-15 12:46:50,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {3988#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {3988#(= main_~x~0 0)} is VALID [2022-04-15 12:46:50,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {3988#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3989#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:50,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {3989#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {3989#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:50,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {3989#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3990#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:50,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {3990#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {3990#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:50,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {3990#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3991#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:50,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {3991#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3991#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:50,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {3991#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3992#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:50,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {3992#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3992#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:50,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {3992#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3993#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:50,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {3993#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {3993#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:50,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {3993#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3994#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:50,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {3994#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {3994#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:50,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {3994#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3995#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:50,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {3995#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3995#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:50,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {3995#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3996#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:50,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {3996#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3996#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:50,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {3996#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3997#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:50,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {3997#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3997#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:50,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {3997#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3998#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:50,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {3998#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3998#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:50,961 INFO L290 TraceCheckUtils]: 27: Hoare triple {3998#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3999#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:50,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {3999#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {3999#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:50,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {3999#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3984#false} is VALID [2022-04-15 12:46:50,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {3984#false} assume !(~x~0 % 4294967296 < 100000000); {3984#false} is VALID [2022-04-15 12:46:50,962 INFO L272 TraceCheckUtils]: 31: Hoare triple {3984#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {3984#false} is VALID [2022-04-15 12:46:50,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {3984#false} ~cond := #in~cond; {3984#false} is VALID [2022-04-15 12:46:50,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {3984#false} assume 0 == ~cond; {3984#false} is VALID [2022-04-15 12:46:50,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {3984#false} assume !false; {3984#false} is VALID [2022-04-15 12:46:50,963 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:50,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:50,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567182456] [2022-04-15 12:46:50,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567182456] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:50,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99924657] [2022-04-15 12:46:50,963 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:46:50,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:50,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:50,964 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:50,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 12:46:50,998 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:46:50,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:50,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:46:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:51,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:51,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {3983#true} call ULTIMATE.init(); {3983#true} is VALID [2022-04-15 12:46:51,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {3983#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3983#true} is VALID [2022-04-15 12:46:51,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {3983#true} assume true; {3983#true} is VALID [2022-04-15 12:46:51,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3983#true} {3983#true} #40#return; {3983#true} is VALID [2022-04-15 12:46:51,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {3983#true} call #t~ret5 := main(); {3983#true} is VALID [2022-04-15 12:46:51,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {3983#true} ~x~0 := 0; {3988#(= main_~x~0 0)} is VALID [2022-04-15 12:46:51,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {3988#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {3988#(= main_~x~0 0)} is VALID [2022-04-15 12:46:51,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {3988#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3989#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:51,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {3989#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {3989#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:51,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {3989#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3990#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:51,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {3990#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {3990#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:51,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {3990#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3991#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:51,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {3991#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3991#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:51,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {3991#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3992#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:51,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {3992#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3992#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:51,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {3992#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3993#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:51,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {3993#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {3993#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:51,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {3993#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3994#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:51,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {3994#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {3994#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:51,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {3994#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3995#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:51,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {3995#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3995#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:51,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {3995#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3996#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:51,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {3996#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3996#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:51,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {3996#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3997#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:51,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {3997#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3997#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:51,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {3997#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3998#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:51,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {3998#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3998#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:51,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {3998#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4085#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:51,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {4085#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4085#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:51,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {4085#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4092#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:46:51,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {4092#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {3984#false} is VALID [2022-04-15 12:46:51,376 INFO L272 TraceCheckUtils]: 31: Hoare triple {3984#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {3984#false} is VALID [2022-04-15 12:46:51,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {3984#false} ~cond := #in~cond; {3984#false} is VALID [2022-04-15 12:46:51,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {3984#false} assume 0 == ~cond; {3984#false} is VALID [2022-04-15 12:46:51,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {3984#false} assume !false; {3984#false} is VALID [2022-04-15 12:46:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:51,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:51,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {3984#false} assume !false; {3984#false} is VALID [2022-04-15 12:46:51,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {3984#false} assume 0 == ~cond; {3984#false} is VALID [2022-04-15 12:46:51,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {3984#false} ~cond := #in~cond; {3984#false} is VALID [2022-04-15 12:46:51,837 INFO L272 TraceCheckUtils]: 31: Hoare triple {3984#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {3984#false} is VALID [2022-04-15 12:46:51,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {4120#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {3984#false} is VALID [2022-04-15 12:46:51,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {4124#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4120#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {4124#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4124#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {4131#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4124#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {4131#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4131#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {4138#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4131#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {4138#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4138#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {4145#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4138#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {4145#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4145#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {4152#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4145#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {4152#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4152#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {4159#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4152#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {4159#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4159#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {4166#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4159#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {4166#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4166#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {4173#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4166#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {4173#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4173#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {4180#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4173#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {4180#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4180#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {4187#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4180#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {4187#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4187#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {4194#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4187#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {4194#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4194#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {4201#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4194#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {4201#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4201#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {3983#true} ~x~0 := 0; {4201#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:46:51,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {3983#true} call #t~ret5 := main(); {3983#true} is VALID [2022-04-15 12:46:51,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3983#true} {3983#true} #40#return; {3983#true} is VALID [2022-04-15 12:46:51,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {3983#true} assume true; {3983#true} is VALID [2022-04-15 12:46:51,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {3983#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3983#true} is VALID [2022-04-15 12:46:51,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {3983#true} call ULTIMATE.init(); {3983#true} is VALID [2022-04-15 12:46:51,863 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:51,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99924657] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:51,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:51,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2022-04-15 12:46:51,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:51,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1064801759] [2022-04-15 12:46:51,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1064801759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:51,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:51,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:46:51,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131624831] [2022-04-15 12:46:51,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:51,865 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 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 35 [2022-04-15 12:46:51,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:51,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 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-15 12:46:51,894 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-15 12:46:51,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:46:51,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:51,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:46:51,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=619, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:46:51,895 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 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-15 12:46:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:52,672 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-15 12:46:52,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:46:52,672 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 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 35 [2022-04-15 12:46:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 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-15 12:46:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-15 12:46:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 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-15 12:46:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-15 12:46:52,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 47 transitions. [2022-04-15 12:46:52,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:52,718 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:46:52,718 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:46:52,719 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=477, Invalid=1245, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:46:52,719 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:52,720 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 74 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:46:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:46:52,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 12:46:52,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:52,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:52,786 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:52,786 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:52,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:52,787 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 12:46:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:46:52,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:52,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:52,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:46:52,787 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:46:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:52,788 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 12:46:52,788 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:46:52,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:52,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:52,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:52,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-15 12:46:52,789 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 35 [2022-04-15 12:46:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:52,789 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-15 12:46:52,790 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 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-15 12:46:52,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-15 12:46:52,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:46:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 12:46:52,865 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:52,865 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:52,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:53,066 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24 [2022-04-15 12:46:53,066 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:53,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:53,066 INFO L85 PathProgramCache]: Analyzing trace with hash -170622631, now seen corresponding path program 23 times [2022-04-15 12:46:53,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:53,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [107144013] [2022-04-15 12:46:53,275 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:53,277 INFO L85 PathProgramCache]: Analyzing trace with hash -593911375, now seen corresponding path program 1 times [2022-04-15 12:46:53,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:53,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924694152] [2022-04-15 12:46:53,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:53,284 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:53,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:53,290 INFO L85 PathProgramCache]: Analyzing trace with hash -170622631, now seen corresponding path program 24 times [2022-04-15 12:46:53,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:53,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175761274] [2022-04-15 12:46:53,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:53,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:53,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:53,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {4515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4497#true} is VALID [2022-04-15 12:46:53,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {4497#true} assume true; {4497#true} is VALID [2022-04-15 12:46:53,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4497#true} {4497#true} #40#return; {4497#true} is VALID [2022-04-15 12:46:53,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {4497#true} call ULTIMATE.init(); {4515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:53,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {4515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4497#true} is VALID [2022-04-15 12:46:53,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {4497#true} assume true; {4497#true} is VALID [2022-04-15 12:46:53,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4497#true} {4497#true} #40#return; {4497#true} is VALID [2022-04-15 12:46:53,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {4497#true} call #t~ret5 := main(); {4497#true} is VALID [2022-04-15 12:46:53,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {4497#true} ~x~0 := 0; {4502#(= main_~x~0 0)} is VALID [2022-04-15 12:46:53,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {4502#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {4502#(= main_~x~0 0)} is VALID [2022-04-15 12:46:53,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {4502#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4503#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:53,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {4503#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {4503#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:53,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {4503#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4504#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:53,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {4504#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {4504#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:53,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {4504#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4505#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:53,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {4505#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4505#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:53,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {4505#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4506#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:53,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {4506#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4506#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:53,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {4506#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4507#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:53,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {4507#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {4507#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:53,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {4507#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4508#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:53,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {4508#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {4508#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:53,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {4508#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4509#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:53,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {4509#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4509#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:53,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {4509#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4510#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:53,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {4510#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4510#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:53,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {4510#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4511#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:53,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {4511#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4511#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:53,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {4511#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4512#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:53,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {4512#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4512#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:53,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {4512#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4513#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:53,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {4513#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4513#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:53,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {4513#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4514#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:53,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {4514#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {4514#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:53,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {4514#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4498#false} is VALID [2022-04-15 12:46:53,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {4498#false} assume !(~x~0 % 4294967296 < 100000000); {4498#false} is VALID [2022-04-15 12:46:53,557 INFO L272 TraceCheckUtils]: 33: Hoare triple {4498#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {4498#false} is VALID [2022-04-15 12:46:53,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {4498#false} ~cond := #in~cond; {4498#false} is VALID [2022-04-15 12:46:53,557 INFO L290 TraceCheckUtils]: 35: Hoare triple {4498#false} assume 0 == ~cond; {4498#false} is VALID [2022-04-15 12:46:53,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {4498#false} assume !false; {4498#false} is VALID [2022-04-15 12:46:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:53,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:53,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175761274] [2022-04-15 12:46:53,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175761274] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:53,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226014282] [2022-04-15 12:46:53,558 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:46:53,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:53,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:53,564 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:53,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 12:46:53,629 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:46:53,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:53,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:46:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:53,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:53,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {4497#true} call ULTIMATE.init(); {4497#true} is VALID [2022-04-15 12:46:53,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {4497#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4497#true} is VALID [2022-04-15 12:46:53,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {4497#true} assume true; {4497#true} is VALID [2022-04-15 12:46:53,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4497#true} {4497#true} #40#return; {4497#true} is VALID [2022-04-15 12:46:53,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {4497#true} call #t~ret5 := main(); {4497#true} is VALID [2022-04-15 12:46:53,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {4497#true} ~x~0 := 0; {4497#true} is VALID [2022-04-15 12:46:53,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:53,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:53,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:53,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:53,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:53,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:53,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:53,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:53,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:53,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:53,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:53,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:53,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:53,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:53,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:53,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:53,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:53,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:53,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:53,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:53,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:53,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:53,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:53,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4606#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:53,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {4606#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {4606#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:53,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {4606#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4613#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 12:46:53,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {4613#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {4498#false} is VALID [2022-04-15 12:46:53,799 INFO L272 TraceCheckUtils]: 33: Hoare triple {4498#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {4498#false} is VALID [2022-04-15 12:46:53,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {4498#false} ~cond := #in~cond; {4498#false} is VALID [2022-04-15 12:46:53,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {4498#false} assume 0 == ~cond; {4498#false} is VALID [2022-04-15 12:46:53,800 INFO L290 TraceCheckUtils]: 36: Hoare triple {4498#false} assume !false; {4498#false} is VALID [2022-04-15 12:46:53,800 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 36 proven. 1 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-15 12:46:53,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:54,790 INFO L290 TraceCheckUtils]: 36: Hoare triple {4498#false} assume !false; {4498#false} is VALID [2022-04-15 12:46:54,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {4632#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4498#false} is VALID [2022-04-15 12:46:54,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {4636#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4632#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:46:54,792 INFO L272 TraceCheckUtils]: 33: Hoare triple {4640#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {4636#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:46:54,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {4644#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {4640#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:46:54,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {4648#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4644#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:46:54,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {4652#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {4648#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:54,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4652#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:46:54,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:54,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:54,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:54,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:54,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:54,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:54,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:54,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:54,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:54,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:54,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:54,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:54,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:54,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:54,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:54,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:54,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:54,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:54,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:54,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:54,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:54,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {4497#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4497#true} is VALID [2022-04-15 12:46:54,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {4497#true} assume !!(~x~0 % 4294967296 < 100000000); {4497#true} is VALID [2022-04-15 12:46:54,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {4497#true} ~x~0 := 0; {4497#true} is VALID [2022-04-15 12:46:54,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {4497#true} call #t~ret5 := main(); {4497#true} is VALID [2022-04-15 12:46:54,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4497#true} {4497#true} #40#return; {4497#true} is VALID [2022-04-15 12:46:54,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {4497#true} assume true; {4497#true} is VALID [2022-04-15 12:46:54,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {4497#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4497#true} is VALID [2022-04-15 12:46:54,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {4497#true} call ULTIMATE.init(); {4497#true} is VALID [2022-04-15 12:46:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 36 proven. 1 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-15 12:46:54,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226014282] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:54,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:54,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4, 8] total 24 [2022-04-15 12:46:54,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:54,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [107144013] [2022-04-15 12:46:54,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [107144013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:54,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:54,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:46:54,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031516347] [2022-04-15 12:46:54,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:54,801 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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 37 [2022-04-15 12:46:54,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:54,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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-15 12:46:54,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:54,839 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:46:54,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:54,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:46:54,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:46:54,840 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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-15 12:46:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:55,774 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-15 12:46:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:46:55,775 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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 37 [2022-04-15 12:46:55,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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-15 12:46:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-15 12:46:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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-15 12:46:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-15 12:46:55,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 49 transitions. [2022-04-15 12:46:55,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:55,824 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:46:55,824 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 12:46:55,825 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:46:55,825 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:55,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 64 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:46:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 12:46:55,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 12:46:55,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:55,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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-15 12:46:55,915 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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-15 12:46:55,915 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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-15 12:46:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:55,916 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 12:46:55,916 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 12:46:55,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:55,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:55,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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 41 states. [2022-04-15 12:46:55,916 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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 41 states. [2022-04-15 12:46:55,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:55,917 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 12:46:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 12:46:55,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:55,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:55,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:55,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 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-15 12:46:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-04-15 12:46:55,918 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 37 [2022-04-15 12:46:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:55,919 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-04-15 12:46:55,919 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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-15 12:46:55,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 43 transitions. [2022-04-15 12:46:55,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:55,987 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 12:46:55,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 12:46:55,987 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:55,987 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:55,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:56,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26 [2022-04-15 12:46:56,191 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:56,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:56,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1182345910, now seen corresponding path program 25 times [2022-04-15 12:46:56,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:56,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1884433673] [2022-04-15 12:46:56,377 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:56,378 INFO L85 PathProgramCache]: Analyzing trace with hash -534806031, now seen corresponding path program 1 times [2022-04-15 12:46:56,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:56,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745353367] [2022-04-15 12:46:56,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:56,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:56,386 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:56,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:56,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1182345910, now seen corresponding path program 26 times [2022-04-15 12:46:56,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:56,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182873186] [2022-04-15 12:46:56,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:56,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:56,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:56,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {5050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5031#true} is VALID [2022-04-15 12:46:56,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {5031#true} assume true; {5031#true} is VALID [2022-04-15 12:46:56,630 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5031#true} {5031#true} #40#return; {5031#true} is VALID [2022-04-15 12:46:56,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {5031#true} call ULTIMATE.init(); {5050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:56,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {5050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5031#true} is VALID [2022-04-15 12:46:56,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {5031#true} assume true; {5031#true} is VALID [2022-04-15 12:46:56,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5031#true} {5031#true} #40#return; {5031#true} is VALID [2022-04-15 12:46:56,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {5031#true} call #t~ret5 := main(); {5031#true} is VALID [2022-04-15 12:46:56,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {5031#true} ~x~0 := 0; {5036#(= main_~x~0 0)} is VALID [2022-04-15 12:46:56,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {5036#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {5036#(= main_~x~0 0)} is VALID [2022-04-15 12:46:56,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {5036#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5037#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:56,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {5037#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {5037#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:56,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {5037#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5038#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:56,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {5038#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {5038#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:56,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {5038#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5039#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:56,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {5039#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5039#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:56,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {5039#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5040#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:56,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {5040#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5040#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:56,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {5040#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5041#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:56,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {5041#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {5041#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:56,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {5041#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5042#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:56,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {5042#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {5042#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:56,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {5042#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5043#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:56,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {5043#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5043#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:56,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {5043#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5044#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:56,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {5044#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5044#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:56,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {5044#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5045#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:56,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {5045#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5045#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:56,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {5045#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5046#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:56,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {5046#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5046#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:56,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {5046#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5047#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:56,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {5047#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5047#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:56,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {5047#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5048#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:56,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {5048#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5048#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:56,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {5048#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5049#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:56,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {5049#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {5049#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:56,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {5049#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {5032#false} is VALID [2022-04-15 12:46:56,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {5032#false} assume !(~x~0 % 4294967296 < 100000000); {5032#false} is VALID [2022-04-15 12:46:56,650 INFO L272 TraceCheckUtils]: 35: Hoare triple {5032#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {5032#false} is VALID [2022-04-15 12:46:56,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {5032#false} ~cond := #in~cond; {5032#false} is VALID [2022-04-15 12:46:56,650 INFO L290 TraceCheckUtils]: 37: Hoare triple {5032#false} assume 0 == ~cond; {5032#false} is VALID [2022-04-15 12:46:56,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {5032#false} assume !false; {5032#false} is VALID [2022-04-15 12:46:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:56,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:56,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182873186] [2022-04-15 12:46:56,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182873186] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:56,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840457087] [2022-04-15 12:46:56,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:46:56,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:56,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:56,652 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:56,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 12:46:56,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:46:56,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:56,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 12:46:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:56,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:56,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {5031#true} call ULTIMATE.init(); {5031#true} is VALID [2022-04-15 12:46:56,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {5031#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5031#true} is VALID [2022-04-15 12:46:56,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {5031#true} assume true; {5031#true} is VALID [2022-04-15 12:46:56,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5031#true} {5031#true} #40#return; {5031#true} is VALID [2022-04-15 12:46:56,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {5031#true} call #t~ret5 := main(); {5031#true} is VALID [2022-04-15 12:46:56,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {5031#true} ~x~0 := 0; {5036#(= main_~x~0 0)} is VALID [2022-04-15 12:46:56,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {5036#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {5036#(= main_~x~0 0)} is VALID [2022-04-15 12:46:56,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {5036#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5037#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:56,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {5037#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {5037#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:56,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {5037#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5038#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:56,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {5038#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {5038#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:56,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {5038#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5039#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:56,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {5039#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5039#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:56,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {5039#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5040#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:56,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {5040#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5040#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:56,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {5040#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5041#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:56,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {5041#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {5041#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:56,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {5041#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5042#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:56,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {5042#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {5042#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:56,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {5042#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5043#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:56,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {5043#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5043#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:57,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {5043#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5044#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:57,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {5044#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5044#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:57,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {5044#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5045#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:57,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {5045#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5045#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:57,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {5045#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5046#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:57,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {5046#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5046#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:57,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {5046#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5047#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:57,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {5047#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5047#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:57,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {5047#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5048#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:57,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {5048#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5048#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:57,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {5048#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5147#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:46:57,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {5147#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5147#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:46:57,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {5147#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {5154#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:46:57,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {5154#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 < 100000000); {5032#false} is VALID [2022-04-15 12:46:57,008 INFO L272 TraceCheckUtils]: 35: Hoare triple {5032#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {5032#false} is VALID [2022-04-15 12:46:57,008 INFO L290 TraceCheckUtils]: 36: Hoare triple {5032#false} ~cond := #in~cond; {5032#false} is VALID [2022-04-15 12:46:57,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {5032#false} assume 0 == ~cond; {5032#false} is VALID [2022-04-15 12:46:57,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {5032#false} assume !false; {5032#false} is VALID [2022-04-15 12:46:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:57,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:57,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {5032#false} assume !false; {5032#false} is VALID [2022-04-15 12:46:57,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {5173#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5032#false} is VALID [2022-04-15 12:46:57,872 INFO L290 TraceCheckUtils]: 36: Hoare triple {5177#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5173#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:46:57,873 INFO L272 TraceCheckUtils]: 35: Hoare triple {5181#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {5177#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:46:57,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {5185#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {5181#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:46:57,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {5189#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {5185#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:46:57,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {5189#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {5189#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:57,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {5196#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5189#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:57,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {5196#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {5196#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-15 12:46:57,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {5203#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5196#(or (= (mod (+ main_~x~0 3) 4294967296) 100000000) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-15 12:46:57,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {5203#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {5203#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-15 12:46:57,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {5210#(or (= 100000000 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5203#(or (= 100000000 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 4) 4294967296) 100000000))} is VALID [2022-04-15 12:46:57,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {5210#(or (= 100000000 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {5210#(or (= 100000000 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-15 12:46:57,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {5217#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5210#(or (= 100000000 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-15 12:46:57,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {5217#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {5217#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-15 12:46:57,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {5224#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000000 (mod (+ 7 main_~x~0) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5217#(or (= 100000000 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 100000000))} is VALID [2022-04-15 12:46:57,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {5224#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000000 (mod (+ 7 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {5224#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:46:57,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {5231#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5224#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:46:57,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {5231#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {5231#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-15 12:46:57,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {5238#(or (< (mod (+ main_~x~0 9) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 9) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5231#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-15 12:46:57,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {5238#(or (< (mod (+ main_~x~0 9) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 9) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {5238#(or (< (mod (+ main_~x~0 9) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-15 12:46:57,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {5245#(or (= 100000000 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5238#(or (< (mod (+ main_~x~0 9) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-15 12:46:57,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {5245#(or (= 100000000 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {5245#(or (= 100000000 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 100000000))} is VALID [2022-04-15 12:46:57,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {5252#(or (< (mod (+ main_~x~0 11) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 11) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5245#(or (= 100000000 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 100000000))} is VALID [2022-04-15 12:46:57,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {5252#(or (< (mod (+ main_~x~0 11) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 11) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {5252#(or (< (mod (+ main_~x~0 11) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-15 12:46:57,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {5259#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 12) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5252#(or (< (mod (+ main_~x~0 11) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-15 12:46:57,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {5259#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 12) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {5259#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-15 12:46:57,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {5266#(or (< (mod (+ main_~x~0 13) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 13) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5259#(or (< (mod (+ main_~x~0 12) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-15 12:46:57,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {5266#(or (< (mod (+ main_~x~0 13) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 13) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {5266#(or (< (mod (+ main_~x~0 13) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-15 12:46:57,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {5273#(or (= 100000000 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5266#(or (< (mod (+ main_~x~0 13) 4294967296) 100000000) (= 100000000 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-15 12:46:57,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {5273#(or (= 100000000 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {5273#(or (= 100000000 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 100000000))} is VALID [2022-04-15 12:46:57,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {5280#(or (= 100000000 (mod (+ main_~x~0 15) 4294967296)) (< (mod (+ main_~x~0 15) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5273#(or (= 100000000 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 100000000))} is VALID [2022-04-15 12:46:57,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {5280#(or (= 100000000 (mod (+ main_~x~0 15) 4294967296)) (< (mod (+ main_~x~0 15) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {5280#(or (= 100000000 (mod (+ main_~x~0 15) 4294967296)) (< (mod (+ main_~x~0 15) 4294967296) 100000000))} is VALID [2022-04-15 12:46:57,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {5031#true} ~x~0 := 0; {5280#(or (= 100000000 (mod (+ main_~x~0 15) 4294967296)) (< (mod (+ main_~x~0 15) 4294967296) 100000000))} is VALID [2022-04-15 12:46:57,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {5031#true} call #t~ret5 := main(); {5031#true} is VALID [2022-04-15 12:46:57,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5031#true} {5031#true} #40#return; {5031#true} is VALID [2022-04-15 12:46:57,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {5031#true} assume true; {5031#true} is VALID [2022-04-15 12:46:57,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {5031#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5031#true} is VALID [2022-04-15 12:46:57,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {5031#true} call ULTIMATE.init(); {5031#true} is VALID [2022-04-15 12:46:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:57,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840457087] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:57,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:57,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 20] total 37 [2022-04-15 12:46:57,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:57,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1884433673] [2022-04-15 12:46:57,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1884433673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:57,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:57,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:46:57,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879146808] [2022-04-15 12:46:57,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:57,894 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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 39 [2022-04-15 12:46:57,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:57,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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-15 12:46:57,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:57,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:46:57,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:57,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:46:57,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1006, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:46:57,931 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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-15 12:46:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:59,046 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-15 12:46:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:46:59,046 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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 39 [2022-04-15 12:46:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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-15 12:46:59,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2022-04-15 12:46:59,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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-15 12:46:59,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2022-04-15 12:46:59,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 51 transitions. [2022-04-15 12:46:59,098 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-15 12:46:59,099 INFO L225 Difference]: With dead ends: 50 [2022-04-15 12:46:59,099 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 12:46:59,100 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=618, Invalid=1932, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:46:59,100 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:59,100 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 84 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:46:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 12:46:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 12:46:59,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:59,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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-15 12:46:59,174 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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-15 12:46:59,174 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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-15 12:46:59,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:59,175 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-04-15 12:46:59,176 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-15 12:46:59,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:59,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:59,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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 43 states. [2022-04-15 12:46:59,177 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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 43 states. [2022-04-15 12:46:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:59,178 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-04-15 12:46:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-15 12:46:59,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:59,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:59,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:59,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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-15 12:46:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-04-15 12:46:59,180 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 39 [2022-04-15 12:46:59,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:59,180 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-04-15 12:46:59,180 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 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-15 12:46:59,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 45 transitions. [2022-04-15 12:46:59,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-15 12:46:59,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 12:46:59,246 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:59,246 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:59,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:59,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2022-04-15 12:46:59,447 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:59,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:59,447 INFO L85 PathProgramCache]: Analyzing trace with hash 10023123, now seen corresponding path program 27 times [2022-04-15 12:46:59,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:59,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1358892346] [2022-04-15 12:46:59,625 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:59,627 INFO L85 PathProgramCache]: Analyzing trace with hash -475700687, now seen corresponding path program 1 times [2022-04-15 12:46:59,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:59,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461508827] [2022-04-15 12:46:59,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:59,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:59,635 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:59,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:59,641 INFO L85 PathProgramCache]: Analyzing trace with hash 10023123, now seen corresponding path program 28 times [2022-04-15 12:46:59,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:59,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128560116] [2022-04-15 12:46:59,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:59,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:59,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:59,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {5624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5604#true} is VALID [2022-04-15 12:46:59,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {5604#true} assume true; {5604#true} is VALID [2022-04-15 12:46:59,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5604#true} {5604#true} #40#return; {5604#true} is VALID [2022-04-15 12:46:59,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {5604#true} call ULTIMATE.init(); {5624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:59,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {5624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5604#true} is VALID [2022-04-15 12:46:59,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {5604#true} assume true; {5604#true} is VALID [2022-04-15 12:46:59,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5604#true} {5604#true} #40#return; {5604#true} is VALID [2022-04-15 12:46:59,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {5604#true} call #t~ret5 := main(); {5604#true} is VALID [2022-04-15 12:46:59,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {5604#true} ~x~0 := 0; {5609#(= main_~x~0 0)} is VALID [2022-04-15 12:46:59,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {5609#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {5609#(= main_~x~0 0)} is VALID [2022-04-15 12:46:59,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {5609#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5610#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:59,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {5610#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {5610#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:59,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {5610#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:59,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {5611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {5611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:59,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {5611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:59,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {5612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:59,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {5612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:59,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {5613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:59,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {5613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:59,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {5614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {5614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:59,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {5614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5615#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:59,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {5615#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {5615#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:59,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {5615#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:59,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {5616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:59,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {5616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5617#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:59,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {5617#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5617#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:59,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {5617#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5618#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:59,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {5618#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5618#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:59,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {5618#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5619#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:59,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {5619#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5619#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:59,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {5619#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5620#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:59,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {5620#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5620#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:59,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {5620#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5621#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:59,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {5621#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5621#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:59,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {5621#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5622#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:46:59,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {5622#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5622#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:46:59,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {5622#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5623#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:59,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {5623#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {5623#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:59,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {5623#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {5605#false} is VALID [2022-04-15 12:46:59,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {5605#false} assume !(~x~0 % 4294967296 < 100000000); {5605#false} is VALID [2022-04-15 12:46:59,934 INFO L272 TraceCheckUtils]: 37: Hoare triple {5605#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {5605#false} is VALID [2022-04-15 12:46:59,934 INFO L290 TraceCheckUtils]: 38: Hoare triple {5605#false} ~cond := #in~cond; {5605#false} is VALID [2022-04-15 12:46:59,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {5605#false} assume 0 == ~cond; {5605#false} is VALID [2022-04-15 12:46:59,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {5605#false} assume !false; {5605#false} is VALID [2022-04-15 12:46:59,934 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:59,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:59,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128560116] [2022-04-15 12:46:59,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128560116] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:59,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005800821] [2022-04-15 12:46:59,935 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:46:59,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:59,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:59,936 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:59,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 12:46:59,978 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:46:59,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:59,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 12:46:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:59,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:00,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {5604#true} call ULTIMATE.init(); {5604#true} is VALID [2022-04-15 12:47:00,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {5604#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5604#true} is VALID [2022-04-15 12:47:00,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {5604#true} assume true; {5604#true} is VALID [2022-04-15 12:47:00,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5604#true} {5604#true} #40#return; {5604#true} is VALID [2022-04-15 12:47:00,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {5604#true} call #t~ret5 := main(); {5604#true} is VALID [2022-04-15 12:47:00,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {5604#true} ~x~0 := 0; {5609#(= main_~x~0 0)} is VALID [2022-04-15 12:47:00,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {5609#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {5609#(= main_~x~0 0)} is VALID [2022-04-15 12:47:00,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {5609#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5610#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:00,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {5610#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {5610#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:00,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {5610#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:00,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {5611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {5611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:00,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {5611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:00,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {5612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:00,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {5612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:00,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {5613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:00,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {5613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:00,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {5614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {5614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:00,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {5614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5615#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:00,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {5615#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {5615#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:00,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {5615#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:00,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {5616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:00,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {5616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5617#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:00,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {5617#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5617#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:00,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {5617#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5618#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:00,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {5618#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5618#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:00,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {5618#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5619#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:00,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {5619#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5619#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:00,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {5619#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5620#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:00,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {5620#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5620#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:00,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {5620#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5621#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:00,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {5621#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5621#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:00,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {5621#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5622#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:00,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {5622#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5622#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:00,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {5622#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5727#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:00,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {5727#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {5727#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:00,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {5727#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {5734#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:00,406 INFO L290 TraceCheckUtils]: 36: Hoare triple {5734#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {5605#false} is VALID [2022-04-15 12:47:00,406 INFO L272 TraceCheckUtils]: 37: Hoare triple {5605#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {5605#false} is VALID [2022-04-15 12:47:00,407 INFO L290 TraceCheckUtils]: 38: Hoare triple {5605#false} ~cond := #in~cond; {5605#false} is VALID [2022-04-15 12:47:00,407 INFO L290 TraceCheckUtils]: 39: Hoare triple {5605#false} assume 0 == ~cond; {5605#false} is VALID [2022-04-15 12:47:00,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {5605#false} assume !false; {5605#false} is VALID [2022-04-15 12:47:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:00,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:01,113 INFO L290 TraceCheckUtils]: 40: Hoare triple {5605#false} assume !false; {5605#false} is VALID [2022-04-15 12:47:01,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {5605#false} assume 0 == ~cond; {5605#false} is VALID [2022-04-15 12:47:01,113 INFO L290 TraceCheckUtils]: 38: Hoare triple {5605#false} ~cond := #in~cond; {5605#false} is VALID [2022-04-15 12:47:01,113 INFO L272 TraceCheckUtils]: 37: Hoare triple {5605#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {5605#false} is VALID [2022-04-15 12:47:01,114 INFO L290 TraceCheckUtils]: 36: Hoare triple {5762#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {5605#false} is VALID [2022-04-15 12:47:01,115 INFO L290 TraceCheckUtils]: 35: Hoare triple {5766#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {5762#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,115 INFO L290 TraceCheckUtils]: 34: Hoare triple {5766#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5766#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {5773#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5766#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {5773#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5773#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {5780#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5773#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {5780#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5780#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {5787#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5780#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {5787#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5787#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {5794#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5787#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {5794#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5794#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {5801#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5794#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {5801#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5801#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {5808#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5801#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {5808#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5808#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {5815#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5808#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {5815#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5815#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {5822#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5815#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {5822#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5822#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {5829#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5822#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {5829#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5829#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {5836#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5829#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {5836#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5836#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {5843#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5836#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {5843#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5843#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {5850#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5843#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {5850#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5850#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {5857#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5850#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {5857#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5857#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {5864#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5857#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {5864#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5864#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {5604#true} ~x~0 := 0; {5864#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:47:01,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {5604#true} call #t~ret5 := main(); {5604#true} is VALID [2022-04-15 12:47:01,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5604#true} {5604#true} #40#return; {5604#true} is VALID [2022-04-15 12:47:01,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {5604#true} assume true; {5604#true} is VALID [2022-04-15 12:47:01,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {5604#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5604#true} is VALID [2022-04-15 12:47:01,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {5604#true} call ULTIMATE.init(); {5604#true} is VALID [2022-04-15 12:47:01,133 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:01,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005800821] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:01,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:01,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2022-04-15 12:47:01,134 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:01,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1358892346] [2022-04-15 12:47:01,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1358892346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:01,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:01,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:47:01,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844230026] [2022-04-15 12:47:01,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:01,134 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 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 41 [2022-04-15 12:47:01,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:01,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 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-15 12:47:01,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:01,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:47:01,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:01,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:47:01,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=904, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:47:01,174 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 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-15 12:47:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:02,324 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-15 12:47:02,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:47:02,324 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 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 41 [2022-04-15 12:47:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 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-15 12:47:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2022-04-15 12:47:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 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-15 12:47:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2022-04-15 12:47:02,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 53 transitions. [2022-04-15 12:47:02,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:02,386 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:47:02,386 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 12:47:02,387 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=684, Invalid=1866, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:47:02,387 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:02,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 54 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:47:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 12:47:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 12:47:02,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:02,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 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-15 12:47:02,470 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 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-15 12:47:02,471 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 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-15 12:47:02,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:02,471 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-15 12:47:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 12:47:02,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:02,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:02,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 12:47:02,472 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 12:47:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:02,473 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-15 12:47:02,473 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 12:47:02,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:02,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:02,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:02,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 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-15 12:47:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-15 12:47:02,474 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 41 [2022-04-15 12:47:02,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:02,475 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-15 12:47:02,475 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 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-15 12:47:02,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 47 transitions. [2022-04-15 12:47:02,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 12:47:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 12:47:02,564 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:02,564 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:02,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 12:47:02,765 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:02,765 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:02,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:02,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1310743632, now seen corresponding path program 29 times [2022-04-15 12:47:02,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:02,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1991797510] [2022-04-15 12:47:02,922 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash -416595343, now seen corresponding path program 1 times [2022-04-15 12:47:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:02,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242717061] [2022-04-15 12:47:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:02,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:02,931 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:02,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:02,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1310743632, now seen corresponding path program 30 times [2022-04-15 12:47:02,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:02,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631002755] [2022-04-15 12:47:02,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:02,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:03,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:03,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {6223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6202#true} is VALID [2022-04-15 12:47:03,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {6202#true} assume true; {6202#true} is VALID [2022-04-15 12:47:03,223 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6202#true} {6202#true} #40#return; {6202#true} is VALID [2022-04-15 12:47:03,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {6202#true} call ULTIMATE.init(); {6223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:03,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {6223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6202#true} is VALID [2022-04-15 12:47:03,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {6202#true} assume true; {6202#true} is VALID [2022-04-15 12:47:03,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6202#true} {6202#true} #40#return; {6202#true} is VALID [2022-04-15 12:47:03,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {6202#true} call #t~ret5 := main(); {6202#true} is VALID [2022-04-15 12:47:03,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {6202#true} ~x~0 := 0; {6207#(= main_~x~0 0)} is VALID [2022-04-15 12:47:03,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {6207#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {6207#(= main_~x~0 0)} is VALID [2022-04-15 12:47:03,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {6207#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:03,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {6208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {6208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:03,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {6208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:03,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {6209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {6209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:03,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {6209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:03,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {6210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:03,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {6210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:03,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {6211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:03,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {6211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:03,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {6212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {6212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:03,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {6212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:03,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {6213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {6213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:03,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {6213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6214#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:03,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {6214#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6214#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:03,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {6214#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6215#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:03,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {6215#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6215#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:03,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {6215#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6216#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:03,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {6216#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6216#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:03,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {6216#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6217#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:03,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {6217#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6217#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:03,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {6217#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6218#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:03,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {6218#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6218#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:03,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {6218#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6219#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:03,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {6219#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6219#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:03,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {6219#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6220#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:03,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {6220#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6220#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:03,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {6220#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6221#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:03,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {6221#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {6221#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:03,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {6221#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6222#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:03,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {6222#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {6222#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:03,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {6222#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {6203#false} is VALID [2022-04-15 12:47:03,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {6203#false} assume !(~x~0 % 4294967296 < 100000000); {6203#false} is VALID [2022-04-15 12:47:03,244 INFO L272 TraceCheckUtils]: 39: Hoare triple {6203#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {6203#false} is VALID [2022-04-15 12:47:03,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {6203#false} ~cond := #in~cond; {6203#false} is VALID [2022-04-15 12:47:03,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {6203#false} assume 0 == ~cond; {6203#false} is VALID [2022-04-15 12:47:03,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {6203#false} assume !false; {6203#false} is VALID [2022-04-15 12:47:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:03,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:03,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631002755] [2022-04-15 12:47:03,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631002755] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:03,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127280103] [2022-04-15 12:47:03,246 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:47:03,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:03,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:03,247 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:03,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 12:47:03,284 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:47:03,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:03,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 12:47:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:03,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:03,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {6202#true} call ULTIMATE.init(); {6202#true} is VALID [2022-04-15 12:47:03,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {6202#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6202#true} is VALID [2022-04-15 12:47:03,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {6202#true} assume true; {6202#true} is VALID [2022-04-15 12:47:03,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6202#true} {6202#true} #40#return; {6202#true} is VALID [2022-04-15 12:47:03,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {6202#true} call #t~ret5 := main(); {6202#true} is VALID [2022-04-15 12:47:03,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {6202#true} ~x~0 := 0; {6202#true} is VALID [2022-04-15 12:47:03,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:03,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:03,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:03,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:03,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:03,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:03,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:03,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:03,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:03,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:03,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:03,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:03,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:03,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:03,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:03,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:03,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:03,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:03,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:03,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:03,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:03,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:03,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:03,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:03,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:03,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:03,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:03,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:03,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:03,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6332#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:47:03,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {6332#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {6332#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:47:03,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {6332#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {6339#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-15 12:47:03,449 INFO L290 TraceCheckUtils]: 38: Hoare triple {6339#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 100000000); {6203#false} is VALID [2022-04-15 12:47:03,449 INFO L272 TraceCheckUtils]: 39: Hoare triple {6203#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {6203#false} is VALID [2022-04-15 12:47:03,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {6203#false} ~cond := #in~cond; {6203#false} is VALID [2022-04-15 12:47:03,449 INFO L290 TraceCheckUtils]: 41: Hoare triple {6203#false} assume 0 == ~cond; {6203#false} is VALID [2022-04-15 12:47:03,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {6203#false} assume !false; {6203#false} is VALID [2022-04-15 12:47:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 45 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-15 12:47:03,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:04,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {6203#false} assume !false; {6203#false} is VALID [2022-04-15 12:47:04,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {6358#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6203#false} is VALID [2022-04-15 12:47:04,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {6362#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6358#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:47:04,039 INFO L272 TraceCheckUtils]: 39: Hoare triple {6366#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {6362#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:47:04,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {6370#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {6366#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:47:04,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {6374#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {6370#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:47:04,041 INFO L290 TraceCheckUtils]: 36: Hoare triple {6374#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {6374#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6374#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,043 INFO L290 TraceCheckUtils]: 34: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:04,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:04,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:04,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:04,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:04,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:04,043 INFO L290 TraceCheckUtils]: 28: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:04,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:04,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:04,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:04,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:04,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:04,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:04,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:04,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:04,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:04,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:04,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:04,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:04,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:04,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:04,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:04,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:04,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:04,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:04,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:04,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:04,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {6202#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6202#true} is VALID [2022-04-15 12:47:04,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {6202#true} assume !!(~x~0 % 4294967296 < 100000000); {6202#true} is VALID [2022-04-15 12:47:04,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {6202#true} ~x~0 := 0; {6202#true} is VALID [2022-04-15 12:47:04,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {6202#true} call #t~ret5 := main(); {6202#true} is VALID [2022-04-15 12:47:04,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6202#true} {6202#true} #40#return; {6202#true} is VALID [2022-04-15 12:47:04,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {6202#true} assume true; {6202#true} is VALID [2022-04-15 12:47:04,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {6202#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6202#true} is VALID [2022-04-15 12:47:04,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {6202#true} call ULTIMATE.init(); {6202#true} is VALID [2022-04-15 12:47:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 45 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-15 12:47:04,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127280103] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:04,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:04,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 4, 7] total 26 [2022-04-15 12:47:04,047 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:04,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1991797510] [2022-04-15 12:47:04,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1991797510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:04,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:04,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:47:04,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193373973] [2022-04-15 12:47:04,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:04,048 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 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 43 [2022-04-15 12:47:04,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:04,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 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-15 12:47:04,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:04,096 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:47:04,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:04,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:47:04,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:47:04,097 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 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-15 12:47:05,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:05,529 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-15 12:47:05,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:47:05,529 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 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 43 [2022-04-15 12:47:05,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 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-15 12:47:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2022-04-15 12:47:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 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-15 12:47:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2022-04-15 12:47:05,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 55 transitions. [2022-04-15 12:47:05,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:05,590 INFO L225 Difference]: With dead ends: 54 [2022-04-15 12:47:05,590 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 12:47:05,591 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=279, Invalid=1443, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:47:05,591 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:05,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 54 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:47:05,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 12:47:05,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 12:47:05,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:05,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 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-15 12:47:05,679 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 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-15 12:47:05,679 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 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-15 12:47:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:05,680 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 12:47:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 12:47:05,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:05,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:05,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 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 47 states. [2022-04-15 12:47:05,680 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 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 47 states. [2022-04-15 12:47:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:05,681 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 12:47:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 12:47:05,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:05,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:05,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:05,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 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-15 12:47:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-15 12:47:05,683 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 43 [2022-04-15 12:47:05,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:05,683 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-15 12:47:05,683 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 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-15 12:47:05,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2022-04-15 12:47:05,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 12:47:05,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 12:47:05,775 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:05,775 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:05,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 12:47:05,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:05,976 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:05,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:05,976 INFO L85 PathProgramCache]: Analyzing trace with hash 742724429, now seen corresponding path program 31 times [2022-04-15 12:47:05,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:05,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1302764449] [2022-04-15 12:47:06,145 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:06,147 INFO L85 PathProgramCache]: Analyzing trace with hash -357489999, now seen corresponding path program 1 times [2022-04-15 12:47:06,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:06,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818485149] [2022-04-15 12:47:06,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:06,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:06,154 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:06,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:06,160 INFO L85 PathProgramCache]: Analyzing trace with hash 742724429, now seen corresponding path program 32 times [2022-04-15 12:47:06,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:06,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912677072] [2022-04-15 12:47:06,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:06,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:06,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:06,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {6838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6816#true} is VALID [2022-04-15 12:47:06,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {6816#true} assume true; {6816#true} is VALID [2022-04-15 12:47:06,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6816#true} {6816#true} #40#return; {6816#true} is VALID [2022-04-15 12:47:06,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {6816#true} call ULTIMATE.init(); {6838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:06,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {6838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6816#true} is VALID [2022-04-15 12:47:06,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {6816#true} assume true; {6816#true} is VALID [2022-04-15 12:47:06,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6816#true} {6816#true} #40#return; {6816#true} is VALID [2022-04-15 12:47:06,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {6816#true} call #t~ret5 := main(); {6816#true} is VALID [2022-04-15 12:47:06,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {6816#true} ~x~0 := 0; {6821#(= main_~x~0 0)} is VALID [2022-04-15 12:47:06,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {6821#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {6821#(= main_~x~0 0)} is VALID [2022-04-15 12:47:06,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {6821#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:06,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {6822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {6822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:06,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {6822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:06,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {6823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {6823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:06,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {6823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:06,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {6824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:06,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {6824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:06,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {6825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:06,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {6825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:06,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {6826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {6826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:06,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {6826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:06,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {6827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {6827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:06,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {6827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6828#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:06,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {6828#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6828#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:06,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {6828#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6829#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:06,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {6829#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6829#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:06,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {6829#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6830#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:06,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {6830#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6830#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:06,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {6830#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6831#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:06,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {6831#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6831#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:06,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {6831#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6832#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:06,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {6832#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6832#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:06,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {6832#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6833#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:06,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {6833#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6833#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:06,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {6833#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6834#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:06,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {6834#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6834#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:06,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {6834#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6835#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:06,552 INFO L290 TraceCheckUtils]: 34: Hoare triple {6835#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {6835#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:06,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {6835#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6836#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:06,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {6836#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {6836#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:06,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {6836#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6837#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:06,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {6837#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {6837#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:06,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {6837#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {6817#false} is VALID [2022-04-15 12:47:06,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {6817#false} assume !(~x~0 % 4294967296 < 100000000); {6817#false} is VALID [2022-04-15 12:47:06,556 INFO L272 TraceCheckUtils]: 41: Hoare triple {6817#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {6817#false} is VALID [2022-04-15 12:47:06,556 INFO L290 TraceCheckUtils]: 42: Hoare triple {6817#false} ~cond := #in~cond; {6817#false} is VALID [2022-04-15 12:47:06,556 INFO L290 TraceCheckUtils]: 43: Hoare triple {6817#false} assume 0 == ~cond; {6817#false} is VALID [2022-04-15 12:47:06,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {6817#false} assume !false; {6817#false} is VALID [2022-04-15 12:47:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:06,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:06,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912677072] [2022-04-15 12:47:06,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912677072] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:06,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592201025] [2022-04-15 12:47:06,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:47:06,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:06,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:06,559 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:06,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 12:47:06,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:47:06,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:06,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 12:47:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:06,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:07,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {6816#true} call ULTIMATE.init(); {6816#true} is VALID [2022-04-15 12:47:07,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {6816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6816#true} is VALID [2022-04-15 12:47:07,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {6816#true} assume true; {6816#true} is VALID [2022-04-15 12:47:07,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6816#true} {6816#true} #40#return; {6816#true} is VALID [2022-04-15 12:47:07,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {6816#true} call #t~ret5 := main(); {6816#true} is VALID [2022-04-15 12:47:07,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {6816#true} ~x~0 := 0; {6821#(= main_~x~0 0)} is VALID [2022-04-15 12:47:07,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {6821#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {6821#(= main_~x~0 0)} is VALID [2022-04-15 12:47:07,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {6821#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:07,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {6822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {6822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:07,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {6822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:07,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {6823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {6823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:07,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {6823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:07,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {6824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:07,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {6824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:07,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {6825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:07,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {6825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:07,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {6826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {6826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:07,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {6826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:07,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {6827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {6827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:07,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {6827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6828#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:07,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {6828#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6828#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:07,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {6828#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6829#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:07,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {6829#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6829#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:07,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {6829#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6830#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:07,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {6830#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6830#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:07,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {6830#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6831#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:07,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {6831#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6831#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:07,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {6831#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6832#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:07,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {6832#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6832#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:07,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {6832#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6833#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:07,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {6833#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6833#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:07,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {6833#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6834#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:07,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {6834#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6834#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:07,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {6834#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6835#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:07,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {6835#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {6835#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:07,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {6835#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6836#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:07,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {6836#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {6836#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:07,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {6836#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6953#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:07,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {6953#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6953#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:07,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {6953#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {6817#false} is VALID [2022-04-15 12:47:07,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {6817#false} assume !(~x~0 % 4294967296 < 100000000); {6817#false} is VALID [2022-04-15 12:47:07,053 INFO L272 TraceCheckUtils]: 41: Hoare triple {6817#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {6817#false} is VALID [2022-04-15 12:47:07,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {6817#false} ~cond := #in~cond; {6817#false} is VALID [2022-04-15 12:47:07,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {6817#false} assume 0 == ~cond; {6817#false} is VALID [2022-04-15 12:47:07,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {6817#false} assume !false; {6817#false} is VALID [2022-04-15 12:47:07,053 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:07,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:08,249 INFO L290 TraceCheckUtils]: 44: Hoare triple {6817#false} assume !false; {6817#false} is VALID [2022-04-15 12:47:08,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {6817#false} assume 0 == ~cond; {6817#false} is VALID [2022-04-15 12:47:08,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {6817#false} ~cond := #in~cond; {6817#false} is VALID [2022-04-15 12:47:08,249 INFO L272 TraceCheckUtils]: 41: Hoare triple {6817#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {6817#false} is VALID [2022-04-15 12:47:08,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {6817#false} assume !(~x~0 % 4294967296 < 100000000); {6817#false} is VALID [2022-04-15 12:47:08,249 INFO L290 TraceCheckUtils]: 39: Hoare triple {6990#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {6817#false} is VALID [2022-04-15 12:47:08,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {6994#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {6990#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:47:08,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {6998#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6994#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {6998#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {6998#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {7005#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6998#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {7005#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7005#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {7012#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7005#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {7012#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7012#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:47:08,258 INFO L290 TraceCheckUtils]: 31: Hoare triple {7019#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7012#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:47:08,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {7019#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7019#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {7026#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7019#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {7026#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7026#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:08,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {7033#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7026#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:08,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {7033#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7033#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:47:08,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {7040#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7033#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:47:08,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {7040#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7040#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:08,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {7047#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7040#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:08,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {7047#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7047#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:47:08,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {7054#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7047#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:47:08,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {7054#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7054#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {7061#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7054#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {7061#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7061#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {7068#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7061#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {7068#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7068#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:47:08,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {7075#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7068#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:47:08,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {7075#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7075#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:47:08,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {7082#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7075#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:47:08,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {7082#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7082#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {7089#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7082#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {7089#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7089#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {7096#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7089#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {7096#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7096#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {7103#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7096#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {7103#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7103#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {6816#true} ~x~0 := 0; {7103#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:08,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {6816#true} call #t~ret5 := main(); {6816#true} is VALID [2022-04-15 12:47:08,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6816#true} {6816#true} #40#return; {6816#true} is VALID [2022-04-15 12:47:08,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {6816#true} assume true; {6816#true} is VALID [2022-04-15 12:47:08,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {6816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6816#true} is VALID [2022-04-15 12:47:08,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {6816#true} call ULTIMATE.init(); {6816#true} is VALID [2022-04-15 12:47:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:08,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592201025] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:08,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:08,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 39 [2022-04-15 12:47:08,281 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:08,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1302764449] [2022-04-15 12:47:08,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1302764449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:08,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:08,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:47:08,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317624349] [2022-04-15 12:47:08,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:08,282 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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 45 [2022-04-15 12:47:08,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:08,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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-15 12:47:08,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:08,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:47:08,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:08,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:47:08,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=417, Invalid=1065, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:47:08,343 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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-15 12:47:10,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:10,004 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-04-15 12:47:10,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:47:10,005 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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 45 [2022-04-15 12:47:10,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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-15 12:47:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2022-04-15 12:47:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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-15 12:47:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2022-04-15 12:47:10,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 57 transitions. [2022-04-15 12:47:10,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:10,083 INFO L225 Difference]: With dead ends: 56 [2022-04-15 12:47:10,083 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 12:47:10,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=823, Invalid=2257, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 12:47:10,084 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:10,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 99 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:47:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 12:47:10,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-15 12:47:10,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:10,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 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-15 12:47:10,183 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 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-15 12:47:10,183 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 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-15 12:47:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:10,184 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-04-15 12:47:10,184 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-04-15 12:47:10,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:10,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:10,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 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 49 states. [2022-04-15 12:47:10,185 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 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 49 states. [2022-04-15 12:47:10,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:10,191 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-04-15 12:47:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-04-15 12:47:10,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:10,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:10,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:10,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 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-15 12:47:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2022-04-15 12:47:10,192 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 45 [2022-04-15 12:47:10,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:10,192 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2022-04-15 12:47:10,192 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 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-15 12:47:10,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 51 transitions. [2022-04-15 12:47:10,321 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-15 12:47:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-04-15 12:47:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 12:47:10,322 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:10,322 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:10,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 12:47:10,522 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34 [2022-04-15 12:47:10,523 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:10,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:10,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1559425110, now seen corresponding path program 33 times [2022-04-15 12:47:10,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:10,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1769980052] [2022-04-15 12:47:10,683 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:10,685 INFO L85 PathProgramCache]: Analyzing trace with hash -298384655, now seen corresponding path program 1 times [2022-04-15 12:47:10,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:10,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368388849] [2022-04-15 12:47:10,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:10,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:10,699 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:10,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:10,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1559425110, now seen corresponding path program 34 times [2022-04-15 12:47:10,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:10,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825153353] [2022-04-15 12:47:10,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:10,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:11,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:11,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {7492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7469#true} is VALID [2022-04-15 12:47:11,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {7469#true} assume true; {7469#true} is VALID [2022-04-15 12:47:11,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7469#true} {7469#true} #40#return; {7469#true} is VALID [2022-04-15 12:47:11,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {7469#true} call ULTIMATE.init(); {7492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:11,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {7492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7469#true} is VALID [2022-04-15 12:47:11,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {7469#true} assume true; {7469#true} is VALID [2022-04-15 12:47:11,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7469#true} {7469#true} #40#return; {7469#true} is VALID [2022-04-15 12:47:11,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {7469#true} call #t~ret5 := main(); {7469#true} is VALID [2022-04-15 12:47:11,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {7469#true} ~x~0 := 0; {7474#(= main_~x~0 0)} is VALID [2022-04-15 12:47:11,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {7474#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {7474#(= main_~x~0 0)} is VALID [2022-04-15 12:47:11,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {7474#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7475#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:11,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {7475#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {7475#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:11,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {7475#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7476#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:11,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {7476#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {7476#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:11,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {7476#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7477#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:11,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {7477#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7477#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:11,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {7477#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7478#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:11,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {7478#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7478#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:11,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {7478#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7479#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:11,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {7479#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {7479#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:11,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {7479#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7480#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:11,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {7480#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {7480#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:11,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {7480#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7481#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:11,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {7481#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7481#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:11,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {7481#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7482#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:11,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {7482#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7482#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:11,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {7482#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7483#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:11,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {7483#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7483#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:11,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {7483#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7484#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:11,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {7484#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7484#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:11,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {7484#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7485#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:11,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {7485#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7485#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:11,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {7485#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7486#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:11,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {7486#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7486#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:11,061 INFO L290 TraceCheckUtils]: 31: Hoare triple {7486#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7487#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:11,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {7487#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7487#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:11,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {7487#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7488#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:11,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {7488#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {7488#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:11,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {7488#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7489#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:11,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {7489#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {7489#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:11,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {7489#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7490#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:11,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {7490#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7490#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:11,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {7490#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7491#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:11,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {7491#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {7491#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:11,069 INFO L290 TraceCheckUtils]: 41: Hoare triple {7491#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {7470#false} is VALID [2022-04-15 12:47:11,069 INFO L290 TraceCheckUtils]: 42: Hoare triple {7470#false} assume !(~x~0 % 4294967296 < 100000000); {7470#false} is VALID [2022-04-15 12:47:11,069 INFO L272 TraceCheckUtils]: 43: Hoare triple {7470#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {7470#false} is VALID [2022-04-15 12:47:11,069 INFO L290 TraceCheckUtils]: 44: Hoare triple {7470#false} ~cond := #in~cond; {7470#false} is VALID [2022-04-15 12:47:11,069 INFO L290 TraceCheckUtils]: 45: Hoare triple {7470#false} assume 0 == ~cond; {7470#false} is VALID [2022-04-15 12:47:11,069 INFO L290 TraceCheckUtils]: 46: Hoare triple {7470#false} assume !false; {7470#false} is VALID [2022-04-15 12:47:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 18 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:11,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:11,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825153353] [2022-04-15 12:47:11,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825153353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:11,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028714948] [2022-04-15 12:47:11,070 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:47:11,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:11,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:11,071 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:11,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 12:47:11,124 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:47:11,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:11,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 12:47:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:11,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:11,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {7469#true} call ULTIMATE.init(); {7469#true} is VALID [2022-04-15 12:47:11,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {7469#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7469#true} is VALID [2022-04-15 12:47:11,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {7469#true} assume true; {7469#true} is VALID [2022-04-15 12:47:11,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7469#true} {7469#true} #40#return; {7469#true} is VALID [2022-04-15 12:47:11,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {7469#true} call #t~ret5 := main(); {7469#true} is VALID [2022-04-15 12:47:11,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {7469#true} ~x~0 := 0; {7474#(= main_~x~0 0)} is VALID [2022-04-15 12:47:11,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {7474#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {7474#(= main_~x~0 0)} is VALID [2022-04-15 12:47:11,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {7474#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7475#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:11,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {7475#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {7475#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:11,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {7475#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7476#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:11,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {7476#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {7476#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:11,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {7476#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7477#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:11,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {7477#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7477#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:11,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {7477#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7478#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:11,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {7478#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7478#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:11,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {7478#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7479#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:11,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {7479#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {7479#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:11,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {7479#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7480#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:11,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {7480#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {7480#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:11,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {7480#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7481#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:11,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {7481#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7481#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:11,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {7481#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7482#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:11,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {7482#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7482#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:11,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {7482#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7483#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:11,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {7483#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7483#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:11,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {7483#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7484#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:11,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {7484#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7484#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:11,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {7484#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7485#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:11,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {7485#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7485#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:11,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {7485#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7486#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:11,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {7486#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7486#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:11,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {7486#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7487#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:11,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {7487#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7487#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:11,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {7487#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7488#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:11,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {7488#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {7488#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:11,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {7488#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7489#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:11,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {7489#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {7489#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:11,556 INFO L290 TraceCheckUtils]: 37: Hoare triple {7489#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7490#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:11,556 INFO L290 TraceCheckUtils]: 38: Hoare triple {7490#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7490#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:11,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {7490#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7613#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:11,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {7613#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {7613#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:11,558 INFO L290 TraceCheckUtils]: 41: Hoare triple {7613#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {7470#false} is VALID [2022-04-15 12:47:11,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {7470#false} assume !(~x~0 % 4294967296 < 100000000); {7470#false} is VALID [2022-04-15 12:47:11,559 INFO L272 TraceCheckUtils]: 43: Hoare triple {7470#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {7470#false} is VALID [2022-04-15 12:47:11,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {7470#false} ~cond := #in~cond; {7470#false} is VALID [2022-04-15 12:47:11,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {7470#false} assume 0 == ~cond; {7470#false} is VALID [2022-04-15 12:47:11,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {7470#false} assume !false; {7470#false} is VALID [2022-04-15 12:47:11,559 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 18 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:11,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:12,956 INFO L290 TraceCheckUtils]: 46: Hoare triple {7470#false} assume !false; {7470#false} is VALID [2022-04-15 12:47:12,956 INFO L290 TraceCheckUtils]: 45: Hoare triple {7470#false} assume 0 == ~cond; {7470#false} is VALID [2022-04-15 12:47:12,956 INFO L290 TraceCheckUtils]: 44: Hoare triple {7470#false} ~cond := #in~cond; {7470#false} is VALID [2022-04-15 12:47:12,957 INFO L272 TraceCheckUtils]: 43: Hoare triple {7470#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {7470#false} is VALID [2022-04-15 12:47:12,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {7470#false} assume !(~x~0 % 4294967296 < 100000000); {7470#false} is VALID [2022-04-15 12:47:12,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {7650#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {7470#false} is VALID [2022-04-15 12:47:12,957 INFO L290 TraceCheckUtils]: 40: Hoare triple {7654#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7650#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:47:12,959 INFO L290 TraceCheckUtils]: 39: Hoare triple {7658#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7654#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {7658#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7658#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {7665#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7658#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {7665#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7665#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,963 INFO L290 TraceCheckUtils]: 35: Hoare triple {7672#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7665#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,963 INFO L290 TraceCheckUtils]: 34: Hoare triple {7672#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7672#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:47:12,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {7679#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7672#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:47:12,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {7679#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7679#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {7686#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7679#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {7686#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7686#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:12,968 INFO L290 TraceCheckUtils]: 29: Hoare triple {7693#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7686#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:12,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {7693#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7693#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:47:12,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {7700#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7693#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:47:12,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {7700#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7700#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:12,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {7707#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7700#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:12,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {7707#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7707#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:47:12,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {7714#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7707#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:47:12,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {7714#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7714#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {7721#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7714#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {7721#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7721#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {7728#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7721#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {7728#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7728#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:47:12,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {7735#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7728#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:47:12,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {7735#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7735#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:47:12,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {7742#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7735#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:47:12,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {7742#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7742#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {7749#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7742#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {7749#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7749#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {7756#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7749#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {7756#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7756#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {7763#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7756#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {7763#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7763#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {7770#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7763#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {7770#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7770#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {7469#true} ~x~0 := 0; {7770#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:12,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {7469#true} call #t~ret5 := main(); {7469#true} is VALID [2022-04-15 12:47:12,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7469#true} {7469#true} #40#return; {7469#true} is VALID [2022-04-15 12:47:12,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {7469#true} assume true; {7469#true} is VALID [2022-04-15 12:47:12,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {7469#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7469#true} is VALID [2022-04-15 12:47:12,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {7469#true} call ULTIMATE.init(); {7469#true} is VALID [2022-04-15 12:47:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 18 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:12,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028714948] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:12,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:12,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 41 [2022-04-15 12:47:12,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:12,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1769980052] [2022-04-15 12:47:12,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1769980052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:12,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:12,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:47:12,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168003295] [2022-04-15 12:47:12,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:12,988 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 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 47 [2022-04-15 12:47:12,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:12,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 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-15 12:47:13,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:13,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:47:13,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:13,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:47:13,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=1181, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:47:13,045 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 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-15 12:47:14,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:14,859 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-15 12:47:14,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:47:14,860 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 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 47 [2022-04-15 12:47:14,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 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-15 12:47:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2022-04-15 12:47:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 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-15 12:47:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2022-04-15 12:47:14,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 59 transitions. [2022-04-15 12:47:14,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:14,938 INFO L225 Difference]: With dead ends: 58 [2022-04-15 12:47:14,938 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 12:47:14,939 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=907, Invalid=2515, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 12:47:14,939 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:14,940 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 44 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:47:14,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 12:47:15,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 12:47:15,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:15,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 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-15 12:47:15,059 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 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-15 12:47:15,060 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 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-15 12:47:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:15,061 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-04-15 12:47:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-04-15 12:47:15,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:15,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:15,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 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 51 states. [2022-04-15 12:47:15,061 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 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 51 states. [2022-04-15 12:47:15,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:15,062 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-04-15 12:47:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-04-15 12:47:15,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:15,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:15,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:15,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:15,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 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-15 12:47:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-04-15 12:47:15,064 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 47 [2022-04-15 12:47:15,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:15,064 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-04-15 12:47:15,064 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 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-15 12:47:15,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 53 transitions. [2022-04-15 12:47:15,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:15,190 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-04-15 12:47:15,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 12:47:15,190 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:15,190 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:15,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 12:47:15,390 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-15 12:47:15,391 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:15,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:15,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2016974649, now seen corresponding path program 35 times [2022-04-15 12:47:15,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:15,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [85083237] [2022-04-15 12:47:15,580 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:15,582 INFO L85 PathProgramCache]: Analyzing trace with hash -239279311, now seen corresponding path program 1 times [2022-04-15 12:47:15,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:15,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977245670] [2022-04-15 12:47:15,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:15,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:15,589 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:15,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:15,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2016974649, now seen corresponding path program 36 times [2022-04-15 12:47:15,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:15,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009370371] [2022-04-15 12:47:15,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:15,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:15,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:15,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {8174#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8150#true} is VALID [2022-04-15 12:47:15,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {8150#true} assume true; {8150#true} is VALID [2022-04-15 12:47:15,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8150#true} {8150#true} #40#return; {8150#true} is VALID [2022-04-15 12:47:15,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {8150#true} call ULTIMATE.init(); {8174#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:15,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {8174#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8150#true} is VALID [2022-04-15 12:47:15,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {8150#true} assume true; {8150#true} is VALID [2022-04-15 12:47:15,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8150#true} {8150#true} #40#return; {8150#true} is VALID [2022-04-15 12:47:15,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {8150#true} call #t~ret5 := main(); {8150#true} is VALID [2022-04-15 12:47:15,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {8150#true} ~x~0 := 0; {8155#(= main_~x~0 0)} is VALID [2022-04-15 12:47:15,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {8155#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {8155#(= main_~x~0 0)} is VALID [2022-04-15 12:47:15,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {8155#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8156#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:15,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {8156#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {8156#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:15,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {8156#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8157#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:15,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {8157#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {8157#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:15,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {8157#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8158#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:15,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {8158#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8158#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:15,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {8158#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8159#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:15,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {8159#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8159#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:15,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {8159#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8160#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:15,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {8160#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {8160#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:15,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {8160#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8161#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:15,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {8161#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {8161#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:15,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {8161#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8162#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:15,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {8162#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8162#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:15,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {8162#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8163#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:15,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {8163#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8163#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:15,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {8163#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8164#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:15,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {8164#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8164#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:15,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {8164#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8165#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:15,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {8165#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8165#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:15,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {8165#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8166#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:15,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {8166#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8166#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:15,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {8166#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8167#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:15,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {8167#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8167#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:15,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {8167#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8168#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:15,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {8168#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8168#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:15,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {8168#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8169#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:15,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {8169#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {8169#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:15,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {8169#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8170#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:15,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {8170#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {8170#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:15,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {8170#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8171#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:15,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {8171#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8171#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:15,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {8171#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8172#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:15,979 INFO L290 TraceCheckUtils]: 40: Hoare triple {8172#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {8172#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:15,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {8172#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8173#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:15,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {8173#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {8173#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:15,981 INFO L290 TraceCheckUtils]: 43: Hoare triple {8173#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {8151#false} is VALID [2022-04-15 12:47:15,981 INFO L290 TraceCheckUtils]: 44: Hoare triple {8151#false} assume !(~x~0 % 4294967296 < 100000000); {8151#false} is VALID [2022-04-15 12:47:15,981 INFO L272 TraceCheckUtils]: 45: Hoare triple {8151#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {8151#false} is VALID [2022-04-15 12:47:15,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {8151#false} ~cond := #in~cond; {8151#false} is VALID [2022-04-15 12:47:15,981 INFO L290 TraceCheckUtils]: 47: Hoare triple {8151#false} assume 0 == ~cond; {8151#false} is VALID [2022-04-15 12:47:15,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {8151#false} assume !false; {8151#false} is VALID [2022-04-15 12:47:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 19 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:15,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:15,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009370371] [2022-04-15 12:47:15,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009370371] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:15,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086914066] [2022-04-15 12:47:15,982 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:47:15,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:15,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:15,983 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:15,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 12:47:16,036 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:47:16,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:16,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 12:47:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:16,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:16,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {8150#true} call ULTIMATE.init(); {8150#true} is VALID [2022-04-15 12:47:16,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {8150#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8150#true} is VALID [2022-04-15 12:47:16,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {8150#true} assume true; {8150#true} is VALID [2022-04-15 12:47:16,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8150#true} {8150#true} #40#return; {8150#true} is VALID [2022-04-15 12:47:16,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {8150#true} call #t~ret5 := main(); {8150#true} is VALID [2022-04-15 12:47:16,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {8150#true} ~x~0 := 0; {8150#true} is VALID [2022-04-15 12:47:16,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8301#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:47:16,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {8301#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {8301#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:47:16,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {8301#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {8308#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-15 12:47:16,214 INFO L290 TraceCheckUtils]: 44: Hoare triple {8308#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 100000000); {8151#false} is VALID [2022-04-15 12:47:16,214 INFO L272 TraceCheckUtils]: 45: Hoare triple {8151#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {8151#false} is VALID [2022-04-15 12:47:16,214 INFO L290 TraceCheckUtils]: 46: Hoare triple {8151#false} ~cond := #in~cond; {8151#false} is VALID [2022-04-15 12:47:16,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {8151#false} assume 0 == ~cond; {8151#false} is VALID [2022-04-15 12:47:16,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {8151#false} assume !false; {8151#false} is VALID [2022-04-15 12:47:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2022-04-15 12:47:16,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:16,821 INFO L290 TraceCheckUtils]: 48: Hoare triple {8151#false} assume !false; {8151#false} is VALID [2022-04-15 12:47:16,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {8327#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8151#false} is VALID [2022-04-15 12:47:16,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {8331#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8327#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:47:16,822 INFO L272 TraceCheckUtils]: 45: Hoare triple {8335#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {8331#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:47:16,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {8339#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {8335#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:47:16,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {8343#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {8339#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:47:16,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {8343#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {8343#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:47:16,827 INFO L290 TraceCheckUtils]: 41: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8343#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:47:16,827 INFO L290 TraceCheckUtils]: 40: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,827 INFO L290 TraceCheckUtils]: 34: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {8150#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8150#true} is VALID [2022-04-15 12:47:16,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {8150#true} assume !!(~x~0 % 4294967296 < 100000000); {8150#true} is VALID [2022-04-15 12:47:16,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {8150#true} ~x~0 := 0; {8150#true} is VALID [2022-04-15 12:47:16,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {8150#true} call #t~ret5 := main(); {8150#true} is VALID [2022-04-15 12:47:16,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8150#true} {8150#true} #40#return; {8150#true} is VALID [2022-04-15 12:47:16,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {8150#true} assume true; {8150#true} is VALID [2022-04-15 12:47:16,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {8150#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8150#true} is VALID [2022-04-15 12:47:16,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {8150#true} call ULTIMATE.init(); {8150#true} is VALID [2022-04-15 12:47:16,830 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2022-04-15 12:47:16,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086914066] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:16,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:16,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 4, 7] total 29 [2022-04-15 12:47:16,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:16,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [85083237] [2022-04-15 12:47:16,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [85083237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:16,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:16,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:47:16,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612546924] [2022-04-15 12:47:16,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:16,831 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 49 [2022-04-15 12:47:16,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:16,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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-15 12:47:16,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:16,892 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:47:16,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:16,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:47:16,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:47:16,893 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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-15 12:47:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:19,166 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 12:47:19,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:47:19,166 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 49 [2022-04-15 12:47:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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-15 12:47:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 61 transitions. [2022-04-15 12:47:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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-15 12:47:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 61 transitions. [2022-04-15 12:47:19,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 61 transitions. [2022-04-15 12:47:19,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:19,249 INFO L225 Difference]: With dead ends: 60 [2022-04-15 12:47:19,249 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 12:47:19,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=330, Invalid=1926, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:47:19,251 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:19,251 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 34 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:47:19,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 12:47:19,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-15 12:47:19,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:19,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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-15 12:47:19,351 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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-15 12:47:19,351 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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-15 12:47:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:19,352 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2022-04-15 12:47:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-04-15 12:47:19,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:19,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:19,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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 53 states. [2022-04-15 12:47:19,353 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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 53 states. [2022-04-15 12:47:19,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:19,354 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2022-04-15 12:47:19,354 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-04-15 12:47:19,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:19,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:19,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:19,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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-15 12:47:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-04-15 12:47:19,355 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 49 [2022-04-15 12:47:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:19,356 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-04-15 12:47:19,356 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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-15 12:47:19,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 55 transitions. [2022-04-15 12:47:19,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:19,476 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-04-15 12:47:19,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 12:47:19,477 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:19,477 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:19,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 12:47:19,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38 [2022-04-15 12:47:19,679 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:19,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:19,680 INFO L85 PathProgramCache]: Analyzing trace with hash 659549860, now seen corresponding path program 37 times [2022-04-15 12:47:19,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:19,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [970681263] [2022-04-15 12:47:19,850 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:19,851 INFO L85 PathProgramCache]: Analyzing trace with hash -180173967, now seen corresponding path program 1 times [2022-04-15 12:47:19,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:19,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536305593] [2022-04-15 12:47:19,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:19,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:19,858 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:19,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash 659549860, now seen corresponding path program 38 times [2022-04-15 12:47:19,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:19,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803469083] [2022-04-15 12:47:19,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:19,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:20,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:20,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {8870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8845#true} is VALID [2022-04-15 12:47:20,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {8845#true} assume true; {8845#true} is VALID [2022-04-15 12:47:20,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8845#true} {8845#true} #40#return; {8845#true} is VALID [2022-04-15 12:47:20,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {8845#true} call ULTIMATE.init(); {8870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:20,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {8870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8845#true} is VALID [2022-04-15 12:47:20,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {8845#true} assume true; {8845#true} is VALID [2022-04-15 12:47:20,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8845#true} {8845#true} #40#return; {8845#true} is VALID [2022-04-15 12:47:20,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {8845#true} call #t~ret5 := main(); {8845#true} is VALID [2022-04-15 12:47:20,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {8845#true} ~x~0 := 0; {8850#(= main_~x~0 0)} is VALID [2022-04-15 12:47:20,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {8850#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {8850#(= main_~x~0 0)} is VALID [2022-04-15 12:47:20,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {8850#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8851#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:20,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {8851#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {8851#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:20,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {8851#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8852#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:20,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {8852#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {8852#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:20,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {8852#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8853#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:20,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {8853#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8853#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:20,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {8853#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8854#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:20,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {8854#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8854#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:20,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {8854#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8855#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:20,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {8855#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {8855#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:20,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {8855#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8856#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:20,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {8856#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {8856#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:20,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {8856#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8857#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:20,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {8857#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8857#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:20,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {8857#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8858#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:20,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {8858#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8858#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:20,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {8858#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8859#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:20,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {8859#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8859#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:20,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {8859#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8860#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:20,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {8860#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8860#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:20,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {8860#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8861#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:20,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {8861#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8861#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:20,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {8861#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8862#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:20,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {8862#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8862#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:20,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {8862#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8863#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:20,310 INFO L290 TraceCheckUtils]: 32: Hoare triple {8863#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8863#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:20,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {8863#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8864#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:20,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {8864#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {8864#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:20,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {8864#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8865#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:20,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {8865#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {8865#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:20,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {8865#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8866#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:20,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {8866#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8866#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:20,318 INFO L290 TraceCheckUtils]: 39: Hoare triple {8866#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8867#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:20,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {8867#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {8867#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:20,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {8867#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8868#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:20,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {8868#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8868#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:20,322 INFO L290 TraceCheckUtils]: 43: Hoare triple {8868#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8869#(and (<= main_~x~0 19) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:20,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {8869#(and (<= main_~x~0 19) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {8869#(and (<= main_~x~0 19) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:20,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {8869#(and (<= main_~x~0 19) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {8846#false} is VALID [2022-04-15 12:47:20,323 INFO L290 TraceCheckUtils]: 46: Hoare triple {8846#false} assume !(~x~0 % 4294967296 < 100000000); {8846#false} is VALID [2022-04-15 12:47:20,323 INFO L272 TraceCheckUtils]: 47: Hoare triple {8846#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {8846#false} is VALID [2022-04-15 12:47:20,324 INFO L290 TraceCheckUtils]: 48: Hoare triple {8846#false} ~cond := #in~cond; {8846#false} is VALID [2022-04-15 12:47:20,324 INFO L290 TraceCheckUtils]: 49: Hoare triple {8846#false} assume 0 == ~cond; {8846#false} is VALID [2022-04-15 12:47:20,324 INFO L290 TraceCheckUtils]: 50: Hoare triple {8846#false} assume !false; {8846#false} is VALID [2022-04-15 12:47:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:20,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:20,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803469083] [2022-04-15 12:47:20,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803469083] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:20,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579879671] [2022-04-15 12:47:20,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:47:20,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:20,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:20,328 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:20,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 12:47:20,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:47:20,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:20,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 12:47:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:20,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:20,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {8845#true} call ULTIMATE.init(); {8845#true} is VALID [2022-04-15 12:47:20,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {8845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8845#true} is VALID [2022-04-15 12:47:20,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {8845#true} assume true; {8845#true} is VALID [2022-04-15 12:47:20,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8845#true} {8845#true} #40#return; {8845#true} is VALID [2022-04-15 12:47:20,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {8845#true} call #t~ret5 := main(); {8845#true} is VALID [2022-04-15 12:47:20,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {8845#true} ~x~0 := 0; {8850#(= main_~x~0 0)} is VALID [2022-04-15 12:47:20,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {8850#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {8850#(= main_~x~0 0)} is VALID [2022-04-15 12:47:20,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {8850#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8851#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:20,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {8851#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {8851#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:20,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {8851#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8852#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:20,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {8852#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {8852#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:20,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {8852#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8853#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:20,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {8853#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8853#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:20,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {8853#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8854#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:20,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {8854#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8854#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:20,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {8854#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8855#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:20,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {8855#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {8855#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:20,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {8855#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8856#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:20,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {8856#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {8856#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:20,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {8856#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8857#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:20,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {8857#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8857#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:20,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {8857#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8858#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:20,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {8858#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8858#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:20,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {8858#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8859#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:20,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {8859#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8859#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:20,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {8859#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8860#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:20,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {8860#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8860#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:20,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {8860#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8861#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:20,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {8861#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8861#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:20,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {8861#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8862#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:20,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {8862#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8862#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:20,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {8862#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8863#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:20,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {8863#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8863#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:20,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {8863#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8864#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:20,903 INFO L290 TraceCheckUtils]: 34: Hoare triple {8864#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {8864#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:20,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {8864#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8865#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:20,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {8865#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {8865#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:20,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {8865#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8866#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:20,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {8866#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8866#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:20,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {8866#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8867#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:20,909 INFO L290 TraceCheckUtils]: 40: Hoare triple {8867#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {8867#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:20,910 INFO L290 TraceCheckUtils]: 41: Hoare triple {8867#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8868#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:20,910 INFO L290 TraceCheckUtils]: 42: Hoare triple {8868#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8868#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:20,911 INFO L290 TraceCheckUtils]: 43: Hoare triple {8868#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9003#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:20,912 INFO L290 TraceCheckUtils]: 44: Hoare triple {9003#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {9003#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:20,913 INFO L290 TraceCheckUtils]: 45: Hoare triple {9003#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {8846#false} is VALID [2022-04-15 12:47:20,913 INFO L290 TraceCheckUtils]: 46: Hoare triple {8846#false} assume !(~x~0 % 4294967296 < 100000000); {8846#false} is VALID [2022-04-15 12:47:20,913 INFO L272 TraceCheckUtils]: 47: Hoare triple {8846#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {8846#false} is VALID [2022-04-15 12:47:20,913 INFO L290 TraceCheckUtils]: 48: Hoare triple {8846#false} ~cond := #in~cond; {8846#false} is VALID [2022-04-15 12:47:20,913 INFO L290 TraceCheckUtils]: 49: Hoare triple {8846#false} assume 0 == ~cond; {8846#false} is VALID [2022-04-15 12:47:20,913 INFO L290 TraceCheckUtils]: 50: Hoare triple {8846#false} assume !false; {8846#false} is VALID [2022-04-15 12:47:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:20,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:22,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {8846#false} assume !false; {8846#false} is VALID [2022-04-15 12:47:22,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {8846#false} assume 0 == ~cond; {8846#false} is VALID [2022-04-15 12:47:22,801 INFO L290 TraceCheckUtils]: 48: Hoare triple {8846#false} ~cond := #in~cond; {8846#false} is VALID [2022-04-15 12:47:22,801 INFO L272 TraceCheckUtils]: 47: Hoare triple {8846#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {8846#false} is VALID [2022-04-15 12:47:22,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {8846#false} assume !(~x~0 % 4294967296 < 100000000); {8846#false} is VALID [2022-04-15 12:47:22,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {9040#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {8846#false} is VALID [2022-04-15 12:47:22,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {9044#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9040#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:47:22,804 INFO L290 TraceCheckUtils]: 43: Hoare triple {9048#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9044#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,804 INFO L290 TraceCheckUtils]: 42: Hoare triple {9048#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9048#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,806 INFO L290 TraceCheckUtils]: 41: Hoare triple {9055#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9048#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,806 INFO L290 TraceCheckUtils]: 40: Hoare triple {9055#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9055#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {9062#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9055#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {9062#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {9062#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:47:22,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {9069#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9062#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:47:22,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {9069#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9069#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {9076#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9069#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {9076#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {9076#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:22,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {9083#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9076#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:22,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {9083#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {9083#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:47:22,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {9090#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9083#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:47:22,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {9090#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {9090#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:22,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {9097#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9090#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:22,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {9097#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {9097#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:47:22,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {9104#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9097#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:47:22,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {9104#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9104#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {9111#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9104#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {9111#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9111#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {9118#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9111#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {9118#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {9118#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:47:22,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {9125#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9118#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:47:22,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {9125#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {9125#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:47:22,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {9132#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9125#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:47:22,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {9132#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9132#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {9139#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9132#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {9139#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9139#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {9146#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9139#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {9146#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9146#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {9153#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9146#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {9153#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9153#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {9160#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9153#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {9160#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9160#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {9167#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9160#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {9167#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9167#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {9174#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9167#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {9174#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9174#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {8845#true} ~x~0 := 0; {9174#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:22,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {8845#true} call #t~ret5 := main(); {8845#true} is VALID [2022-04-15 12:47:22,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8845#true} {8845#true} #40#return; {8845#true} is VALID [2022-04-15 12:47:22,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {8845#true} assume true; {8845#true} is VALID [2022-04-15 12:47:22,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {8845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8845#true} is VALID [2022-04-15 12:47:22,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {8845#true} call ULTIMATE.init(); {8845#true} is VALID [2022-04-15 12:47:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:22,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579879671] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:22,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:22,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 45 [2022-04-15 12:47:22,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:22,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [970681263] [2022-04-15 12:47:22,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [970681263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:22,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:22,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:47:22,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53036388] [2022-04-15 12:47:22,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:22,835 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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 51 [2022-04-15 12:47:22,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:22,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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-15 12:47:22,904 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-15 12:47:22,904 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:47:22,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:22,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:47:22,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=1431, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:47:22,906 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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-15 12:47:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:25,432 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-04-15 12:47:25,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:47:25,432 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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 51 [2022-04-15 12:47:25,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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-15 12:47:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 63 transitions. [2022-04-15 12:47:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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-15 12:47:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 63 transitions. [2022-04-15 12:47:25,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 63 transitions. [2022-04-15 12:47:25,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:25,544 INFO L225 Difference]: With dead ends: 62 [2022-04-15 12:47:25,545 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 12:47:25,545 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1087, Invalid=3073, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 12:47:25,546 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:25,546 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 24 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 12:47:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 12:47:25,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-15 12:47:25,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:25,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 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-15 12:47:25,656 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 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-15 12:47:25,656 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 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-15 12:47:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:25,657 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-15 12:47:25,657 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-15 12:47:25,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:25,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:25,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 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 55 states. [2022-04-15 12:47:25,658 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 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 55 states. [2022-04-15 12:47:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:25,658 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-15 12:47:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-15 12:47:25,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:25,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:25,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:25,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 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-15 12:47:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-15 12:47:25,660 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 51 [2022-04-15 12:47:25,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:25,660 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-15 12:47:25,660 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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-15 12:47:25,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2022-04-15 12:47:25,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-15 12:47:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 12:47:25,795 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:25,796 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:25,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 12:47:25,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 12:47:25,999 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:26,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:26,000 INFO L85 PathProgramCache]: Analyzing trace with hash 114192705, now seen corresponding path program 39 times [2022-04-15 12:47:26,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:26,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1848629155] [2022-04-15 12:47:26,160 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:26,161 INFO L85 PathProgramCache]: Analyzing trace with hash -121068623, now seen corresponding path program 1 times [2022-04-15 12:47:26,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:26,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734397786] [2022-04-15 12:47:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:26,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:26,176 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:26,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:26,185 INFO L85 PathProgramCache]: Analyzing trace with hash 114192705, now seen corresponding path program 40 times [2022-04-15 12:47:26,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:26,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799718163] [2022-04-15 12:47:26,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:26,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:26,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {9608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9582#true} is VALID [2022-04-15 12:47:26,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-15 12:47:26,589 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9582#true} {9582#true} #40#return; {9582#true} is VALID [2022-04-15 12:47:26,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {9582#true} call ULTIMATE.init(); {9608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:26,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {9608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9582#true} is VALID [2022-04-15 12:47:26,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-15 12:47:26,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9582#true} {9582#true} #40#return; {9582#true} is VALID [2022-04-15 12:47:26,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {9582#true} call #t~ret5 := main(); {9582#true} is VALID [2022-04-15 12:47:26,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {9582#true} ~x~0 := 0; {9587#(= main_~x~0 0)} is VALID [2022-04-15 12:47:26,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {9587#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {9587#(= main_~x~0 0)} is VALID [2022-04-15 12:47:26,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {9587#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9588#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:26,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {9588#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {9588#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:26,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {9588#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9589#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:26,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {9589#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {9589#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:26,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {9589#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9590#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:26,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {9590#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9590#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:26,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {9590#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9591#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:26,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {9591#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9591#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:26,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {9591#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9592#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:26,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {9592#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {9592#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:26,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {9592#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9593#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:26,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {9593#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {9593#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:26,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {9593#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9594#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:26,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {9594#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9594#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:26,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {9594#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9595#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:26,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {9595#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9595#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:26,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {9595#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9596#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:26,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {9596#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9596#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:26,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {9596#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9597#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:26,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {9597#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9597#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:26,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {9597#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9598#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:26,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {9598#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9598#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:26,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {9598#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9599#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:26,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {9599#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9599#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:26,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {9599#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9600#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:26,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {9600#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9600#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:26,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {9600#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9601#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:26,621 INFO L290 TraceCheckUtils]: 34: Hoare triple {9601#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {9601#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:26,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {9601#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9602#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:26,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {9602#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {9602#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:26,625 INFO L290 TraceCheckUtils]: 37: Hoare triple {9602#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9603#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:26,625 INFO L290 TraceCheckUtils]: 38: Hoare triple {9603#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9603#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:26,627 INFO L290 TraceCheckUtils]: 39: Hoare triple {9603#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9604#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:26,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {9604#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {9604#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:26,629 INFO L290 TraceCheckUtils]: 41: Hoare triple {9604#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9605#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:26,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {9605#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9605#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:26,630 INFO L290 TraceCheckUtils]: 43: Hoare triple {9605#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9606#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:26,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {9606#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {9606#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:26,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {9606#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9607#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:26,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {9607#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {9607#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:26,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {9607#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {9583#false} is VALID [2022-04-15 12:47:26,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {9583#false} assume !(~x~0 % 4294967296 < 100000000); {9583#false} is VALID [2022-04-15 12:47:26,633 INFO L272 TraceCheckUtils]: 49: Hoare triple {9583#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {9583#false} is VALID [2022-04-15 12:47:26,633 INFO L290 TraceCheckUtils]: 50: Hoare triple {9583#false} ~cond := #in~cond; {9583#false} is VALID [2022-04-15 12:47:26,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {9583#false} assume 0 == ~cond; {9583#false} is VALID [2022-04-15 12:47:26,633 INFO L290 TraceCheckUtils]: 52: Hoare triple {9583#false} assume !false; {9583#false} is VALID [2022-04-15 12:47:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 21 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:26,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:26,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799718163] [2022-04-15 12:47:26,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799718163] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:26,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773516129] [2022-04-15 12:47:26,634 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:47:26,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:26,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:26,635 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:26,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 12:47:26,695 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:47:26,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:26,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 12:47:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:26,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:27,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {9582#true} call ULTIMATE.init(); {9582#true} is VALID [2022-04-15 12:47:27,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {9582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9582#true} is VALID [2022-04-15 12:47:27,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-15 12:47:27,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9582#true} {9582#true} #40#return; {9582#true} is VALID [2022-04-15 12:47:27,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {9582#true} call #t~ret5 := main(); {9582#true} is VALID [2022-04-15 12:47:27,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {9582#true} ~x~0 := 0; {9587#(= main_~x~0 0)} is VALID [2022-04-15 12:47:27,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {9587#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {9587#(= main_~x~0 0)} is VALID [2022-04-15 12:47:27,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {9587#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9588#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:27,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {9588#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {9588#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:27,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {9588#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9589#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:27,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {9589#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {9589#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:27,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {9589#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9590#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:27,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {9590#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9590#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:27,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {9590#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9591#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:27,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {9591#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9591#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:27,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {9591#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9592#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:27,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {9592#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {9592#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:27,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {9592#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9593#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:27,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {9593#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {9593#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:27,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {9593#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9594#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:27,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {9594#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9594#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:27,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {9594#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9595#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:27,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {9595#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9595#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:27,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {9595#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9596#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:27,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {9596#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9596#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:27,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {9596#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9597#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:27,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {9597#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9597#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:27,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {9597#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9598#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:27,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {9598#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9598#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:27,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {9598#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9599#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:27,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {9599#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9599#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:27,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {9599#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9600#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:27,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {9600#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9600#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:27,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {9600#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9601#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:27,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {9601#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {9601#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:27,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {9601#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9602#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:27,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {9602#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {9602#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:27,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {9602#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9603#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:27,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {9603#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9603#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:27,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {9603#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9604#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:27,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {9604#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {9604#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:27,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {9604#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9605#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:27,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {9605#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9605#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:27,248 INFO L290 TraceCheckUtils]: 43: Hoare triple {9605#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9606#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:27,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {9606#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {9606#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:27,249 INFO L290 TraceCheckUtils]: 45: Hoare triple {9606#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9747#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:27,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {9747#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9747#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:27,251 INFO L290 TraceCheckUtils]: 47: Hoare triple {9747#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {9754#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:27,253 INFO L290 TraceCheckUtils]: 48: Hoare triple {9754#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 100000000); {9583#false} is VALID [2022-04-15 12:47:27,253 INFO L272 TraceCheckUtils]: 49: Hoare triple {9583#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {9583#false} is VALID [2022-04-15 12:47:27,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {9583#false} ~cond := #in~cond; {9583#false} is VALID [2022-04-15 12:47:27,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {9583#false} assume 0 == ~cond; {9583#false} is VALID [2022-04-15 12:47:27,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {9583#false} assume !false; {9583#false} is VALID [2022-04-15 12:47:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:27,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:28,876 INFO L290 TraceCheckUtils]: 52: Hoare triple {9583#false} assume !false; {9583#false} is VALID [2022-04-15 12:47:28,877 INFO L290 TraceCheckUtils]: 51: Hoare triple {9583#false} assume 0 == ~cond; {9583#false} is VALID [2022-04-15 12:47:28,877 INFO L290 TraceCheckUtils]: 50: Hoare triple {9583#false} ~cond := #in~cond; {9583#false} is VALID [2022-04-15 12:47:28,877 INFO L272 TraceCheckUtils]: 49: Hoare triple {9583#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {9583#false} is VALID [2022-04-15 12:47:28,877 INFO L290 TraceCheckUtils]: 48: Hoare triple {9782#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {9583#false} is VALID [2022-04-15 12:47:28,879 INFO L290 TraceCheckUtils]: 47: Hoare triple {9786#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {9782#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,879 INFO L290 TraceCheckUtils]: 46: Hoare triple {9786#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9786#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,881 INFO L290 TraceCheckUtils]: 45: Hoare triple {9793#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9786#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,881 INFO L290 TraceCheckUtils]: 44: Hoare triple {9793#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9793#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,883 INFO L290 TraceCheckUtils]: 43: Hoare triple {9800#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9793#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,883 INFO L290 TraceCheckUtils]: 42: Hoare triple {9800#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9800#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {9807#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9800#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {9807#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9807#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,886 INFO L290 TraceCheckUtils]: 39: Hoare triple {9814#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9807#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,886 INFO L290 TraceCheckUtils]: 38: Hoare triple {9814#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9814#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {9821#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9814#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {9821#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9821#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {9828#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9821#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {9828#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9828#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {9835#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9828#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {9835#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9835#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {9842#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9835#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {9842#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9842#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {9849#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9842#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {9849#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9849#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {9856#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9849#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {9856#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9856#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {9863#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9856#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {9863#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9863#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {9870#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9863#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {9870#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9870#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {9877#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9870#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {9877#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9877#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {9884#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9877#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {9884#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9884#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {9891#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9884#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {9891#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9891#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {9898#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9891#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {9898#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9898#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {9905#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9898#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {9905#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9905#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {9912#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9905#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {9912#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9912#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {9919#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9912#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {9919#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9919#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {9926#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9919#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {9926#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9926#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {9582#true} ~x~0 := 0; {9926#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:47:28,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {9582#true} call #t~ret5 := main(); {9582#true} is VALID [2022-04-15 12:47:28,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9582#true} {9582#true} #40#return; {9582#true} is VALID [2022-04-15 12:47:28,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {9582#true} assume true; {9582#true} is VALID [2022-04-15 12:47:28,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {9582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9582#true} is VALID [2022-04-15 12:47:28,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {9582#true} call ULTIMATE.init(); {9582#true} is VALID [2022-04-15 12:47:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:28,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773516129] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:28,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:28,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2022-04-15 12:47:28,915 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:28,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1848629155] [2022-04-15 12:47:28,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1848629155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:28,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:28,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:47:28,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176487165] [2022-04-15 12:47:28,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:28,916 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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 53 [2022-04-15 12:47:28,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:28,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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-15 12:47:28,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:28,995 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:47:28,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:28,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:47:28,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=1636, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:47:28,997 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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-15 12:47:32,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:32,081 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2022-04-15 12:47:32,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:47:32,081 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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 53 [2022-04-15 12:47:32,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:32,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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-15 12:47:32,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2022-04-15 12:47:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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-15 12:47:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2022-04-15 12:47:32,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 65 transitions. [2022-04-15 12:47:32,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:32,205 INFO L225 Difference]: With dead ends: 64 [2022-04-15 12:47:32,205 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 12:47:32,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1206, Invalid=3486, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 12:47:32,207 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:32,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 99 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 12:47:32,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 12:47:32,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-15 12:47:32,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:32,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:32,343 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:32,343 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:32,344 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-15 12:47:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-15 12:47:32,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:32,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:32,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 12:47:32,344 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 12:47:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:32,345 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-15 12:47:32,345 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-15 12:47:32,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:32,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:32,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:32,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-04-15 12:47:32,347 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 53 [2022-04-15 12:47:32,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:32,347 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-04-15 12:47:32,347 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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-15 12:47:32,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 59 transitions. [2022-04-15 12:47:32,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-15 12:47:32,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 12:47:32,505 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:32,506 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:32,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 12:47:32,707 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42 [2022-04-15 12:47:32,707 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:32,708 INFO L85 PathProgramCache]: Analyzing trace with hash 11976862, now seen corresponding path program 41 times [2022-04-15 12:47:32,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:32,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [941371115] [2022-04-15 12:47:32,863 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:32,865 INFO L85 PathProgramCache]: Analyzing trace with hash -61963279, now seen corresponding path program 1 times [2022-04-15 12:47:32,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:32,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373554239] [2022-04-15 12:47:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:32,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:32,878 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:32,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:32,884 INFO L85 PathProgramCache]: Analyzing trace with hash 11976862, now seen corresponding path program 42 times [2022-04-15 12:47:32,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:32,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824558625] [2022-04-15 12:47:32,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:32,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:33,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:33,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {10375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10348#true} is VALID [2022-04-15 12:47:33,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {10348#true} assume true; {10348#true} is VALID [2022-04-15 12:47:33,286 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10348#true} {10348#true} #40#return; {10348#true} is VALID [2022-04-15 12:47:33,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {10348#true} call ULTIMATE.init(); {10375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:33,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {10375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10348#true} is VALID [2022-04-15 12:47:33,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {10348#true} assume true; {10348#true} is VALID [2022-04-15 12:47:33,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10348#true} {10348#true} #40#return; {10348#true} is VALID [2022-04-15 12:47:33,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {10348#true} call #t~ret5 := main(); {10348#true} is VALID [2022-04-15 12:47:33,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {10348#true} ~x~0 := 0; {10353#(= main_~x~0 0)} is VALID [2022-04-15 12:47:33,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {10353#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {10353#(= main_~x~0 0)} is VALID [2022-04-15 12:47:33,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {10353#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10354#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:33,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {10354#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {10354#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:33,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {10354#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10355#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:33,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {10355#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {10355#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:33,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {10355#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10356#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:33,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {10356#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10356#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:33,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {10356#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10357#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:33,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {10357#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10357#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:33,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {10357#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10358#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:33,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {10358#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {10358#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:33,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {10358#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10359#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:33,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {10359#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {10359#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:33,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {10359#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10360#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:33,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {10360#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10360#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:33,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {10360#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10361#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:33,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {10361#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10361#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:33,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {10361#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10362#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:33,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {10362#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10362#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:33,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {10362#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10363#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:33,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {10363#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10363#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:33,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {10363#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10364#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:33,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {10364#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10364#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:33,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {10364#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10365#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:33,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {10365#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10365#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:33,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {10365#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10366#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:33,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {10366#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10366#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:33,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {10366#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10367#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:33,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {10367#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {10367#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:33,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {10367#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10368#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:33,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {10368#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {10368#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:33,324 INFO L290 TraceCheckUtils]: 37: Hoare triple {10368#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10369#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:33,324 INFO L290 TraceCheckUtils]: 38: Hoare triple {10369#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10369#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:33,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {10369#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10370#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:33,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {10370#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {10370#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:33,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {10370#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10371#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:33,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {10371#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10371#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:33,330 INFO L290 TraceCheckUtils]: 43: Hoare triple {10371#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10372#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:33,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {10372#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {10372#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:33,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {10372#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10373#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:33,333 INFO L290 TraceCheckUtils]: 46: Hoare triple {10373#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10373#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:33,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {10373#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10374#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:33,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {10374#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {10374#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:33,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {10374#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 21))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {10349#false} is VALID [2022-04-15 12:47:33,335 INFO L290 TraceCheckUtils]: 50: Hoare triple {10349#false} assume !(~x~0 % 4294967296 < 100000000); {10349#false} is VALID [2022-04-15 12:47:33,335 INFO L272 TraceCheckUtils]: 51: Hoare triple {10349#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {10349#false} is VALID [2022-04-15 12:47:33,335 INFO L290 TraceCheckUtils]: 52: Hoare triple {10349#false} ~cond := #in~cond; {10349#false} is VALID [2022-04-15 12:47:33,335 INFO L290 TraceCheckUtils]: 53: Hoare triple {10349#false} assume 0 == ~cond; {10349#false} is VALID [2022-04-15 12:47:33,335 INFO L290 TraceCheckUtils]: 54: Hoare triple {10349#false} assume !false; {10349#false} is VALID [2022-04-15 12:47:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 22 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:33,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:33,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824558625] [2022-04-15 12:47:33,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824558625] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:33,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416350257] [2022-04-15 12:47:33,336 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:47:33,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:33,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:33,337 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:33,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 12:47:33,405 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:47:33,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:33,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 12:47:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:33,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:33,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {10348#true} call ULTIMATE.init(); {10348#true} is VALID [2022-04-15 12:47:33,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {10348#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10348#true} is VALID [2022-04-15 12:47:33,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {10348#true} assume true; {10348#true} is VALID [2022-04-15 12:47:33,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10348#true} {10348#true} #40#return; {10348#true} is VALID [2022-04-15 12:47:33,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {10348#true} call #t~ret5 := main(); {10348#true} is VALID [2022-04-15 12:47:33,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {10348#true} ~x~0 := 0; {10348#true} is VALID [2022-04-15 12:47:33,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,617 INFO L290 TraceCheckUtils]: 32: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,618 INFO L290 TraceCheckUtils]: 41: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,618 INFO L290 TraceCheckUtils]: 42: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,618 INFO L290 TraceCheckUtils]: 43: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,618 INFO L290 TraceCheckUtils]: 44: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,618 INFO L290 TraceCheckUtils]: 45: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:33,618 INFO L290 TraceCheckUtils]: 46: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:33,620 INFO L290 TraceCheckUtils]: 47: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10520#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:47:33,620 INFO L290 TraceCheckUtils]: 48: Hoare triple {10520#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {10520#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:47:33,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {10520#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {10527#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-15 12:47:33,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {10527#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 100000000); {10349#false} is VALID [2022-04-15 12:47:33,624 INFO L272 TraceCheckUtils]: 51: Hoare triple {10349#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {10349#false} is VALID [2022-04-15 12:47:33,624 INFO L290 TraceCheckUtils]: 52: Hoare triple {10349#false} ~cond := #in~cond; {10349#false} is VALID [2022-04-15 12:47:33,624 INFO L290 TraceCheckUtils]: 53: Hoare triple {10349#false} assume 0 == ~cond; {10349#false} is VALID [2022-04-15 12:47:33,624 INFO L290 TraceCheckUtils]: 54: Hoare triple {10349#false} assume !false; {10349#false} is VALID [2022-04-15 12:47:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 63 proven. 1 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-15 12:47:33,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:34,276 INFO L290 TraceCheckUtils]: 54: Hoare triple {10349#false} assume !false; {10349#false} is VALID [2022-04-15 12:47:34,277 INFO L290 TraceCheckUtils]: 53: Hoare triple {10546#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10349#false} is VALID [2022-04-15 12:47:34,277 INFO L290 TraceCheckUtils]: 52: Hoare triple {10550#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10546#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:47:34,278 INFO L272 TraceCheckUtils]: 51: Hoare triple {10554#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {10550#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:47:34,278 INFO L290 TraceCheckUtils]: 50: Hoare triple {10558#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {10554#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:47:34,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {10562#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {10558#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:47:34,280 INFO L290 TraceCheckUtils]: 48: Hoare triple {10562#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {10562#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:47:34,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10562#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:47:34,283 INFO L290 TraceCheckUtils]: 46: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,283 INFO L290 TraceCheckUtils]: 45: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,283 INFO L290 TraceCheckUtils]: 44: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,283 INFO L290 TraceCheckUtils]: 43: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,283 INFO L290 TraceCheckUtils]: 39: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,283 INFO L290 TraceCheckUtils]: 38: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,284 INFO L290 TraceCheckUtils]: 30: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,284 INFO L290 TraceCheckUtils]: 28: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {10348#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10348#true} is VALID [2022-04-15 12:47:34,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {10348#true} assume !!(~x~0 % 4294967296 < 100000000); {10348#true} is VALID [2022-04-15 12:47:34,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {10348#true} ~x~0 := 0; {10348#true} is VALID [2022-04-15 12:47:34,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {10348#true} call #t~ret5 := main(); {10348#true} is VALID [2022-04-15 12:47:34,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10348#true} {10348#true} #40#return; {10348#true} is VALID [2022-04-15 12:47:34,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {10348#true} assume true; {10348#true} is VALID [2022-04-15 12:47:34,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {10348#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10348#true} is VALID [2022-04-15 12:47:34,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {10348#true} call ULTIMATE.init(); {10348#true} is VALID [2022-04-15 12:47:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 63 proven. 1 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-15 12:47:34,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416350257] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:34,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:34,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 4, 7] total 32 [2022-04-15 12:47:34,287 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:34,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [941371115] [2022-04-15 12:47:34,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [941371115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:34,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:34,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 12:47:34,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722472757] [2022-04-15 12:47:34,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:34,288 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 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 55 [2022-04-15 12:47:34,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:34,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 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-15 12:47:34,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:34,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 12:47:34,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:34,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 12:47:34,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:47:34,383 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 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-15 12:47:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:38,067 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-04-15 12:47:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:47:38,067 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 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 55 [2022-04-15 12:47:38,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 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-15 12:47:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 67 transitions. [2022-04-15 12:47:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 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-15 12:47:38,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 67 transitions. [2022-04-15 12:47:38,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 67 transitions. [2022-04-15 12:47:38,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:38,213 INFO L225 Difference]: With dead ends: 66 [2022-04-15 12:47:38,213 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 12:47:38,214 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=381, Invalid=2481, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 12:47:38,214 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:38,215 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 79 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 12:47:38,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 12:47:38,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-15 12:47:38,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:38,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 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-15 12:47:38,330 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 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-15 12:47:38,330 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 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-15 12:47:38,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:38,331 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-15 12:47:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-15 12:47:38,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:38,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:38,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 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 59 states. [2022-04-15 12:47:38,331 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 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 59 states. [2022-04-15 12:47:38,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:38,332 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-15 12:47:38,332 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-15 12:47:38,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:38,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:38,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:38,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 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-15 12:47:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-04-15 12:47:38,334 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2022-04-15 12:47:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:38,334 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-04-15 12:47:38,334 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 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-15 12:47:38,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 61 transitions. [2022-04-15 12:47:38,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-15 12:47:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 12:47:38,499 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:38,499 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:38,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-15 12:47:38,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44 [2022-04-15 12:47:38,699 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:38,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:38,700 INFO L85 PathProgramCache]: Analyzing trace with hash 566799547, now seen corresponding path program 43 times [2022-04-15 12:47:38,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:38,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [822218767] [2022-04-15 12:47:38,862 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:38,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2857935, now seen corresponding path program 1 times [2022-04-15 12:47:38,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:38,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084210985] [2022-04-15 12:47:38,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:38,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:38,870 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:38,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:38,876 INFO L85 PathProgramCache]: Analyzing trace with hash 566799547, now seen corresponding path program 44 times [2022-04-15 12:47:38,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:38,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080233975] [2022-04-15 12:47:38,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:38,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:39,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:39,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {11152#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11124#true} is VALID [2022-04-15 12:47:39,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {11124#true} assume true; {11124#true} is VALID [2022-04-15 12:47:39,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11124#true} {11124#true} #40#return; {11124#true} is VALID [2022-04-15 12:47:39,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {11124#true} call ULTIMATE.init(); {11152#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:39,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {11152#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11124#true} is VALID [2022-04-15 12:47:39,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {11124#true} assume true; {11124#true} is VALID [2022-04-15 12:47:39,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11124#true} {11124#true} #40#return; {11124#true} is VALID [2022-04-15 12:47:39,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {11124#true} call #t~ret5 := main(); {11124#true} is VALID [2022-04-15 12:47:39,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {11124#true} ~x~0 := 0; {11129#(= main_~x~0 0)} is VALID [2022-04-15 12:47:39,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {11129#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {11129#(= main_~x~0 0)} is VALID [2022-04-15 12:47:39,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {11129#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11130#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:39,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {11130#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {11130#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:39,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {11130#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:39,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {11131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {11131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:39,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {11131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:39,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {11132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:39,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {11132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11133#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:39,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {11133#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11133#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:39,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {11133#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:39,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {11134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {11134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:39,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {11134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11135#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:39,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {11135#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {11135#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:39,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {11135#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:39,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {11136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:39,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {11136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:39,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {11137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:39,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {11137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11138#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:39,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {11138#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11138#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:39,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {11138#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:39,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {11139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:39,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {11139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11140#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:39,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {11140#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11140#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:39,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {11140#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:39,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {11141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:39,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {11141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:39,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {11142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:39,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {11142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11143#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:39,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {11143#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {11143#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:39,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {11143#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:39,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {11144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {11144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:39,382 INFO L290 TraceCheckUtils]: 37: Hoare triple {11144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:39,383 INFO L290 TraceCheckUtils]: 38: Hoare triple {11145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:39,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {11145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11146#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:39,385 INFO L290 TraceCheckUtils]: 40: Hoare triple {11146#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {11146#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:39,387 INFO L290 TraceCheckUtils]: 41: Hoare triple {11146#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11147#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:39,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {11147#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11147#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:39,389 INFO L290 TraceCheckUtils]: 43: Hoare triple {11147#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11148#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:39,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {11148#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {11148#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:39,391 INFO L290 TraceCheckUtils]: 45: Hoare triple {11148#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11149#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:39,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {11149#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11149#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:39,393 INFO L290 TraceCheckUtils]: 47: Hoare triple {11149#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11150#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:39,394 INFO L290 TraceCheckUtils]: 48: Hoare triple {11150#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {11150#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:39,395 INFO L290 TraceCheckUtils]: 49: Hoare triple {11150#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11151#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:39,396 INFO L290 TraceCheckUtils]: 50: Hoare triple {11151#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {11151#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:39,396 INFO L290 TraceCheckUtils]: 51: Hoare triple {11151#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {11125#false} is VALID [2022-04-15 12:47:39,396 INFO L290 TraceCheckUtils]: 52: Hoare triple {11125#false} assume !(~x~0 % 4294967296 < 100000000); {11125#false} is VALID [2022-04-15 12:47:39,397 INFO L272 TraceCheckUtils]: 53: Hoare triple {11125#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {11125#false} is VALID [2022-04-15 12:47:39,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {11125#false} ~cond := #in~cond; {11125#false} is VALID [2022-04-15 12:47:39,397 INFO L290 TraceCheckUtils]: 55: Hoare triple {11125#false} assume 0 == ~cond; {11125#false} is VALID [2022-04-15 12:47:39,397 INFO L290 TraceCheckUtils]: 56: Hoare triple {11125#false} assume !false; {11125#false} is VALID [2022-04-15 12:47:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:39,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:39,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080233975] [2022-04-15 12:47:39,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080233975] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:39,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205928850] [2022-04-15 12:47:39,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:47:39,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:39,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:39,399 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:39,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 12:47:39,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:47:39,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:39,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 12:47:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:39,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:39,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {11124#true} call ULTIMATE.init(); {11124#true} is VALID [2022-04-15 12:47:39,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {11124#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11124#true} is VALID [2022-04-15 12:47:39,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {11124#true} assume true; {11124#true} is VALID [2022-04-15 12:47:39,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11124#true} {11124#true} #40#return; {11124#true} is VALID [2022-04-15 12:47:39,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {11124#true} call #t~ret5 := main(); {11124#true} is VALID [2022-04-15 12:47:39,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {11124#true} ~x~0 := 0; {11129#(= main_~x~0 0)} is VALID [2022-04-15 12:47:39,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {11129#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {11129#(= main_~x~0 0)} is VALID [2022-04-15 12:47:39,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {11129#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11130#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:39,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {11130#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {11130#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:39,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {11130#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:39,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {11131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {11131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:39,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {11131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:39,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {11132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:39,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {11132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11133#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:39,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {11133#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11133#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:39,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {11133#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:39,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {11134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {11134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:39,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {11134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11135#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:39,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {11135#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {11135#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:39,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {11135#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:39,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {11136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:39,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {11136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:39,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {11137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:39,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {11137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11138#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:39,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {11138#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11138#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:39,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {11138#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:39,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {11139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:39,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {11139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11140#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:39,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {11140#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11140#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:39,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {11140#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:39,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {11141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:39,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {11141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:39,969 INFO L290 TraceCheckUtils]: 32: Hoare triple {11142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:39,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {11142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11143#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:39,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {11143#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {11143#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:39,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {11143#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:39,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {11144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {11144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:39,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {11144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:39,976 INFO L290 TraceCheckUtils]: 38: Hoare triple {11145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:39,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {11145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11146#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:39,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {11146#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {11146#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:39,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {11146#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11147#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:39,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {11147#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11147#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:39,982 INFO L290 TraceCheckUtils]: 43: Hoare triple {11147#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11148#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:39,982 INFO L290 TraceCheckUtils]: 44: Hoare triple {11148#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {11148#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:39,984 INFO L290 TraceCheckUtils]: 45: Hoare triple {11148#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11149#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:39,984 INFO L290 TraceCheckUtils]: 46: Hoare triple {11149#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11149#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:39,986 INFO L290 TraceCheckUtils]: 47: Hoare triple {11149#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11150#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:39,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {11150#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {11150#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:39,989 INFO L290 TraceCheckUtils]: 49: Hoare triple {11150#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11303#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:39,989 INFO L290 TraceCheckUtils]: 50: Hoare triple {11303#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {11303#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:39,991 INFO L290 TraceCheckUtils]: 51: Hoare triple {11303#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {11125#false} is VALID [2022-04-15 12:47:39,991 INFO L290 TraceCheckUtils]: 52: Hoare triple {11125#false} assume !(~x~0 % 4294967296 < 100000000); {11125#false} is VALID [2022-04-15 12:47:39,991 INFO L272 TraceCheckUtils]: 53: Hoare triple {11125#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {11125#false} is VALID [2022-04-15 12:47:39,991 INFO L290 TraceCheckUtils]: 54: Hoare triple {11125#false} ~cond := #in~cond; {11125#false} is VALID [2022-04-15 12:47:39,991 INFO L290 TraceCheckUtils]: 55: Hoare triple {11125#false} assume 0 == ~cond; {11125#false} is VALID [2022-04-15 12:47:39,991 INFO L290 TraceCheckUtils]: 56: Hoare triple {11125#false} assume !false; {11125#false} is VALID [2022-04-15 12:47:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:39,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:42,659 INFO L290 TraceCheckUtils]: 56: Hoare triple {11125#false} assume !false; {11125#false} is VALID [2022-04-15 12:47:42,659 INFO L290 TraceCheckUtils]: 55: Hoare triple {11125#false} assume 0 == ~cond; {11125#false} is VALID [2022-04-15 12:47:42,659 INFO L290 TraceCheckUtils]: 54: Hoare triple {11125#false} ~cond := #in~cond; {11125#false} is VALID [2022-04-15 12:47:42,659 INFO L272 TraceCheckUtils]: 53: Hoare triple {11125#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {11125#false} is VALID [2022-04-15 12:47:42,659 INFO L290 TraceCheckUtils]: 52: Hoare triple {11125#false} assume !(~x~0 % 4294967296 < 100000000); {11125#false} is VALID [2022-04-15 12:47:42,659 INFO L290 TraceCheckUtils]: 51: Hoare triple {11340#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {11125#false} is VALID [2022-04-15 12:47:42,660 INFO L290 TraceCheckUtils]: 50: Hoare triple {11344#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {11340#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:47:42,662 INFO L290 TraceCheckUtils]: 49: Hoare triple {11348#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11344#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {11348#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {11348#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,665 INFO L290 TraceCheckUtils]: 47: Hoare triple {11355#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11348#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,665 INFO L290 TraceCheckUtils]: 46: Hoare triple {11355#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {11355#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,668 INFO L290 TraceCheckUtils]: 45: Hoare triple {11362#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11355#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,668 INFO L290 TraceCheckUtils]: 44: Hoare triple {11362#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {11362#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:47:42,670 INFO L290 TraceCheckUtils]: 43: Hoare triple {11369#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11362#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:47:42,670 INFO L290 TraceCheckUtils]: 42: Hoare triple {11369#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {11369#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {11376#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11369#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {11376#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {11376#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:42,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {11383#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11376#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:42,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {11383#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {11383#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:47:42,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {11390#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11383#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:47:42,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {11390#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {11390#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:42,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {11397#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11390#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:42,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {11397#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {11397#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:47:42,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {11404#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11397#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:47:42,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {11404#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {11404#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {11411#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11404#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {11411#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {11411#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {11418#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11411#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,683 INFO L290 TraceCheckUtils]: 28: Hoare triple {11418#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {11418#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:47:42,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {11425#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11418#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:47:42,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {11425#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {11425#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:47:42,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {11432#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11425#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:47:42,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {11432#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {11432#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {11439#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11432#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {11439#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {11439#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {11446#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11439#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {11446#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {11446#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {11453#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11446#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {11453#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {11453#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {11460#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11453#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {11460#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {11460#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {11467#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11460#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {11467#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {11467#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {11474#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11467#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {11474#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {11474#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {11481#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11474#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {11481#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {11481#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {11488#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11481#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {11488#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {11488#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {11495#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11488#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {11495#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {11495#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {11124#true} ~x~0 := 0; {11495#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:42,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {11124#true} call #t~ret5 := main(); {11124#true} is VALID [2022-04-15 12:47:42,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11124#true} {11124#true} #40#return; {11124#true} is VALID [2022-04-15 12:47:42,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {11124#true} assume true; {11124#true} is VALID [2022-04-15 12:47:42,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {11124#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11124#true} is VALID [2022-04-15 12:47:42,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {11124#true} call ULTIMATE.init(); {11124#true} is VALID [2022-04-15 12:47:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:42,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205928850] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:42,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:42,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 26] total 51 [2022-04-15 12:47:42,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:42,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [822218767] [2022-04-15 12:47:42,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [822218767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:42,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:42,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:47:42,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656808265] [2022-04-15 12:47:42,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:42,712 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 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 57 [2022-04-15 12:47:42,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:42,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 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-15 12:47:42,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:42,816 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:47:42,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:42,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:47:42,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=1851, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:47:42,817 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 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-15 12:47:47,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:47,079 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-15 12:47:47,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:47:47,079 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 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 57 [2022-04-15 12:47:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 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-15 12:47:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 69 transitions. [2022-04-15 12:47:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 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-15 12:47:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 69 transitions. [2022-04-15 12:47:47,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 69 transitions. [2022-04-15 12:47:47,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:47,339 INFO L225 Difference]: With dead ends: 68 [2022-04-15 12:47:47,339 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 12:47:47,341 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1387, Invalid=4015, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 12:47:47,341 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:47,341 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 114 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 12:47:47,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 12:47:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-15 12:47:47,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:47,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 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-15 12:47:47,488 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 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-15 12:47:47,488 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 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-15 12:47:47,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:47,489 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-15 12:47:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-15 12:47:47,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:47,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:47,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 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-15 12:47:47,490 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 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-15 12:47:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:47,490 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-15 12:47:47,490 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-15 12:47:47,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:47,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:47,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:47,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 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-15 12:47:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-04-15 12:47:47,492 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 57 [2022-04-15 12:47:47,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:47,492 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-04-15 12:47:47,492 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 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-15 12:47:47,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 63 transitions. [2022-04-15 12:47:47,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-15 12:47:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 12:47:47,711 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:47,711 INFO L499 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:47,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 12:47:47,912 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:47,912 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:47,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:47,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1175455128, now seen corresponding path program 45 times [2022-04-15 12:47:47,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:47,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1118753865] [2022-04-15 12:47:48,105 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:48,108 INFO L85 PathProgramCache]: Analyzing trace with hash 56247409, now seen corresponding path program 1 times [2022-04-15 12:47:48,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:48,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558085123] [2022-04-15 12:47:48,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:48,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:48,115 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:48,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1175455128, now seen corresponding path program 46 times [2022-04-15 12:47:48,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:48,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65306862] [2022-04-15 12:47:48,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:48,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:48,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:48,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {11974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11945#true} is VALID [2022-04-15 12:47:48,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {11945#true} assume true; {11945#true} is VALID [2022-04-15 12:47:48,656 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11945#true} {11945#true} #40#return; {11945#true} is VALID [2022-04-15 12:47:48,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {11945#true} call ULTIMATE.init(); {11974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:48,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {11974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11945#true} is VALID [2022-04-15 12:47:48,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {11945#true} assume true; {11945#true} is VALID [2022-04-15 12:47:48,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11945#true} {11945#true} #40#return; {11945#true} is VALID [2022-04-15 12:47:48,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {11945#true} call #t~ret5 := main(); {11945#true} is VALID [2022-04-15 12:47:48,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {11945#true} ~x~0 := 0; {11950#(= main_~x~0 0)} is VALID [2022-04-15 12:47:48,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {11950#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {11950#(= main_~x~0 0)} is VALID [2022-04-15 12:47:48,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {11950#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11951#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:48,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {11951#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {11951#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:48,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {11951#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11952#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:48,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {11952#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {11952#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:48,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {11952#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11953#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:48,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {11953#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11953#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:48,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {11953#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11954#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:48,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {11954#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11954#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:48,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {11954#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11955#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:48,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {11955#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {11955#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:48,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {11955#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11956#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:48,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {11956#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {11956#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:48,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {11956#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:48,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {11957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:48,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {11957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11958#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:48,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {11958#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11958#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:48,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {11958#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11959#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:48,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {11959#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11959#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:48,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {11959#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11960#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:48,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {11960#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11960#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:48,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {11960#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11961#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:48,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {11961#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11961#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:48,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {11961#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11962#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:48,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {11962#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11962#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:48,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {11962#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11963#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:48,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {11963#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11963#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:48,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {11963#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11964#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:48,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {11964#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {11964#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:48,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {11964#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11965#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:48,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {11965#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {11965#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:48,704 INFO L290 TraceCheckUtils]: 37: Hoare triple {11965#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11966#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:48,704 INFO L290 TraceCheckUtils]: 38: Hoare triple {11966#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11966#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:48,707 INFO L290 TraceCheckUtils]: 39: Hoare triple {11966#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11967#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:48,707 INFO L290 TraceCheckUtils]: 40: Hoare triple {11967#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {11967#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:48,710 INFO L290 TraceCheckUtils]: 41: Hoare triple {11967#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:48,710 INFO L290 TraceCheckUtils]: 42: Hoare triple {11968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:48,712 INFO L290 TraceCheckUtils]: 43: Hoare triple {11968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11969#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:48,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {11969#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {11969#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:48,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {11969#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11970#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:48,717 INFO L290 TraceCheckUtils]: 46: Hoare triple {11970#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11970#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:48,720 INFO L290 TraceCheckUtils]: 47: Hoare triple {11970#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11971#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:48,720 INFO L290 TraceCheckUtils]: 48: Hoare triple {11971#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {11971#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:48,722 INFO L290 TraceCheckUtils]: 49: Hoare triple {11971#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11972#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:48,722 INFO L290 TraceCheckUtils]: 50: Hoare triple {11972#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {11972#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:48,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {11972#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11973#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 23))} is VALID [2022-04-15 12:47:48,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {11973#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {11973#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 23))} is VALID [2022-04-15 12:47:48,725 INFO L290 TraceCheckUtils]: 53: Hoare triple {11973#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 23))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {11946#false} is VALID [2022-04-15 12:47:48,725 INFO L290 TraceCheckUtils]: 54: Hoare triple {11946#false} assume !(~x~0 % 4294967296 < 100000000); {11946#false} is VALID [2022-04-15 12:47:48,725 INFO L272 TraceCheckUtils]: 55: Hoare triple {11946#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {11946#false} is VALID [2022-04-15 12:47:48,725 INFO L290 TraceCheckUtils]: 56: Hoare triple {11946#false} ~cond := #in~cond; {11946#false} is VALID [2022-04-15 12:47:48,725 INFO L290 TraceCheckUtils]: 57: Hoare triple {11946#false} assume 0 == ~cond; {11946#false} is VALID [2022-04-15 12:47:48,725 INFO L290 TraceCheckUtils]: 58: Hoare triple {11946#false} assume !false; {11946#false} is VALID [2022-04-15 12:47:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 24 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:48,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:48,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65306862] [2022-04-15 12:47:48,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65306862] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:48,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864834833] [2022-04-15 12:47:48,726 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:47:48,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:48,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:48,727 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:48,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 12:47:48,802 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:47:48,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:48,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-15 12:47:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:48,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:49,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {11945#true} call ULTIMATE.init(); {11945#true} is VALID [2022-04-15 12:47:49,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {11945#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11945#true} is VALID [2022-04-15 12:47:49,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {11945#true} assume true; {11945#true} is VALID [2022-04-15 12:47:49,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11945#true} {11945#true} #40#return; {11945#true} is VALID [2022-04-15 12:47:49,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {11945#true} call #t~ret5 := main(); {11945#true} is VALID [2022-04-15 12:47:49,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {11945#true} ~x~0 := 0; {11950#(= main_~x~0 0)} is VALID [2022-04-15 12:47:49,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {11950#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {11950#(= main_~x~0 0)} is VALID [2022-04-15 12:47:49,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {11950#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11951#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:49,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {11951#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {11951#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:49,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {11951#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11952#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:49,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {11952#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {11952#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:49,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {11952#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11953#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:49,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {11953#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11953#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:49,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {11953#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11954#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:49,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {11954#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11954#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:49,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {11954#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11955#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:49,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {11955#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {11955#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:49,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {11955#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11956#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:49,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {11956#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {11956#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:49,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {11956#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:49,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {11957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:49,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {11957#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11958#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:49,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {11958#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11958#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:49,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {11958#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11959#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:49,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {11959#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11959#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:49,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {11959#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11960#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:49,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {11960#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11960#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:49,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {11960#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11961#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:49,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {11961#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11961#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:49,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {11961#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11962#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:49,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {11962#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11962#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:49,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {11962#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11963#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:49,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {11963#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11963#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:49,360 INFO L290 TraceCheckUtils]: 33: Hoare triple {11963#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11964#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:49,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {11964#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {11964#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:49,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {11964#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11965#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:49,363 INFO L290 TraceCheckUtils]: 36: Hoare triple {11965#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {11965#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:49,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {11965#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11966#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:49,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {11966#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11966#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:49,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {11966#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11967#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:49,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {11967#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {11967#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:49,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {11967#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:49,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {11968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:49,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {11968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11969#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:49,374 INFO L290 TraceCheckUtils]: 44: Hoare triple {11969#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {11969#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:49,376 INFO L290 TraceCheckUtils]: 45: Hoare triple {11969#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11970#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:49,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {11970#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11970#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:49,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {11970#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11971#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:49,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {11971#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {11971#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:49,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {11971#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11972#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:49,382 INFO L290 TraceCheckUtils]: 50: Hoare triple {11972#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {11972#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:49,384 INFO L290 TraceCheckUtils]: 51: Hoare triple {11972#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12131#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:47:49,384 INFO L290 TraceCheckUtils]: 52: Hoare triple {12131#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {12131#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:47:49,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {12131#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {11946#false} is VALID [2022-04-15 12:47:49,386 INFO L290 TraceCheckUtils]: 54: Hoare triple {11946#false} assume !(~x~0 % 4294967296 < 100000000); {11946#false} is VALID [2022-04-15 12:47:49,387 INFO L272 TraceCheckUtils]: 55: Hoare triple {11946#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {11946#false} is VALID [2022-04-15 12:47:49,387 INFO L290 TraceCheckUtils]: 56: Hoare triple {11946#false} ~cond := #in~cond; {11946#false} is VALID [2022-04-15 12:47:49,387 INFO L290 TraceCheckUtils]: 57: Hoare triple {11946#false} assume 0 == ~cond; {11946#false} is VALID [2022-04-15 12:47:49,387 INFO L290 TraceCheckUtils]: 58: Hoare triple {11946#false} assume !false; {11946#false} is VALID [2022-04-15 12:47:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 24 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:49,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:52,592 INFO L290 TraceCheckUtils]: 58: Hoare triple {11946#false} assume !false; {11946#false} is VALID [2022-04-15 12:47:52,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {11946#false} assume 0 == ~cond; {11946#false} is VALID [2022-04-15 12:47:52,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {11946#false} ~cond := #in~cond; {11946#false} is VALID [2022-04-15 12:47:52,592 INFO L272 TraceCheckUtils]: 55: Hoare triple {11946#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {11946#false} is VALID [2022-04-15 12:47:52,592 INFO L290 TraceCheckUtils]: 54: Hoare triple {11946#false} assume !(~x~0 % 4294967296 < 100000000); {11946#false} is VALID [2022-04-15 12:47:52,592 INFO L290 TraceCheckUtils]: 53: Hoare triple {12168#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {11946#false} is VALID [2022-04-15 12:47:52,593 INFO L290 TraceCheckUtils]: 52: Hoare triple {12172#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12168#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:47:52,595 INFO L290 TraceCheckUtils]: 51: Hoare triple {12176#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12172#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,596 INFO L290 TraceCheckUtils]: 50: Hoare triple {12176#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12176#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,598 INFO L290 TraceCheckUtils]: 49: Hoare triple {12183#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12176#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {12183#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12183#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {12190#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12183#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {12190#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {12190#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:47:52,604 INFO L290 TraceCheckUtils]: 45: Hoare triple {12197#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12190#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:47:52,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {12197#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12197#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {12204#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12197#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {12204#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {12204#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:52,608 INFO L290 TraceCheckUtils]: 41: Hoare triple {12211#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12204#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:52,608 INFO L290 TraceCheckUtils]: 40: Hoare triple {12211#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {12211#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:47:52,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {12218#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12211#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:47:52,611 INFO L290 TraceCheckUtils]: 38: Hoare triple {12218#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {12218#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:52,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {12225#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12218#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:52,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {12225#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {12225#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:47:52,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {12232#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12225#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:47:52,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {12232#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12232#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {12239#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12232#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {12239#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12239#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {12246#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12239#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {12246#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {12246#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:47:52,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {12253#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12246#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:47:52,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {12253#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {12253#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:47:52,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {12260#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12253#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:47:52,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {12260#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12260#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {12267#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12260#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {12267#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12267#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {12274#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12267#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {12274#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12274#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {12281#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12274#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {12281#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12281#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {12288#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12281#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {12288#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12288#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {12295#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12288#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {12295#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12295#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {12302#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12295#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {12302#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12302#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {12309#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12302#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {12309#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12309#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {12316#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12309#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {12316#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12316#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {12323#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12316#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {12323#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12323#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {12330#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12323#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {12330#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12330#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {11945#true} ~x~0 := 0; {12330#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:52,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {11945#true} call #t~ret5 := main(); {11945#true} is VALID [2022-04-15 12:47:52,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11945#true} {11945#true} #40#return; {11945#true} is VALID [2022-04-15 12:47:52,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {11945#true} assume true; {11945#true} is VALID [2022-04-15 12:47:52,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {11945#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11945#true} is VALID [2022-04-15 12:47:52,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {11945#true} call ULTIMATE.init(); {11945#true} is VALID [2022-04-15 12:47:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 24 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:52,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864834833] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:52,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:52,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 27] total 53 [2022-04-15 12:47:52,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:52,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1118753865] [2022-04-15 12:47:52,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1118753865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:52,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:52,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 12:47:52,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634495104] [2022-04-15 12:47:52,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:52,641 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 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 59 [2022-04-15 12:47:52,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:52,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 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-15 12:47:52,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:52,796 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 12:47:52,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:52,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 12:47:52,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=753, Invalid=2003, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 12:47:52,798 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 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-15 12:47:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:58,319 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2022-04-15 12:47:58,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:47:58,319 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 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 59 [2022-04-15 12:47:58,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 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-15 12:47:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 71 transitions. [2022-04-15 12:47:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 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-15 12:47:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 71 transitions. [2022-04-15 12:47:58,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 71 transitions. [2022-04-15 12:47:58,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:58,523 INFO L225 Difference]: With dead ends: 70 [2022-04-15 12:47:58,523 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 12:47:58,523 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1495, Invalid=4357, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 12:47:58,524 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:58,524 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 124 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 12:47:58,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 12:47:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-15 12:47:58,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:58,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 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-15 12:47:58,653 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 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-15 12:47:58,653 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 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-15 12:47:58,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:58,654 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-15 12:47:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-15 12:47:58,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:58,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:58,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 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 63 states. [2022-04-15 12:47:58,655 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 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 63 states. [2022-04-15 12:47:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:58,656 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-15 12:47:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-15 12:47:58,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:58,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:58,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:58,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 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-15 12:47:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-04-15 12:47:58,658 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 59 [2022-04-15 12:47:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:58,658 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-04-15 12:47:58,658 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 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-15 12:47:58,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 65 transitions. [2022-04-15 12:47:58,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:58,900 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-15 12:47:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 12:47:58,900 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:58,901 INFO L499 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:58,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-15 12:47:59,119 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:59,119 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:59,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:59,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1977916213, now seen corresponding path program 47 times [2022-04-15 12:47:59,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:59,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1133978449] [2022-04-15 12:47:59,312 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:59,315 INFO L85 PathProgramCache]: Analyzing trace with hash 115352753, now seen corresponding path program 1 times [2022-04-15 12:47:59,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:59,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083067127] [2022-04-15 12:47:59,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:59,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:59,321 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:59,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1977916213, now seen corresponding path program 48 times [2022-04-15 12:47:59,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:59,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412923583] [2022-04-15 12:47:59,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:59,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:59,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:59,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {12824#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12794#true} is VALID [2022-04-15 12:47:59,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {12794#true} assume true; {12794#true} is VALID [2022-04-15 12:47:59,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12794#true} {12794#true} #40#return; {12794#true} is VALID [2022-04-15 12:47:59,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {12794#true} call ULTIMATE.init(); {12824#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:59,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {12824#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12794#true} is VALID [2022-04-15 12:47:59,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {12794#true} assume true; {12794#true} is VALID [2022-04-15 12:47:59,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12794#true} {12794#true} #40#return; {12794#true} is VALID [2022-04-15 12:47:59,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {12794#true} call #t~ret5 := main(); {12794#true} is VALID [2022-04-15 12:47:59,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {12794#true} ~x~0 := 0; {12799#(= main_~x~0 0)} is VALID [2022-04-15 12:47:59,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {12799#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {12799#(= main_~x~0 0)} is VALID [2022-04-15 12:47:59,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {12799#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12800#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:59,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {12800#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {12800#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:59,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {12800#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:59,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {12801#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {12801#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:59,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {12801#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12802#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:59,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {12802#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12802#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:59,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {12802#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12803#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:59,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {12803#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12803#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:59,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {12803#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12804#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:59,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {12804#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {12804#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:59,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {12804#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12805#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:59,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {12805#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {12805#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:59,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {12805#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12806#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:59,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {12806#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12806#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:59,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {12806#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12807#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:59,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {12807#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12807#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:59,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {12807#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12808#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:59,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {12808#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12808#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:59,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {12808#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12809#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:59,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {12809#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12809#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:59,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {12809#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12810#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:59,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {12810#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12810#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:59,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {12810#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12811#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:59,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {12811#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12811#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:59,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {12811#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12812#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:59,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {12812#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12812#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:59,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {12812#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12813#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:59,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {12813#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {12813#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:59,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {12813#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12814#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:59,941 INFO L290 TraceCheckUtils]: 36: Hoare triple {12814#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {12814#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:59,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {12814#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12815#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:59,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {12815#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12815#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:59,953 INFO L290 TraceCheckUtils]: 39: Hoare triple {12815#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12816#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:59,954 INFO L290 TraceCheckUtils]: 40: Hoare triple {12816#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {12816#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:59,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {12816#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12817#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:59,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {12817#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12817#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:59,964 INFO L290 TraceCheckUtils]: 43: Hoare triple {12817#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12818#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:59,965 INFO L290 TraceCheckUtils]: 44: Hoare triple {12818#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {12818#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:59,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {12818#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12819#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:59,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {12819#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12819#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:59,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {12819#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12820#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:59,977 INFO L290 TraceCheckUtils]: 48: Hoare triple {12820#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {12820#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:59,981 INFO L290 TraceCheckUtils]: 49: Hoare triple {12820#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12821#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:59,982 INFO L290 TraceCheckUtils]: 50: Hoare triple {12821#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {12821#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:59,985 INFO L290 TraceCheckUtils]: 51: Hoare triple {12821#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12822#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:47:59,986 INFO L290 TraceCheckUtils]: 52: Hoare triple {12822#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {12822#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:47:59,988 INFO L290 TraceCheckUtils]: 53: Hoare triple {12822#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12823#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:59,988 INFO L290 TraceCheckUtils]: 54: Hoare triple {12823#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {12823#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:59,990 INFO L290 TraceCheckUtils]: 55: Hoare triple {12823#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {12795#false} is VALID [2022-04-15 12:47:59,990 INFO L290 TraceCheckUtils]: 56: Hoare triple {12795#false} assume !(~x~0 % 4294967296 < 100000000); {12795#false} is VALID [2022-04-15 12:47:59,990 INFO L272 TraceCheckUtils]: 57: Hoare triple {12795#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {12795#false} is VALID [2022-04-15 12:47:59,990 INFO L290 TraceCheckUtils]: 58: Hoare triple {12795#false} ~cond := #in~cond; {12795#false} is VALID [2022-04-15 12:47:59,990 INFO L290 TraceCheckUtils]: 59: Hoare triple {12795#false} assume 0 == ~cond; {12795#false} is VALID [2022-04-15 12:47:59,990 INFO L290 TraceCheckUtils]: 60: Hoare triple {12795#false} assume !false; {12795#false} is VALID [2022-04-15 12:47:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 25 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:59,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:59,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412923583] [2022-04-15 12:47:59,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412923583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:59,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592607001] [2022-04-15 12:47:59,991 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:47:59,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:59,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:59,993 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:59,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 12:48:00,034 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:48:00,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:48:00,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:48:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:00,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:00,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {12794#true} call ULTIMATE.init(); {12794#true} is VALID [2022-04-15 12:48:00,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {12794#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12794#true} is VALID [2022-04-15 12:48:00,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {12794#true} assume true; {12794#true} is VALID [2022-04-15 12:48:00,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12794#true} {12794#true} #40#return; {12794#true} is VALID [2022-04-15 12:48:00,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {12794#true} call #t~ret5 := main(); {12794#true} is VALID [2022-04-15 12:48:00,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {12794#true} ~x~0 := 0; {12794#true} is VALID [2022-04-15 12:48:00,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,313 INFO L290 TraceCheckUtils]: 35: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,314 INFO L290 TraceCheckUtils]: 39: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,314 INFO L290 TraceCheckUtils]: 40: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,314 INFO L290 TraceCheckUtils]: 41: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,314 INFO L290 TraceCheckUtils]: 42: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,314 INFO L290 TraceCheckUtils]: 43: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,314 INFO L290 TraceCheckUtils]: 44: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,314 INFO L290 TraceCheckUtils]: 45: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,314 INFO L290 TraceCheckUtils]: 46: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,314 INFO L290 TraceCheckUtils]: 47: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,315 INFO L290 TraceCheckUtils]: 48: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,315 INFO L290 TraceCheckUtils]: 49: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,315 INFO L290 TraceCheckUtils]: 50: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,315 INFO L290 TraceCheckUtils]: 51: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:00,315 INFO L290 TraceCheckUtils]: 52: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:00,327 INFO L290 TraceCheckUtils]: 53: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12987#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:48:00,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {12987#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {12987#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:48:00,331 INFO L290 TraceCheckUtils]: 55: Hoare triple {12987#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {12994#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 12:48:00,334 INFO L290 TraceCheckUtils]: 56: Hoare triple {12994#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {12795#false} is VALID [2022-04-15 12:48:00,335 INFO L272 TraceCheckUtils]: 57: Hoare triple {12795#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {12795#false} is VALID [2022-04-15 12:48:00,335 INFO L290 TraceCheckUtils]: 58: Hoare triple {12795#false} ~cond := #in~cond; {12795#false} is VALID [2022-04-15 12:48:00,335 INFO L290 TraceCheckUtils]: 59: Hoare triple {12795#false} assume 0 == ~cond; {12795#false} is VALID [2022-04-15 12:48:00,335 INFO L290 TraceCheckUtils]: 60: Hoare triple {12795#false} assume !false; {12795#false} is VALID [2022-04-15 12:48:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 72 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-04-15 12:48:00,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:01,491 INFO L290 TraceCheckUtils]: 60: Hoare triple {12795#false} assume !false; {12795#false} is VALID [2022-04-15 12:48:01,492 INFO L290 TraceCheckUtils]: 59: Hoare triple {13013#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12795#false} is VALID [2022-04-15 12:48:01,492 INFO L290 TraceCheckUtils]: 58: Hoare triple {13017#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13013#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:48:01,493 INFO L272 TraceCheckUtils]: 57: Hoare triple {13021#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {13017#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:48:01,493 INFO L290 TraceCheckUtils]: 56: Hoare triple {13025#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {13021#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:48:01,512 INFO L290 TraceCheckUtils]: 55: Hoare triple {13029#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {13025#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:01,513 INFO L290 TraceCheckUtils]: 54: Hoare triple {13033#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {13029#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:48:01,521 INFO L290 TraceCheckUtils]: 53: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13033#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:48:01,521 INFO L290 TraceCheckUtils]: 52: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,522 INFO L290 TraceCheckUtils]: 50: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,522 INFO L290 TraceCheckUtils]: 49: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,522 INFO L290 TraceCheckUtils]: 48: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,522 INFO L290 TraceCheckUtils]: 47: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,522 INFO L290 TraceCheckUtils]: 46: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,523 INFO L290 TraceCheckUtils]: 41: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,523 INFO L290 TraceCheckUtils]: 38: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,523 INFO L290 TraceCheckUtils]: 37: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,523 INFO L290 TraceCheckUtils]: 36: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {12794#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12794#true} is VALID [2022-04-15 12:48:01,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {12794#true} assume !!(~x~0 % 4294967296 < 100000000); {12794#true} is VALID [2022-04-15 12:48:01,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {12794#true} ~x~0 := 0; {12794#true} is VALID [2022-04-15 12:48:01,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {12794#true} call #t~ret5 := main(); {12794#true} is VALID [2022-04-15 12:48:01,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12794#true} {12794#true} #40#return; {12794#true} is VALID [2022-04-15 12:48:01,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {12794#true} assume true; {12794#true} is VALID [2022-04-15 12:48:01,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {12794#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12794#true} is VALID [2022-04-15 12:48:01,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {12794#true} call ULTIMATE.init(); {12794#true} is VALID [2022-04-15 12:48:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 72 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-04-15 12:48:01,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592607001] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:01,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:01,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 4, 8] total 36 [2022-04-15 12:48:01,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:01,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1133978449] [2022-04-15 12:48:01,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1133978449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:01,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:01,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:48:01,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483600638] [2022-04-15 12:48:01,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:01,529 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 61 [2022-04-15 12:48:01,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:01,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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-15 12:48:01,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:01,713 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:48:01,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:01,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:48:01,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1060, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:48:01,714 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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-15 12:48:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:08,097 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-04-15 12:48:08,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:48:08,097 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 61 [2022-04-15 12:48:08,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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-15 12:48:08,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 73 transitions. [2022-04-15 12:48:08,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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-15 12:48:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 73 transitions. [2022-04-15 12:48:08,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 73 transitions. [2022-04-15 12:48:08,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:08,455 INFO L225 Difference]: With dead ends: 72 [2022-04-15 12:48:08,455 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 12:48:08,456 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=446, Invalid=3214, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 12:48:08,456 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:08,457 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 139 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 12:48:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 12:48:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 12:48:08,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:08,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 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-15 12:48:08,606 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 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-15 12:48:08,606 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 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-15 12:48:08,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:08,607 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2022-04-15 12:48:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-15 12:48:08,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:08,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:08,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 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 65 states. [2022-04-15 12:48:08,608 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 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 65 states. [2022-04-15 12:48:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:08,609 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2022-04-15 12:48:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-15 12:48:08,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:08,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:08,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:08,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:08,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 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-15 12:48:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2022-04-15 12:48:08,610 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 61 [2022-04-15 12:48:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:08,611 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2022-04-15 12:48:08,611 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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-15 12:48:08,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 67 transitions. [2022-04-15 12:48:08,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-15 12:48:08,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 12:48:08,865 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:08,865 INFO L499 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:08,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 12:48:09,079 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-15 12:48:09,079 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:09,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:09,080 INFO L85 PathProgramCache]: Analyzing trace with hash 48905618, now seen corresponding path program 49 times [2022-04-15 12:48:09,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:09,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [200391380] [2022-04-15 12:48:09,248 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:48:09,250 INFO L85 PathProgramCache]: Analyzing trace with hash 174458097, now seen corresponding path program 1 times [2022-04-15 12:48:09,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:09,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192268655] [2022-04-15 12:48:09,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:09,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:48:09,257 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:48:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:48:09,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:48:09,262 INFO L85 PathProgramCache]: Analyzing trace with hash 48905618, now seen corresponding path program 50 times [2022-04-15 12:48:09,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:09,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558672512] [2022-04-15 12:48:09,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:09,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:09,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:09,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {13683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13652#true} is VALID [2022-04-15 12:48:09,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {13652#true} assume true; {13652#true} is VALID [2022-04-15 12:48:09,817 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13652#true} {13652#true} #40#return; {13652#true} is VALID [2022-04-15 12:48:09,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {13652#true} call ULTIMATE.init(); {13683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:09,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {13683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13652#true} is VALID [2022-04-15 12:48:09,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {13652#true} assume true; {13652#true} is VALID [2022-04-15 12:48:09,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13652#true} {13652#true} #40#return; {13652#true} is VALID [2022-04-15 12:48:09,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {13652#true} call #t~ret5 := main(); {13652#true} is VALID [2022-04-15 12:48:09,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {13652#true} ~x~0 := 0; {13657#(= main_~x~0 0)} is VALID [2022-04-15 12:48:09,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {13657#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {13657#(= main_~x~0 0)} is VALID [2022-04-15 12:48:09,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {13657#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13658#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:09,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {13658#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {13658#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:09,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {13658#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13659#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:09,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {13659#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {13659#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:09,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {13659#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13660#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:09,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {13660#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13660#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:09,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {13660#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13661#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:09,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {13661#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13661#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:09,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {13661#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13662#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:09,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {13662#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {13662#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:09,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {13662#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13663#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:09,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {13663#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {13663#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:09,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {13663#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13664#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:09,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {13664#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13664#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:09,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {13664#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13665#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:09,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {13665#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13665#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:09,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {13665#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13666#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:09,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {13666#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13666#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:09,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {13666#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13667#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:09,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {13667#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13667#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:09,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {13667#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13668#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:09,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {13668#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13668#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:09,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {13668#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13669#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:09,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {13669#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13669#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:09,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {13669#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13670#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:09,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {13670#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13670#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:09,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {13670#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13671#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:09,882 INFO L290 TraceCheckUtils]: 34: Hoare triple {13671#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {13671#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:09,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {13671#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13672#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:09,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {13672#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {13672#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:09,890 INFO L290 TraceCheckUtils]: 37: Hoare triple {13672#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13673#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:09,890 INFO L290 TraceCheckUtils]: 38: Hoare triple {13673#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13673#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:09,893 INFO L290 TraceCheckUtils]: 39: Hoare triple {13673#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13674#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:09,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {13674#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {13674#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:09,897 INFO L290 TraceCheckUtils]: 41: Hoare triple {13674#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13675#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:09,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {13675#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13675#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:09,900 INFO L290 TraceCheckUtils]: 43: Hoare triple {13675#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13676#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:09,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {13676#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {13676#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:09,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {13676#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13677#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:09,904 INFO L290 TraceCheckUtils]: 46: Hoare triple {13677#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13677#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:09,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {13677#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13678#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:09,909 INFO L290 TraceCheckUtils]: 48: Hoare triple {13678#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {13678#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:09,912 INFO L290 TraceCheckUtils]: 49: Hoare triple {13678#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13679#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:09,913 INFO L290 TraceCheckUtils]: 50: Hoare triple {13679#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {13679#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:09,916 INFO L290 TraceCheckUtils]: 51: Hoare triple {13679#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13680#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:09,917 INFO L290 TraceCheckUtils]: 52: Hoare triple {13680#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {13680#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:09,922 INFO L290 TraceCheckUtils]: 53: Hoare triple {13680#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13681#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:09,922 INFO L290 TraceCheckUtils]: 54: Hoare triple {13681#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13681#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:09,924 INFO L290 TraceCheckUtils]: 55: Hoare triple {13681#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13682#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} is VALID [2022-04-15 12:48:09,925 INFO L290 TraceCheckUtils]: 56: Hoare triple {13682#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} assume !!(~x~0 % 4294967296 < 100000000); {13682#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} is VALID [2022-04-15 12:48:09,926 INFO L290 TraceCheckUtils]: 57: Hoare triple {13682#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {13653#false} is VALID [2022-04-15 12:48:09,926 INFO L290 TraceCheckUtils]: 58: Hoare triple {13653#false} assume !(~x~0 % 4294967296 < 100000000); {13653#false} is VALID [2022-04-15 12:48:09,926 INFO L272 TraceCheckUtils]: 59: Hoare triple {13653#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {13653#false} is VALID [2022-04-15 12:48:09,926 INFO L290 TraceCheckUtils]: 60: Hoare triple {13653#false} ~cond := #in~cond; {13653#false} is VALID [2022-04-15 12:48:09,926 INFO L290 TraceCheckUtils]: 61: Hoare triple {13653#false} assume 0 == ~cond; {13653#false} is VALID [2022-04-15 12:48:09,926 INFO L290 TraceCheckUtils]: 62: Hoare triple {13653#false} assume !false; {13653#false} is VALID [2022-04-15 12:48:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 26 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:09,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558672512] [2022-04-15 12:48:09,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558672512] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:09,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856342863] [2022-04-15 12:48:09,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:48:09,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:09,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:09,931 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:09,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 12:48:10,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:48:10,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:48:10,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-15 12:48:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:10,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:10,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {13652#true} call ULTIMATE.init(); {13652#true} is VALID [2022-04-15 12:48:10,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {13652#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13652#true} is VALID [2022-04-15 12:48:10,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {13652#true} assume true; {13652#true} is VALID [2022-04-15 12:48:10,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13652#true} {13652#true} #40#return; {13652#true} is VALID [2022-04-15 12:48:10,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {13652#true} call #t~ret5 := main(); {13652#true} is VALID [2022-04-15 12:48:10,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {13652#true} ~x~0 := 0; {13657#(= main_~x~0 0)} is VALID [2022-04-15 12:48:10,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {13657#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {13657#(= main_~x~0 0)} is VALID [2022-04-15 12:48:10,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {13657#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13658#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:10,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {13658#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {13658#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:10,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {13658#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13659#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:10,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {13659#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {13659#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:10,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {13659#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13660#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:10,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {13660#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13660#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:10,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {13660#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13661#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:10,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {13661#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13661#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:10,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {13661#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13662#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:10,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {13662#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {13662#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:10,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {13662#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13663#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:10,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {13663#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {13663#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:10,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {13663#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13664#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:10,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {13664#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13664#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:10,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {13664#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13665#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:10,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {13665#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13665#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:10,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {13665#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13666#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:10,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {13666#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13666#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:10,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {13666#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13667#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:10,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {13667#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13667#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:10,576 INFO L290 TraceCheckUtils]: 27: Hoare triple {13667#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13668#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:10,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {13668#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13668#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:10,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {13668#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13669#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:10,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {13669#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13669#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:10,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {13669#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13670#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:10,583 INFO L290 TraceCheckUtils]: 32: Hoare triple {13670#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13670#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:10,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {13670#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13671#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:10,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {13671#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {13671#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:10,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {13671#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13672#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:10,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {13672#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {13672#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:10,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {13672#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13673#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:10,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {13673#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13673#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:10,596 INFO L290 TraceCheckUtils]: 39: Hoare triple {13673#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13674#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:10,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {13674#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {13674#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:10,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {13674#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13675#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:10,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {13675#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13675#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:10,603 INFO L290 TraceCheckUtils]: 43: Hoare triple {13675#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13676#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:10,603 INFO L290 TraceCheckUtils]: 44: Hoare triple {13676#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {13676#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:10,607 INFO L290 TraceCheckUtils]: 45: Hoare triple {13676#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13677#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:10,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {13677#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13677#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:10,610 INFO L290 TraceCheckUtils]: 47: Hoare triple {13677#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13678#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:10,611 INFO L290 TraceCheckUtils]: 48: Hoare triple {13678#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {13678#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:10,614 INFO L290 TraceCheckUtils]: 49: Hoare triple {13678#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13679#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:10,615 INFO L290 TraceCheckUtils]: 50: Hoare triple {13679#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {13679#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:10,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {13679#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13680#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:10,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {13680#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {13680#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:10,621 INFO L290 TraceCheckUtils]: 53: Hoare triple {13680#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13681#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:10,622 INFO L290 TraceCheckUtils]: 54: Hoare triple {13681#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13681#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:10,625 INFO L290 TraceCheckUtils]: 55: Hoare triple {13681#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13852#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:10,625 INFO L290 TraceCheckUtils]: 56: Hoare triple {13852#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13852#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:10,628 INFO L290 TraceCheckUtils]: 57: Hoare triple {13852#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {13653#false} is VALID [2022-04-15 12:48:10,628 INFO L290 TraceCheckUtils]: 58: Hoare triple {13653#false} assume !(~x~0 % 4294967296 < 100000000); {13653#false} is VALID [2022-04-15 12:48:10,628 INFO L272 TraceCheckUtils]: 59: Hoare triple {13653#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {13653#false} is VALID [2022-04-15 12:48:10,628 INFO L290 TraceCheckUtils]: 60: Hoare triple {13653#false} ~cond := #in~cond; {13653#false} is VALID [2022-04-15 12:48:10,628 INFO L290 TraceCheckUtils]: 61: Hoare triple {13653#false} assume 0 == ~cond; {13653#false} is VALID [2022-04-15 12:48:10,628 INFO L290 TraceCheckUtils]: 62: Hoare triple {13653#false} assume !false; {13653#false} is VALID [2022-04-15 12:48:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 26 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:10,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:14,748 INFO L290 TraceCheckUtils]: 62: Hoare triple {13653#false} assume !false; {13653#false} is VALID [2022-04-15 12:48:14,748 INFO L290 TraceCheckUtils]: 61: Hoare triple {13653#false} assume 0 == ~cond; {13653#false} is VALID [2022-04-15 12:48:14,748 INFO L290 TraceCheckUtils]: 60: Hoare triple {13653#false} ~cond := #in~cond; {13653#false} is VALID [2022-04-15 12:48:14,748 INFO L272 TraceCheckUtils]: 59: Hoare triple {13653#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {13653#false} is VALID [2022-04-15 12:48:14,748 INFO L290 TraceCheckUtils]: 58: Hoare triple {13653#false} assume !(~x~0 % 4294967296 < 100000000); {13653#false} is VALID [2022-04-15 12:48:14,749 INFO L290 TraceCheckUtils]: 57: Hoare triple {13889#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {13653#false} is VALID [2022-04-15 12:48:14,749 INFO L290 TraceCheckUtils]: 56: Hoare triple {13893#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {13889#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:48:14,752 INFO L290 TraceCheckUtils]: 55: Hoare triple {13897#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13893#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,753 INFO L290 TraceCheckUtils]: 54: Hoare triple {13897#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {13897#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,756 INFO L290 TraceCheckUtils]: 53: Hoare triple {13904#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13897#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,756 INFO L290 TraceCheckUtils]: 52: Hoare triple {13904#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {13904#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,760 INFO L290 TraceCheckUtils]: 51: Hoare triple {13911#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13904#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,760 INFO L290 TraceCheckUtils]: 50: Hoare triple {13911#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {13911#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:48:14,763 INFO L290 TraceCheckUtils]: 49: Hoare triple {13918#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13911#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:48:14,764 INFO L290 TraceCheckUtils]: 48: Hoare triple {13918#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {13918#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,765 INFO L290 TraceCheckUtils]: 47: Hoare triple {13925#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13918#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,765 INFO L290 TraceCheckUtils]: 46: Hoare triple {13925#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {13925#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:48:14,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {13932#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13925#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:48:14,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {13932#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {13932#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:48:14,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {13939#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13932#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:48:14,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {13939#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {13939#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:48:14,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {13946#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13939#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:48:14,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {13946#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {13946#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:48:14,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {13953#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13946#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:48:14,775 INFO L290 TraceCheckUtils]: 38: Hoare triple {13953#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {13953#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {13960#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13953#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {13960#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {13960#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {13967#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13960#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {13967#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {13967#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:48:14,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {13974#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13967#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:48:14,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {13974#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {13974#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:48:14,783 INFO L290 TraceCheckUtils]: 31: Hoare triple {13981#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13974#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:48:14,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {13981#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {13981#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {13988#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13981#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,786 INFO L290 TraceCheckUtils]: 28: Hoare triple {13988#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {13988#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {13995#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13988#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {13995#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {13995#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {14002#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13995#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {14002#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {14002#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {14009#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14002#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {14009#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {14009#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {14016#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14009#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {14016#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {14016#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {14023#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14016#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {14023#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {14023#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {14030#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14023#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {14030#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {14030#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {14037#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14030#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {14037#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {14037#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {14044#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14037#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {14044#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {14044#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {14051#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14044#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {14051#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {14051#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {14058#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14051#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {14058#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {14058#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {14065#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14058#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 12:48:14,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {14065#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {14065#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 12:48:14,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {13652#true} ~x~0 := 0; {14065#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 12:48:14,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {13652#true} call #t~ret5 := main(); {13652#true} is VALID [2022-04-15 12:48:14,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13652#true} {13652#true} #40#return; {13652#true} is VALID [2022-04-15 12:48:14,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {13652#true} assume true; {13652#true} is VALID [2022-04-15 12:48:14,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {13652#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13652#true} is VALID [2022-04-15 12:48:14,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {13652#true} call ULTIMATE.init(); {13652#true} is VALID [2022-04-15 12:48:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 26 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:14,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856342863] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:14,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:14,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 29] total 57 [2022-04-15 12:48:14,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:14,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [200391380] [2022-04-15 12:48:14,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [200391380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:14,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:14,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 12:48:14,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711328870] [2022-04-15 12:48:14,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:14,809 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 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 63 [2022-04-15 12:48:14,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:14,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 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-15 12:48:15,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:15,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 12:48:15,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:15,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 12:48:15,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=867, Invalid=2325, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 12:48:15,050 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 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-15 12:48:23,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:23,441 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2022-04-15 12:48:23,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:48:23,441 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 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 63 [2022-04-15 12:48:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 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-15 12:48:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 75 transitions. [2022-04-15 12:48:23,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 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-15 12:48:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 75 transitions. [2022-04-15 12:48:23,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 75 transitions. [2022-04-15 12:48:23,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:23,736 INFO L225 Difference]: With dead ends: 74 [2022-04-15 12:48:23,736 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 12:48:23,737 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1723, Invalid=5083, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 12:48:23,738 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:23,738 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 54 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 12:48:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 12:48:23,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-15 12:48:23,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:23,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 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-15 12:48:23,885 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 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-15 12:48:23,885 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 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-15 12:48:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:23,886 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2022-04-15 12:48:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-15 12:48:23,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:23,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:23,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 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 67 states. [2022-04-15 12:48:23,887 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 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 67 states. [2022-04-15 12:48:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:23,888 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2022-04-15 12:48:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-15 12:48:23,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:23,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:23,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:23,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:23,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 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-15 12:48:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2022-04-15 12:48:23,889 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 63 [2022-04-15 12:48:23,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:23,890 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2022-04-15 12:48:23,890 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 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-15 12:48:23,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 69 transitions. [2022-04-15 12:48:24,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:24,226 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-15 12:48:24,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 12:48:24,226 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:24,226 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:24,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-15 12:48:24,426 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52 [2022-04-15 12:48:24,427 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:24,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:24,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1695595695, now seen corresponding path program 51 times [2022-04-15 12:48:24,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:24,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1912077800] [2022-04-15 12:48:24,592 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:48:24,594 INFO L85 PathProgramCache]: Analyzing trace with hash 233563441, now seen corresponding path program 1 times [2022-04-15 12:48:24,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:24,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566401307] [2022-04-15 12:48:24,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:24,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:48:24,600 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:48:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:48:24,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:48:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1695595695, now seen corresponding path program 52 times [2022-04-15 12:48:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:24,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242016140] [2022-04-15 12:48:24,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:24,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:25,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:25,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {14589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14557#true} is VALID [2022-04-15 12:48:25,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {14557#true} assume true; {14557#true} is VALID [2022-04-15 12:48:25,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14557#true} {14557#true} #40#return; {14557#true} is VALID [2022-04-15 12:48:25,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {14557#true} call ULTIMATE.init(); {14589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:25,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {14589#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14557#true} is VALID [2022-04-15 12:48:25,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {14557#true} assume true; {14557#true} is VALID [2022-04-15 12:48:25,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14557#true} {14557#true} #40#return; {14557#true} is VALID [2022-04-15 12:48:25,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {14557#true} call #t~ret5 := main(); {14557#true} is VALID [2022-04-15 12:48:25,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {14557#true} ~x~0 := 0; {14562#(= main_~x~0 0)} is VALID [2022-04-15 12:48:25,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {14562#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {14562#(= main_~x~0 0)} is VALID [2022-04-15 12:48:25,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {14562#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14563#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:25,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {14563#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {14563#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:25,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {14563#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14564#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:25,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {14564#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {14564#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:25,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {14564#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14565#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:25,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {14565#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14565#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:25,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {14565#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14566#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:25,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {14566#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14566#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:25,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {14566#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14567#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:25,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {14567#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {14567#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:25,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {14567#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:25,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {14568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {14568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:25,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {14568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14569#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:25,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {14569#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14569#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:25,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {14569#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14570#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:25,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {14570#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14570#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:25,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {14570#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14571#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:25,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {14571#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14571#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:25,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {14571#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14572#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:25,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {14572#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14572#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:25,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {14572#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14573#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:25,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {14573#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14573#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:25,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {14573#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14574#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:25,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {14574#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14574#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:25,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {14574#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14575#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:25,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {14575#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14575#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:25,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {14575#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14576#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:25,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {14576#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {14576#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:25,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {14576#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14577#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:25,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {14577#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {14577#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:25,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {14577#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14578#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:25,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {14578#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14578#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:25,254 INFO L290 TraceCheckUtils]: 39: Hoare triple {14578#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14579#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:25,254 INFO L290 TraceCheckUtils]: 40: Hoare triple {14579#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {14579#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:25,258 INFO L290 TraceCheckUtils]: 41: Hoare triple {14579#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14580#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:25,258 INFO L290 TraceCheckUtils]: 42: Hoare triple {14580#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14580#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:25,269 INFO L290 TraceCheckUtils]: 43: Hoare triple {14580#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14581#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:25,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {14581#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {14581#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:25,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {14581#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14582#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:25,277 INFO L290 TraceCheckUtils]: 46: Hoare triple {14582#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14582#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:25,284 INFO L290 TraceCheckUtils]: 47: Hoare triple {14582#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14583#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:25,284 INFO L290 TraceCheckUtils]: 48: Hoare triple {14583#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {14583#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:25,290 INFO L290 TraceCheckUtils]: 49: Hoare triple {14583#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14584#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:25,291 INFO L290 TraceCheckUtils]: 50: Hoare triple {14584#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {14584#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:25,295 INFO L290 TraceCheckUtils]: 51: Hoare triple {14584#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14585#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:25,296 INFO L290 TraceCheckUtils]: 52: Hoare triple {14585#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {14585#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:25,300 INFO L290 TraceCheckUtils]: 53: Hoare triple {14585#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14586#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:25,300 INFO L290 TraceCheckUtils]: 54: Hoare triple {14586#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14586#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:25,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {14586#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14587#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:25,304 INFO L290 TraceCheckUtils]: 56: Hoare triple {14587#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14587#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:25,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {14587#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14588#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-15 12:48:25,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {14588#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 100000000); {14588#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-15 12:48:25,306 INFO L290 TraceCheckUtils]: 59: Hoare triple {14588#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {14558#false} is VALID [2022-04-15 12:48:25,306 INFO L290 TraceCheckUtils]: 60: Hoare triple {14558#false} assume !(~x~0 % 4294967296 < 100000000); {14558#false} is VALID [2022-04-15 12:48:25,306 INFO L272 TraceCheckUtils]: 61: Hoare triple {14558#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {14558#false} is VALID [2022-04-15 12:48:25,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {14558#false} ~cond := #in~cond; {14558#false} is VALID [2022-04-15 12:48:25,307 INFO L290 TraceCheckUtils]: 63: Hoare triple {14558#false} assume 0 == ~cond; {14558#false} is VALID [2022-04-15 12:48:25,307 INFO L290 TraceCheckUtils]: 64: Hoare triple {14558#false} assume !false; {14558#false} is VALID [2022-04-15 12:48:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 27 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:25,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:25,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242016140] [2022-04-15 12:48:25,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242016140] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:25,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534927687] [2022-04-15 12:48:25,308 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:48:25,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:25,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:25,308 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:25,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 12:48:25,388 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:48:25,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:48:25,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 12:48:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:25,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:25,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {14557#true} call ULTIMATE.init(); {14557#true} is VALID [2022-04-15 12:48:25,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {14557#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14557#true} is VALID [2022-04-15 12:48:25,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {14557#true} assume true; {14557#true} is VALID [2022-04-15 12:48:25,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14557#true} {14557#true} #40#return; {14557#true} is VALID [2022-04-15 12:48:25,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {14557#true} call #t~ret5 := main(); {14557#true} is VALID [2022-04-15 12:48:25,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {14557#true} ~x~0 := 0; {14562#(= main_~x~0 0)} is VALID [2022-04-15 12:48:25,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {14562#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {14562#(= main_~x~0 0)} is VALID [2022-04-15 12:48:25,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {14562#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14563#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:25,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {14563#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {14563#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:25,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {14563#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14564#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:25,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {14564#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {14564#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:25,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {14564#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14565#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:25,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {14565#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14565#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:25,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {14565#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14566#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:25,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {14566#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14566#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:25,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {14566#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14567#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:25,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {14567#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {14567#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:25,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {14567#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:25,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {14568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {14568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:25,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {14568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14569#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:25,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {14569#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14569#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:25,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {14569#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14570#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:25,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {14570#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14570#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:25,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {14570#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14571#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:25,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {14571#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14571#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:25,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {14571#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14572#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:25,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {14572#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14572#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:26,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {14572#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14573#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:26,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {14573#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14573#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:26,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {14573#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14574#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:26,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {14574#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14574#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:26,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {14574#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14575#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:26,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {14575#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14575#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:26,016 INFO L290 TraceCheckUtils]: 33: Hoare triple {14575#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14576#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:26,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {14576#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {14576#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:26,021 INFO L290 TraceCheckUtils]: 35: Hoare triple {14576#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14577#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:26,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {14577#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {14577#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:26,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {14577#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14578#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:26,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {14578#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14578#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:26,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {14578#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14579#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:26,033 INFO L290 TraceCheckUtils]: 40: Hoare triple {14579#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {14579#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:26,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {14579#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14580#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:26,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {14580#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14580#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:26,041 INFO L290 TraceCheckUtils]: 43: Hoare triple {14580#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14581#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:26,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {14581#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {14581#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:26,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {14581#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14582#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:26,046 INFO L290 TraceCheckUtils]: 46: Hoare triple {14582#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14582#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:26,051 INFO L290 TraceCheckUtils]: 47: Hoare triple {14582#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14583#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:26,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {14583#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {14583#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:26,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {14583#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14584#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:26,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {14584#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {14584#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:26,059 INFO L290 TraceCheckUtils]: 51: Hoare triple {14584#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14585#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:26,060 INFO L290 TraceCheckUtils]: 52: Hoare triple {14585#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {14585#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:26,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {14585#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14586#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:26,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {14586#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14586#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:26,068 INFO L290 TraceCheckUtils]: 55: Hoare triple {14586#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14587#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:26,068 INFO L290 TraceCheckUtils]: 56: Hoare triple {14587#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14587#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:26,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {14587#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14764#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:48:26,073 INFO L290 TraceCheckUtils]: 58: Hoare triple {14764#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14764#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:48:26,077 INFO L290 TraceCheckUtils]: 59: Hoare triple {14764#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {14771#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:48:26,079 INFO L290 TraceCheckUtils]: 60: Hoare triple {14771#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 100000000); {14558#false} is VALID [2022-04-15 12:48:26,079 INFO L272 TraceCheckUtils]: 61: Hoare triple {14558#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {14558#false} is VALID [2022-04-15 12:48:26,080 INFO L290 TraceCheckUtils]: 62: Hoare triple {14558#false} ~cond := #in~cond; {14558#false} is VALID [2022-04-15 12:48:26,080 INFO L290 TraceCheckUtils]: 63: Hoare triple {14558#false} assume 0 == ~cond; {14558#false} is VALID [2022-04-15 12:48:26,080 INFO L290 TraceCheckUtils]: 64: Hoare triple {14558#false} assume !false; {14558#false} is VALID [2022-04-15 12:48:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:26,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:29,563 INFO L290 TraceCheckUtils]: 64: Hoare triple {14558#false} assume !false; {14558#false} is VALID [2022-04-15 12:48:29,564 INFO L290 TraceCheckUtils]: 63: Hoare triple {14558#false} assume 0 == ~cond; {14558#false} is VALID [2022-04-15 12:48:29,564 INFO L290 TraceCheckUtils]: 62: Hoare triple {14558#false} ~cond := #in~cond; {14558#false} is VALID [2022-04-15 12:48:29,564 INFO L272 TraceCheckUtils]: 61: Hoare triple {14558#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {14558#false} is VALID [2022-04-15 12:48:29,564 INFO L290 TraceCheckUtils]: 60: Hoare triple {14799#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {14558#false} is VALID [2022-04-15 12:48:29,567 INFO L290 TraceCheckUtils]: 59: Hoare triple {14803#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {14799#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,568 INFO L290 TraceCheckUtils]: 58: Hoare triple {14803#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14803#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {14810#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14803#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,572 INFO L290 TraceCheckUtils]: 56: Hoare triple {14810#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14810#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,574 INFO L290 TraceCheckUtils]: 55: Hoare triple {14817#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14810#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,575 INFO L290 TraceCheckUtils]: 54: Hoare triple {14817#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14817#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,577 INFO L290 TraceCheckUtils]: 53: Hoare triple {14824#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14817#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,577 INFO L290 TraceCheckUtils]: 52: Hoare triple {14824#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14824#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,579 INFO L290 TraceCheckUtils]: 51: Hoare triple {14831#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14824#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,579 INFO L290 TraceCheckUtils]: 50: Hoare triple {14831#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14831#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,582 INFO L290 TraceCheckUtils]: 49: Hoare triple {14838#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14831#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,582 INFO L290 TraceCheckUtils]: 48: Hoare triple {14838#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14838#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,584 INFO L290 TraceCheckUtils]: 47: Hoare triple {14845#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14838#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,584 INFO L290 TraceCheckUtils]: 46: Hoare triple {14845#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14845#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,586 INFO L290 TraceCheckUtils]: 45: Hoare triple {14852#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14845#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,586 INFO L290 TraceCheckUtils]: 44: Hoare triple {14852#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14852#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,589 INFO L290 TraceCheckUtils]: 43: Hoare triple {14859#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14852#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {14859#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14859#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,591 INFO L290 TraceCheckUtils]: 41: Hoare triple {14866#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14859#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {14866#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14866#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,607 INFO L290 TraceCheckUtils]: 39: Hoare triple {14873#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14866#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,607 INFO L290 TraceCheckUtils]: 38: Hoare triple {14873#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14873#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {14880#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14873#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {14880#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14880#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {14887#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14880#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {14887#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14887#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {14894#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14887#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {14894#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14894#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {14901#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14894#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {14901#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14901#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {14908#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14901#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {14908#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14908#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {14915#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14908#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {14915#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14915#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {14922#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14915#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {14922#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14922#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {14929#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14922#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {14929#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14929#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {14936#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14929#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {14936#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14936#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {14943#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14936#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {14943#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14943#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {14950#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14943#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {14950#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14950#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {14957#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14950#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {14957#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14957#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {14964#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14957#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {14964#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14964#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {14971#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14964#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {14971#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14971#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {14978#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14971#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {14978#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14978#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {14985#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14978#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {14985#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14985#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {14557#true} ~x~0 := 0; {14985#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {14557#true} call #t~ret5 := main(); {14557#true} is VALID [2022-04-15 12:48:29,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14557#true} {14557#true} #40#return; {14557#true} is VALID [2022-04-15 12:48:29,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {14557#true} assume true; {14557#true} is VALID [2022-04-15 12:48:29,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {14557#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14557#true} is VALID [2022-04-15 12:48:29,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {14557#true} call ULTIMATE.init(); {14557#true} is VALID [2022-04-15 12:48:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:29,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534927687] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:29,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:29,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2022-04-15 12:48:29,656 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:29,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1912077800] [2022-04-15 12:48:29,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1912077800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:29,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:29,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:48:29,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363724214] [2022-04-15 12:48:29,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:29,657 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 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 65 [2022-04-15 12:48:29,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:29,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 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-15 12:48:29,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:29,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:48:29,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:29,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:48:29,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=956, Invalid=2584, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 12:48:29,921 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 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-15 12:48:39,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:39,654 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-15 12:48:39,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 12:48:39,654 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 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 65 [2022-04-15 12:48:39,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 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-15 12:48:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 77 transitions. [2022-04-15 12:48:39,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 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-15 12:48:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 77 transitions. [2022-04-15 12:48:39,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 77 transitions. [2022-04-15 12:48:40,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:40,190 INFO L225 Difference]: With dead ends: 76 [2022-04-15 12:48:40,190 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 12:48:40,191 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1872, Invalid=5610, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 12:48:40,191 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:40,191 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 104 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 12:48:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 12:48:40,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-15 12:48:40,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:40,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 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-15 12:48:40,341 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 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-15 12:48:40,341 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 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-15 12:48:40,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:40,352 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2022-04-15 12:48:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-15 12:48:40,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:40,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:40,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 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 69 states. [2022-04-15 12:48:40,353 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 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 69 states. [2022-04-15 12:48:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:40,355 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2022-04-15 12:48:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-15 12:48:40,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:40,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:40,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:40,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 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-15 12:48:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2022-04-15 12:48:40,357 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 65 [2022-04-15 12:48:40,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:40,357 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2022-04-15 12:48:40,357 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 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-15 12:48:40,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 71 transitions. [2022-04-15 12:48:40,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-15 12:48:40,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 12:48:40,837 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:40,837 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:40,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-15 12:48:41,037 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54 [2022-04-15 12:48:41,038 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:41,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:41,038 INFO L85 PathProgramCache]: Analyzing trace with hash -678172532, now seen corresponding path program 53 times [2022-04-15 12:48:41,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:41,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1782830871] [2022-04-15 12:48:41,192 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:48:41,194 INFO L85 PathProgramCache]: Analyzing trace with hash 292668785, now seen corresponding path program 1 times [2022-04-15 12:48:41,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:41,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736915661] [2022-04-15 12:48:41,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:41,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:48:41,201 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:48:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:48:41,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:48:41,206 INFO L85 PathProgramCache]: Analyzing trace with hash -678172532, now seen corresponding path program 54 times [2022-04-15 12:48:41,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:41,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133118113] [2022-04-15 12:48:41,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:41,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:41,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:41,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {15524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15491#true} is VALID [2022-04-15 12:48:41,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {15491#true} assume true; {15491#true} is VALID [2022-04-15 12:48:41,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15491#true} {15491#true} #40#return; {15491#true} is VALID [2022-04-15 12:48:41,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {15491#true} call ULTIMATE.init(); {15524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:41,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {15524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15491#true} is VALID [2022-04-15 12:48:41,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {15491#true} assume true; {15491#true} is VALID [2022-04-15 12:48:41,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15491#true} {15491#true} #40#return; {15491#true} is VALID [2022-04-15 12:48:41,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {15491#true} call #t~ret5 := main(); {15491#true} is VALID [2022-04-15 12:48:41,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {15491#true} ~x~0 := 0; {15496#(= main_~x~0 0)} is VALID [2022-04-15 12:48:41,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {15496#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {15496#(= main_~x~0 0)} is VALID [2022-04-15 12:48:41,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {15496#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15497#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:41,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {15497#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {15497#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:41,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {15497#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15498#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:41,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {15498#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {15498#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:41,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {15498#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:41,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {15499#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15499#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:41,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {15499#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15500#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:41,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {15500#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15500#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:41,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {15500#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15501#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:41,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {15501#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {15501#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:41,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {15501#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15502#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:41,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {15502#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {15502#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:41,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {15502#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15503#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:41,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {15503#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15503#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:41,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {15503#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15504#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:41,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {15504#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15504#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:41,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {15504#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15505#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:41,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {15505#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15505#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:41,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {15505#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15506#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:41,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {15506#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15506#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:41,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {15506#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15507#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:41,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {15507#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15507#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:41,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {15507#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15508#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:41,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {15508#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15508#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:42,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {15508#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15509#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:42,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {15509#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15509#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:42,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {15509#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15510#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:42,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {15510#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {15510#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:42,021 INFO L290 TraceCheckUtils]: 35: Hoare triple {15510#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15511#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:42,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {15511#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {15511#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:42,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {15511#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15512#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:42,028 INFO L290 TraceCheckUtils]: 38: Hoare triple {15512#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15512#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:42,034 INFO L290 TraceCheckUtils]: 39: Hoare triple {15512#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15513#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:42,034 INFO L290 TraceCheckUtils]: 40: Hoare triple {15513#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {15513#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:42,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {15513#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:42,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {15514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:42,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {15514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15515#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:42,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {15515#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {15515#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:42,048 INFO L290 TraceCheckUtils]: 45: Hoare triple {15515#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15516#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:42,049 INFO L290 TraceCheckUtils]: 46: Hoare triple {15516#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15516#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:42,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {15516#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15517#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:42,058 INFO L290 TraceCheckUtils]: 48: Hoare triple {15517#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {15517#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:42,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {15517#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15518#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:42,068 INFO L290 TraceCheckUtils]: 50: Hoare triple {15518#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {15518#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:42,077 INFO L290 TraceCheckUtils]: 51: Hoare triple {15518#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15519#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:42,078 INFO L290 TraceCheckUtils]: 52: Hoare triple {15519#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {15519#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:42,088 INFO L290 TraceCheckUtils]: 53: Hoare triple {15519#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15520#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:42,089 INFO L290 TraceCheckUtils]: 54: Hoare triple {15520#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15520#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:42,100 INFO L290 TraceCheckUtils]: 55: Hoare triple {15520#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15521#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:42,101 INFO L290 TraceCheckUtils]: 56: Hoare triple {15521#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15521#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:42,111 INFO L290 TraceCheckUtils]: 57: Hoare triple {15521#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15522#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:48:42,112 INFO L290 TraceCheckUtils]: 58: Hoare triple {15522#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15522#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:48:42,116 INFO L290 TraceCheckUtils]: 59: Hoare triple {15522#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15523#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 27))} is VALID [2022-04-15 12:48:42,116 INFO L290 TraceCheckUtils]: 60: Hoare triple {15523#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {15523#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 27))} is VALID [2022-04-15 12:48:42,117 INFO L290 TraceCheckUtils]: 61: Hoare triple {15523#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 27))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {15492#false} is VALID [2022-04-15 12:48:42,117 INFO L290 TraceCheckUtils]: 62: Hoare triple {15492#false} assume !(~x~0 % 4294967296 < 100000000); {15492#false} is VALID [2022-04-15 12:48:42,117 INFO L272 TraceCheckUtils]: 63: Hoare triple {15492#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {15492#false} is VALID [2022-04-15 12:48:42,117 INFO L290 TraceCheckUtils]: 64: Hoare triple {15492#false} ~cond := #in~cond; {15492#false} is VALID [2022-04-15 12:48:42,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {15492#false} assume 0 == ~cond; {15492#false} is VALID [2022-04-15 12:48:42,117 INFO L290 TraceCheckUtils]: 66: Hoare triple {15492#false} assume !false; {15492#false} is VALID [2022-04-15 12:48:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 28 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:42,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:42,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133118113] [2022-04-15 12:48:42,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133118113] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:42,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395148742] [2022-04-15 12:48:42,119 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:48:42,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:42,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:42,120 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:42,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 12:48:42,168 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:48:42,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:48:42,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 12:48:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:42,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:42,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {15491#true} call ULTIMATE.init(); {15491#true} is VALID [2022-04-15 12:48:42,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {15491#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15491#true} is VALID [2022-04-15 12:48:42,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {15491#true} assume true; {15491#true} is VALID [2022-04-15 12:48:42,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15491#true} {15491#true} #40#return; {15491#true} is VALID [2022-04-15 12:48:42,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {15491#true} call #t~ret5 := main(); {15491#true} is VALID [2022-04-15 12:48:42,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {15491#true} ~x~0 := 0; {15491#true} is VALID [2022-04-15 12:48:42,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,464 INFO L290 TraceCheckUtils]: 33: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,464 INFO L290 TraceCheckUtils]: 34: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,465 INFO L290 TraceCheckUtils]: 36: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,465 INFO L290 TraceCheckUtils]: 37: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,465 INFO L290 TraceCheckUtils]: 38: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,465 INFO L290 TraceCheckUtils]: 39: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,465 INFO L290 TraceCheckUtils]: 40: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,465 INFO L290 TraceCheckUtils]: 41: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,465 INFO L290 TraceCheckUtils]: 44: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,465 INFO L290 TraceCheckUtils]: 48: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,465 INFO L290 TraceCheckUtils]: 49: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,465 INFO L290 TraceCheckUtils]: 50: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,466 INFO L290 TraceCheckUtils]: 53: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,466 INFO L290 TraceCheckUtils]: 54: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,466 INFO L290 TraceCheckUtils]: 55: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,466 INFO L290 TraceCheckUtils]: 56: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,466 INFO L290 TraceCheckUtils]: 57: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:42,466 INFO L290 TraceCheckUtils]: 58: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:42,469 INFO L290 TraceCheckUtils]: 59: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15705#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:48:42,470 INFO L290 TraceCheckUtils]: 60: Hoare triple {15705#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {15705#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:48:42,472 INFO L290 TraceCheckUtils]: 61: Hoare triple {15705#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {15712#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2022-04-15 12:48:42,475 INFO L290 TraceCheckUtils]: 62: Hoare triple {15712#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 100000000); {15492#false} is VALID [2022-04-15 12:48:42,476 INFO L272 TraceCheckUtils]: 63: Hoare triple {15492#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {15492#false} is VALID [2022-04-15 12:48:42,476 INFO L290 TraceCheckUtils]: 64: Hoare triple {15492#false} ~cond := #in~cond; {15492#false} is VALID [2022-04-15 12:48:42,476 INFO L290 TraceCheckUtils]: 65: Hoare triple {15492#false} assume 0 == ~cond; {15492#false} is VALID [2022-04-15 12:48:42,476 INFO L290 TraceCheckUtils]: 66: Hoare triple {15492#false} assume !false; {15492#false} is VALID [2022-04-15 12:48:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2022-04-15 12:48:42,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:43,255 INFO L290 TraceCheckUtils]: 66: Hoare triple {15492#false} assume !false; {15492#false} is VALID [2022-04-15 12:48:43,255 INFO L290 TraceCheckUtils]: 65: Hoare triple {15731#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15492#false} is VALID [2022-04-15 12:48:43,255 INFO L290 TraceCheckUtils]: 64: Hoare triple {15735#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15731#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:48:43,256 INFO L272 TraceCheckUtils]: 63: Hoare triple {15739#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {15735#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:48:43,256 INFO L290 TraceCheckUtils]: 62: Hoare triple {15743#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {15739#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:48:43,266 INFO L290 TraceCheckUtils]: 61: Hoare triple {15747#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {15743#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:43,266 INFO L290 TraceCheckUtils]: 60: Hoare triple {15747#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {15747#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:48:43,270 INFO L290 TraceCheckUtils]: 59: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15747#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:48:43,270 INFO L290 TraceCheckUtils]: 58: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,270 INFO L290 TraceCheckUtils]: 57: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,270 INFO L290 TraceCheckUtils]: 56: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,270 INFO L290 TraceCheckUtils]: 55: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,270 INFO L290 TraceCheckUtils]: 54: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,270 INFO L290 TraceCheckUtils]: 53: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,270 INFO L290 TraceCheckUtils]: 52: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,271 INFO L290 TraceCheckUtils]: 51: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,271 INFO L290 TraceCheckUtils]: 50: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,271 INFO L290 TraceCheckUtils]: 49: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,271 INFO L290 TraceCheckUtils]: 48: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,271 INFO L290 TraceCheckUtils]: 47: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,271 INFO L290 TraceCheckUtils]: 46: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,271 INFO L290 TraceCheckUtils]: 45: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,272 INFO L290 TraceCheckUtils]: 37: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {15491#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15491#true} is VALID [2022-04-15 12:48:43,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {15491#true} assume !!(~x~0 % 4294967296 < 100000000); {15491#true} is VALID [2022-04-15 12:48:43,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {15491#true} ~x~0 := 0; {15491#true} is VALID [2022-04-15 12:48:43,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {15491#true} call #t~ret5 := main(); {15491#true} is VALID [2022-04-15 12:48:43,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15491#true} {15491#true} #40#return; {15491#true} is VALID [2022-04-15 12:48:43,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {15491#true} assume true; {15491#true} is VALID [2022-04-15 12:48:43,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {15491#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15491#true} is VALID [2022-04-15 12:48:43,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {15491#true} call ULTIMATE.init(); {15491#true} is VALID [2022-04-15 12:48:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2022-04-15 12:48:43,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395148742] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:43,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:43,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 4, 7] total 38 [2022-04-15 12:48:43,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:43,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1782830871] [2022-04-15 12:48:43,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1782830871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:43,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:43,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 12:48:43,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677573616] [2022-04-15 12:48:43,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:43,276 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 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 67 [2022-04-15 12:48:43,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:43,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 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-15 12:48:43,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:43,628 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 12:48:43,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:43,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 12:48:43,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1195, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:48:43,629 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 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-15 12:48:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:57,656 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-04-15 12:48:57,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:48:57,656 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 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 67 [2022-04-15 12:48:57,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 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-15 12:48:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 79 transitions. [2022-04-15 12:48:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 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-15 12:48:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 79 transitions. [2022-04-15 12:48:57,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 79 transitions. [2022-04-15 12:48:58,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:58,236 INFO L225 Difference]: With dead ends: 78 [2022-04-15 12:48:58,237 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 12:48:58,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=483, Invalid=3807, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 12:48:58,237 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:58,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 109 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-15 12:48:58,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 12:48:58,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-15 12:48:58,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:58,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 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-15 12:48:58,386 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 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-15 12:48:58,387 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 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-15 12:48:58,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:58,387 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-15 12:48:58,387 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-15 12:48:58,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:58,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:58,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 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 71 states. [2022-04-15 12:48:58,388 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 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 71 states. [2022-04-15 12:48:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:58,389 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-15 12:48:58,389 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-15 12:48:58,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:58,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:58,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:58,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:58,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 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-15 12:48:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2022-04-15 12:48:58,390 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 67 [2022-04-15 12:48:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:58,391 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2022-04-15 12:48:58,391 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 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-15 12:48:58,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 73 transitions. [2022-04-15 12:48:58,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:58,777 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-15 12:48:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 12:48:58,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:58,777 INFO L499 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:58,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 12:48:58,978 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-04-15 12:48:58,978 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1241804503, now seen corresponding path program 55 times [2022-04-15 12:48:58,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:58,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [519990611] [2022-04-15 12:48:59,156 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:48:59,157 INFO L85 PathProgramCache]: Analyzing trace with hash 351774129, now seen corresponding path program 1 times [2022-04-15 12:48:59,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:59,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464137335] [2022-04-15 12:48:59,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:59,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:48:59,165 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:48:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:48:59,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:48:59,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1241804503, now seen corresponding path program 56 times [2022-04-15 12:48:59,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:59,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574566249] [2022-04-15 12:48:59,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:59,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:59,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:59,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {16463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16429#true} is VALID [2022-04-15 12:48:59,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {16429#true} assume true; {16429#true} is VALID [2022-04-15 12:48:59,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16429#true} {16429#true} #40#return; {16429#true} is VALID [2022-04-15 12:48:59,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {16429#true} call ULTIMATE.init(); {16463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:59,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {16463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16429#true} is VALID [2022-04-15 12:48:59,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {16429#true} assume true; {16429#true} is VALID [2022-04-15 12:48:59,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16429#true} {16429#true} #40#return; {16429#true} is VALID [2022-04-15 12:48:59,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {16429#true} call #t~ret5 := main(); {16429#true} is VALID [2022-04-15 12:48:59,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {16429#true} ~x~0 := 0; {16434#(= main_~x~0 0)} is VALID [2022-04-15 12:48:59,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {16434#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {16434#(= main_~x~0 0)} is VALID [2022-04-15 12:48:59,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {16434#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16435#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:59,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {16435#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {16435#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:59,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {16435#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16436#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:59,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {16436#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {16436#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:59,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {16436#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16437#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:59,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {16437#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16437#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:59,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {16437#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16438#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:59,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {16438#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16438#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:59,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {16438#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16439#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:59,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {16439#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {16439#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:59,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {16439#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16440#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:59,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {16440#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {16440#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:59,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {16440#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16441#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:59,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {16441#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16441#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:59,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {16441#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16442#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:59,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {16442#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16442#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:59,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {16442#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16443#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:59,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {16443#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16443#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:59,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {16443#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16444#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:59,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {16444#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16444#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:59,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {16444#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16445#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:59,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {16445#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16445#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:59,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {16445#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16446#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:59,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {16446#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16446#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:59,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {16446#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16447#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:49:00,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {16447#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16447#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:49:00,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {16447#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:49:00,006 INFO L290 TraceCheckUtils]: 34: Hoare triple {16448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {16448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:49:00,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {16448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16449#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:49:00,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {16449#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {16449#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:49:00,020 INFO L290 TraceCheckUtils]: 37: Hoare triple {16449#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16450#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:49:00,021 INFO L290 TraceCheckUtils]: 38: Hoare triple {16450#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16450#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:49:00,029 INFO L290 TraceCheckUtils]: 39: Hoare triple {16450#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16451#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:49:00,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {16451#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {16451#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:49:00,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {16451#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16452#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:49:00,039 INFO L290 TraceCheckUtils]: 42: Hoare triple {16452#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16452#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:49:00,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {16452#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16453#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:49:00,047 INFO L290 TraceCheckUtils]: 44: Hoare triple {16453#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {16453#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:49:00,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {16453#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16454#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:49:00,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {16454#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16454#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:49:00,070 INFO L290 TraceCheckUtils]: 47: Hoare triple {16454#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16455#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:49:00,071 INFO L290 TraceCheckUtils]: 48: Hoare triple {16455#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {16455#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:49:00,082 INFO L290 TraceCheckUtils]: 49: Hoare triple {16455#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:49:00,083 INFO L290 TraceCheckUtils]: 50: Hoare triple {16456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {16456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:49:00,094 INFO L290 TraceCheckUtils]: 51: Hoare triple {16456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16457#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:49:00,095 INFO L290 TraceCheckUtils]: 52: Hoare triple {16457#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {16457#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:49:00,105 INFO L290 TraceCheckUtils]: 53: Hoare triple {16457#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16458#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:49:00,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {16458#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16458#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:49:00,114 INFO L290 TraceCheckUtils]: 55: Hoare triple {16458#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16459#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:49:00,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {16459#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16459#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:49:00,122 INFO L290 TraceCheckUtils]: 57: Hoare triple {16459#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16460#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:49:00,122 INFO L290 TraceCheckUtils]: 58: Hoare triple {16460#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16460#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:49:00,128 INFO L290 TraceCheckUtils]: 59: Hoare triple {16460#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16461#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:49:00,129 INFO L290 TraceCheckUtils]: 60: Hoare triple {16461#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {16461#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:49:00,131 INFO L290 TraceCheckUtils]: 61: Hoare triple {16461#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16462#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} is VALID [2022-04-15 12:49:00,131 INFO L290 TraceCheckUtils]: 62: Hoare triple {16462#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {16462#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} is VALID [2022-04-15 12:49:00,132 INFO L290 TraceCheckUtils]: 63: Hoare triple {16462#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {16430#false} is VALID [2022-04-15 12:49:00,133 INFO L290 TraceCheckUtils]: 64: Hoare triple {16430#false} assume !(~x~0 % 4294967296 < 100000000); {16430#false} is VALID [2022-04-15 12:49:00,133 INFO L272 TraceCheckUtils]: 65: Hoare triple {16430#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {16430#false} is VALID [2022-04-15 12:49:00,133 INFO L290 TraceCheckUtils]: 66: Hoare triple {16430#false} ~cond := #in~cond; {16430#false} is VALID [2022-04-15 12:49:00,133 INFO L290 TraceCheckUtils]: 67: Hoare triple {16430#false} assume 0 == ~cond; {16430#false} is VALID [2022-04-15 12:49:00,133 INFO L290 TraceCheckUtils]: 68: Hoare triple {16430#false} assume !false; {16430#false} is VALID [2022-04-15 12:49:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 29 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:00,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:00,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574566249] [2022-04-15 12:49:00,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574566249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:00,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714148597] [2022-04-15 12:49:00,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:49:00,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:00,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:00,135 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:00,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 12:49:00,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:49:00,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:49:00,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-15 12:49:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:00,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:00,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {16429#true} call ULTIMATE.init(); {16429#true} is VALID [2022-04-15 12:49:00,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {16429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16429#true} is VALID [2022-04-15 12:49:00,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {16429#true} assume true; {16429#true} is VALID [2022-04-15 12:49:00,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16429#true} {16429#true} #40#return; {16429#true} is VALID [2022-04-15 12:49:00,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {16429#true} call #t~ret5 := main(); {16429#true} is VALID [2022-04-15 12:49:00,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {16429#true} ~x~0 := 0; {16434#(= main_~x~0 0)} is VALID [2022-04-15 12:49:00,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {16434#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {16434#(= main_~x~0 0)} is VALID [2022-04-15 12:49:00,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {16434#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16435#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:49:00,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {16435#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {16435#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:49:00,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {16435#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16436#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:49:00,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {16436#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {16436#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:49:00,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {16436#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16437#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:49:00,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {16437#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16437#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:49:00,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {16437#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16438#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:49:00,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {16438#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16438#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:49:00,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {16438#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16439#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:49:00,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {16439#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {16439#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:49:00,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {16439#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16440#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:49:00,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {16440#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {16440#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:49:00,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {16440#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16441#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:49:00,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {16441#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16441#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:49:00,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {16441#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16442#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:49:00,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {16442#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16442#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:49:00,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {16442#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16443#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:49:00,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {16443#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16443#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:49:00,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {16443#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16444#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:49:00,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {16444#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16444#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:49:00,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {16444#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16445#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:49:00,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {16445#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16445#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:49:00,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {16445#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16446#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:49:00,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {16446#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16446#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:49:00,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {16446#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16447#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:49:00,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {16447#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16447#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:49:00,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {16447#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:49:00,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {16448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {16448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:49:00,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {16448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16449#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:49:00,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {16449#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {16449#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:49:00,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {16449#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16450#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:49:00,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {16450#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16450#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:49:00,965 INFO L290 TraceCheckUtils]: 39: Hoare triple {16450#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16451#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:49:00,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {16451#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {16451#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:49:00,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {16451#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16452#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:49:00,976 INFO L290 TraceCheckUtils]: 42: Hoare triple {16452#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16452#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:49:00,982 INFO L290 TraceCheckUtils]: 43: Hoare triple {16452#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16453#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:49:00,983 INFO L290 TraceCheckUtils]: 44: Hoare triple {16453#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {16453#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:49:00,993 INFO L290 TraceCheckUtils]: 45: Hoare triple {16453#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16454#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:49:00,994 INFO L290 TraceCheckUtils]: 46: Hoare triple {16454#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16454#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:49:01,004 INFO L290 TraceCheckUtils]: 47: Hoare triple {16454#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16455#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:49:01,005 INFO L290 TraceCheckUtils]: 48: Hoare triple {16455#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {16455#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:49:01,016 INFO L290 TraceCheckUtils]: 49: Hoare triple {16455#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:49:01,017 INFO L290 TraceCheckUtils]: 50: Hoare triple {16456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {16456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:49:01,028 INFO L290 TraceCheckUtils]: 51: Hoare triple {16456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16457#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:49:01,028 INFO L290 TraceCheckUtils]: 52: Hoare triple {16457#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {16457#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:49:01,039 INFO L290 TraceCheckUtils]: 53: Hoare triple {16457#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16458#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:49:01,040 INFO L290 TraceCheckUtils]: 54: Hoare triple {16458#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16458#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:49:01,052 INFO L290 TraceCheckUtils]: 55: Hoare triple {16458#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16459#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:49:01,052 INFO L290 TraceCheckUtils]: 56: Hoare triple {16459#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16459#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:49:01,065 INFO L290 TraceCheckUtils]: 57: Hoare triple {16459#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16460#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:49:01,065 INFO L290 TraceCheckUtils]: 58: Hoare triple {16460#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16460#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:49:01,074 INFO L290 TraceCheckUtils]: 59: Hoare triple {16460#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16461#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:49:01,075 INFO L290 TraceCheckUtils]: 60: Hoare triple {16461#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {16461#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:49:01,086 INFO L290 TraceCheckUtils]: 61: Hoare triple {16461#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16650#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:49:01,086 INFO L290 TraceCheckUtils]: 62: Hoare triple {16650#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {16650#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:49:01,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {16650#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {16430#false} is VALID [2022-04-15 12:49:01,095 INFO L290 TraceCheckUtils]: 64: Hoare triple {16430#false} assume !(~x~0 % 4294967296 < 100000000); {16430#false} is VALID [2022-04-15 12:49:01,095 INFO L272 TraceCheckUtils]: 65: Hoare triple {16430#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {16430#false} is VALID [2022-04-15 12:49:01,095 INFO L290 TraceCheckUtils]: 66: Hoare triple {16430#false} ~cond := #in~cond; {16430#false} is VALID [2022-04-15 12:49:01,095 INFO L290 TraceCheckUtils]: 67: Hoare triple {16430#false} assume 0 == ~cond; {16430#false} is VALID [2022-04-15 12:49:01,095 INFO L290 TraceCheckUtils]: 68: Hoare triple {16430#false} assume !false; {16430#false} is VALID [2022-04-15 12:49:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 29 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:01,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:08,136 INFO L290 TraceCheckUtils]: 68: Hoare triple {16430#false} assume !false; {16430#false} is VALID [2022-04-15 12:49:08,137 INFO L290 TraceCheckUtils]: 67: Hoare triple {16430#false} assume 0 == ~cond; {16430#false} is VALID [2022-04-15 12:49:08,137 INFO L290 TraceCheckUtils]: 66: Hoare triple {16430#false} ~cond := #in~cond; {16430#false} is VALID [2022-04-15 12:49:08,137 INFO L272 TraceCheckUtils]: 65: Hoare triple {16430#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {16430#false} is VALID [2022-04-15 12:49:08,137 INFO L290 TraceCheckUtils]: 64: Hoare triple {16430#false} assume !(~x~0 % 4294967296 < 100000000); {16430#false} is VALID [2022-04-15 12:49:08,137 INFO L290 TraceCheckUtils]: 63: Hoare triple {16687#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {16430#false} is VALID [2022-04-15 12:49:08,138 INFO L290 TraceCheckUtils]: 62: Hoare triple {16691#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16687#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:49:08,142 INFO L290 TraceCheckUtils]: 61: Hoare triple {16695#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16691#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,142 INFO L290 TraceCheckUtils]: 60: Hoare triple {16695#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16695#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,146 INFO L290 TraceCheckUtils]: 59: Hoare triple {16702#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16695#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,146 INFO L290 TraceCheckUtils]: 58: Hoare triple {16702#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16702#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,150 INFO L290 TraceCheckUtils]: 57: Hoare triple {16709#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16702#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {16709#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {16709#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,154 INFO L290 TraceCheckUtils]: 55: Hoare triple {16716#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16709#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,154 INFO L290 TraceCheckUtils]: 54: Hoare triple {16716#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16716#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,156 INFO L290 TraceCheckUtils]: 53: Hoare triple {16723#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16716#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {16723#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {16723#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,158 INFO L290 TraceCheckUtils]: 51: Hoare triple {16730#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16723#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,159 INFO L290 TraceCheckUtils]: 50: Hoare triple {16730#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {16730#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {16737#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16730#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,163 INFO L290 TraceCheckUtils]: 48: Hoare triple {16737#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {16737#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,164 INFO L290 TraceCheckUtils]: 47: Hoare triple {16744#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16737#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {16744#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {16744#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {16751#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16744#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {16751#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16751#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,168 INFO L290 TraceCheckUtils]: 43: Hoare triple {16758#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16751#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {16758#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16758#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {16765#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16758#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {16765#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {16765#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {16772#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16765#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {16772#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {16772#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,176 INFO L290 TraceCheckUtils]: 37: Hoare triple {16779#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16772#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {16779#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16779#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {16786#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16779#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {16786#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16786#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {16793#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16786#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {16793#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16793#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {16800#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16793#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {16800#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16800#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {16807#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16800#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {16807#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16807#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {16814#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16807#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {16814#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16814#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {16821#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16814#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {16821#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16821#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {16828#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16821#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {16828#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16828#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {16835#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16828#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {16835#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16835#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {16842#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16835#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {16842#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16842#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {16849#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16842#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {16849#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16849#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {16856#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16849#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {16856#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16856#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {16863#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16856#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {16863#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {16863#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {16870#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16863#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {16870#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16870#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {16877#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16870#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {16877#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {16877#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {16884#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16877#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-15 12:49:08,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {16884#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {16884#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {16429#true} ~x~0 := 0; {16884#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-15 12:49:08,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {16429#true} call #t~ret5 := main(); {16429#true} is VALID [2022-04-15 12:49:08,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16429#true} {16429#true} #40#return; {16429#true} is VALID [2022-04-15 12:49:08,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {16429#true} assume true; {16429#true} is VALID [2022-04-15 12:49:08,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {16429#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16429#true} is VALID [2022-04-15 12:49:08,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {16429#true} call ULTIMATE.init(); {16429#true} is VALID [2022-04-15 12:49:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 29 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:08,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714148597] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:08,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:08,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 32] total 63 [2022-04-15 12:49:08,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:08,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [519990611] [2022-04-15 12:49:08,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [519990611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:08,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:08,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:49:08,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519118253] [2022-04-15 12:49:08,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:08,210 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 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 69 [2022-04-15 12:49:08,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:08,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 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-15 12:49:08,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:08,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:49:08,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:08,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:49:08,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1053, Invalid=2853, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 12:49:08,550 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 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-15 12:49:30,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:30,108 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-04-15 12:49:30,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 12:49:30,108 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 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 69 [2022-04-15 12:49:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:30,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 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-15 12:49:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 81 transitions. [2022-04-15 12:49:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 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-15 12:49:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 81 transitions. [2022-04-15 12:49:30,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 81 transitions. [2022-04-15 12:49:30,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:30,742 INFO L225 Difference]: With dead ends: 80 [2022-04-15 12:49:30,742 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 12:49:30,743 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2095, Invalid=6277, Unknown=0, NotChecked=0, Total=8372 [2022-04-15 12:49:30,744 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:30,744 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 74 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-04-15 12:49:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 12:49:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-15 12:49:30,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:30,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 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-15 12:49:30,904 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 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-15 12:49:30,904 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 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-15 12:49:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:30,905 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-04-15 12:49:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-04-15 12:49:30,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:30,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:30,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 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 73 states. [2022-04-15 12:49:30,906 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 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 73 states. [2022-04-15 12:49:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:30,906 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-04-15 12:49:30,907 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-04-15 12:49:30,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:30,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:30,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:30,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 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-15 12:49:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2022-04-15 12:49:30,908 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2022-04-15 12:49:30,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:30,908 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2022-04-15 12:49:30,909 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 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-15 12:49:30,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 75 transitions. [2022-04-15 12:49:31,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-04-15 12:49:31,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 12:49:31,535 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:31,535 INFO L499 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:31,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 12:49:31,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:31,736 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:31,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:31,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1726249338, now seen corresponding path program 57 times [2022-04-15 12:49:31,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:31,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1183699684] [2022-04-15 12:49:31,912 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:49:31,913 INFO L85 PathProgramCache]: Analyzing trace with hash 410879473, now seen corresponding path program 1 times [2022-04-15 12:49:31,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:31,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650287232] [2022-04-15 12:49:31,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:31,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:49:31,919 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:49:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:49:31,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:49:31,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1726249338, now seen corresponding path program 58 times [2022-04-15 12:49:31,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:31,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038976949] [2022-04-15 12:49:31,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:31,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:32,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:32,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {17453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17418#true} is VALID [2022-04-15 12:49:32,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {17418#true} assume true; {17418#true} is VALID [2022-04-15 12:49:32,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17418#true} {17418#true} #40#return; {17418#true} is VALID [2022-04-15 12:49:32,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {17418#true} call ULTIMATE.init(); {17453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:32,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {17453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17418#true} is VALID [2022-04-15 12:49:32,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {17418#true} assume true; {17418#true} is VALID [2022-04-15 12:49:32,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17418#true} {17418#true} #40#return; {17418#true} is VALID [2022-04-15 12:49:32,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {17418#true} call #t~ret5 := main(); {17418#true} is VALID [2022-04-15 12:49:32,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {17418#true} ~x~0 := 0; {17423#(= main_~x~0 0)} is VALID [2022-04-15 12:49:32,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {17423#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {17423#(= main_~x~0 0)} is VALID [2022-04-15 12:49:32,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {17423#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17424#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:49:32,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {17424#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {17424#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:49:32,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {17424#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17425#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:49:32,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {17425#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {17425#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:49:32,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {17425#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17426#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:49:32,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {17426#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17426#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:49:32,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {17426#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:49:32,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {17427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:49:32,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {17427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17428#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:49:32,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {17428#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {17428#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:49:32,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {17428#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17429#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:49:32,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {17429#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {17429#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:49:32,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {17429#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17430#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:49:32,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {17430#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17430#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:49:32,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {17430#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17431#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:49:32,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {17431#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17431#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:49:32,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {17431#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17432#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:49:32,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {17432#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17432#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:49:32,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {17432#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17433#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:49:32,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {17433#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17433#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:49:32,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {17433#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17434#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:49:32,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {17434#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17434#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:49:32,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {17434#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17435#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:49:32,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {17435#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17435#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:49:32,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {17435#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17436#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:49:32,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {17436#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17436#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:49:32,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {17436#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17437#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:49:32,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {17437#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {17437#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:49:32,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {17437#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17438#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:49:32,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {17438#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {17438#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:49:32,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {17438#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17439#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:49:32,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {17439#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17439#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:49:32,878 INFO L290 TraceCheckUtils]: 39: Hoare triple {17439#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17440#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:49:32,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {17440#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {17440#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:49:32,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {17440#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17441#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:49:32,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {17441#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17441#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:49:32,893 INFO L290 TraceCheckUtils]: 43: Hoare triple {17441#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17442#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:49:32,893 INFO L290 TraceCheckUtils]: 44: Hoare triple {17442#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {17442#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:49:32,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {17442#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17443#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:49:32,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {17443#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17443#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:49:32,906 INFO L290 TraceCheckUtils]: 47: Hoare triple {17443#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17444#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:49:32,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {17444#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {17444#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:49:32,914 INFO L290 TraceCheckUtils]: 49: Hoare triple {17444#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17445#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:49:32,914 INFO L290 TraceCheckUtils]: 50: Hoare triple {17445#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {17445#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:49:32,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {17445#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17446#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:49:32,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {17446#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {17446#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:49:32,934 INFO L290 TraceCheckUtils]: 53: Hoare triple {17446#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17447#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:49:32,934 INFO L290 TraceCheckUtils]: 54: Hoare triple {17447#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17447#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:49:32,948 INFO L290 TraceCheckUtils]: 55: Hoare triple {17447#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17448#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:49:32,949 INFO L290 TraceCheckUtils]: 56: Hoare triple {17448#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17448#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:49:32,962 INFO L290 TraceCheckUtils]: 57: Hoare triple {17448#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17449#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:49:32,963 INFO L290 TraceCheckUtils]: 58: Hoare triple {17449#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17449#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:49:32,973 INFO L290 TraceCheckUtils]: 59: Hoare triple {17449#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17450#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:49:32,974 INFO L290 TraceCheckUtils]: 60: Hoare triple {17450#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {17450#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:49:32,988 INFO L290 TraceCheckUtils]: 61: Hoare triple {17450#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17451#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:49:32,989 INFO L290 TraceCheckUtils]: 62: Hoare triple {17451#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {17451#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:49:32,993 INFO L290 TraceCheckUtils]: 63: Hoare triple {17451#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17452#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:49:32,994 INFO L290 TraceCheckUtils]: 64: Hoare triple {17452#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {17452#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:49:32,995 INFO L290 TraceCheckUtils]: 65: Hoare triple {17452#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {17419#false} is VALID [2022-04-15 12:49:32,995 INFO L290 TraceCheckUtils]: 66: Hoare triple {17419#false} assume !(~x~0 % 4294967296 < 100000000); {17419#false} is VALID [2022-04-15 12:49:32,995 INFO L272 TraceCheckUtils]: 67: Hoare triple {17419#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {17419#false} is VALID [2022-04-15 12:49:32,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {17419#false} ~cond := #in~cond; {17419#false} is VALID [2022-04-15 12:49:32,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {17419#false} assume 0 == ~cond; {17419#false} is VALID [2022-04-15 12:49:32,995 INFO L290 TraceCheckUtils]: 70: Hoare triple {17419#false} assume !false; {17419#false} is VALID [2022-04-15 12:49:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 30 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:32,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:32,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038976949] [2022-04-15 12:49:32,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038976949] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:32,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074462414] [2022-04-15 12:49:32,996 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:49:32,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:32,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:32,997 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:32,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 12:49:33,092 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:49:33,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:49:33,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-15 12:49:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:33,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:33,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {17418#true} call ULTIMATE.init(); {17418#true} is VALID [2022-04-15 12:49:33,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {17418#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17418#true} is VALID [2022-04-15 12:49:33,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {17418#true} assume true; {17418#true} is VALID [2022-04-15 12:49:33,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17418#true} {17418#true} #40#return; {17418#true} is VALID [2022-04-15 12:49:33,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {17418#true} call #t~ret5 := main(); {17418#true} is VALID [2022-04-15 12:49:33,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {17418#true} ~x~0 := 0; {17423#(= main_~x~0 0)} is VALID [2022-04-15 12:49:33,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {17423#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {17423#(= main_~x~0 0)} is VALID [2022-04-15 12:49:33,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {17423#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17424#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:49:33,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {17424#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {17424#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:49:33,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {17424#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17425#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:49:33,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {17425#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {17425#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:49:33,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {17425#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17426#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:49:33,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {17426#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17426#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:49:33,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {17426#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:49:33,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {17427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:49:33,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {17427#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17428#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:49:33,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {17428#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {17428#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:49:33,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {17428#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17429#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:49:33,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {17429#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {17429#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:49:33,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {17429#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17430#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:49:33,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {17430#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17430#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:49:33,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {17430#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17431#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:49:33,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {17431#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17431#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:49:33,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {17431#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17432#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:49:33,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {17432#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17432#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:49:33,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {17432#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17433#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:49:33,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {17433#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17433#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:49:33,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {17433#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17434#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:49:33,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {17434#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17434#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:49:33,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {17434#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17435#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:49:33,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {17435#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17435#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:49:33,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {17435#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17436#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:49:33,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {17436#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17436#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:49:33,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {17436#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17437#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:49:33,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {17437#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {17437#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:49:33,927 INFO L290 TraceCheckUtils]: 35: Hoare triple {17437#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17438#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:49:33,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {17438#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {17438#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:49:33,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {17438#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17439#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:49:33,944 INFO L290 TraceCheckUtils]: 38: Hoare triple {17439#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17439#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:49:33,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {17439#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17440#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:49:33,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {17440#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {17440#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:49:33,976 INFO L290 TraceCheckUtils]: 41: Hoare triple {17440#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17441#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:49:33,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {17441#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17441#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:49:33,988 INFO L290 TraceCheckUtils]: 43: Hoare triple {17441#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17442#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:49:33,989 INFO L290 TraceCheckUtils]: 44: Hoare triple {17442#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {17442#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:49:34,004 INFO L290 TraceCheckUtils]: 45: Hoare triple {17442#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17443#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:49:34,005 INFO L290 TraceCheckUtils]: 46: Hoare triple {17443#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17443#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:49:34,020 INFO L290 TraceCheckUtils]: 47: Hoare triple {17443#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17444#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:49:34,021 INFO L290 TraceCheckUtils]: 48: Hoare triple {17444#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {17444#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:49:34,037 INFO L290 TraceCheckUtils]: 49: Hoare triple {17444#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17445#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:49:34,037 INFO L290 TraceCheckUtils]: 50: Hoare triple {17445#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {17445#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:49:34,053 INFO L290 TraceCheckUtils]: 51: Hoare triple {17445#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17446#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:49:34,054 INFO L290 TraceCheckUtils]: 52: Hoare triple {17446#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {17446#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:49:34,069 INFO L290 TraceCheckUtils]: 53: Hoare triple {17446#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17447#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:49:34,070 INFO L290 TraceCheckUtils]: 54: Hoare triple {17447#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17447#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:49:34,083 INFO L290 TraceCheckUtils]: 55: Hoare triple {17447#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17448#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:49:34,084 INFO L290 TraceCheckUtils]: 56: Hoare triple {17448#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17448#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:49:34,097 INFO L290 TraceCheckUtils]: 57: Hoare triple {17448#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17449#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:49:34,097 INFO L290 TraceCheckUtils]: 58: Hoare triple {17449#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17449#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:49:34,107 INFO L290 TraceCheckUtils]: 59: Hoare triple {17449#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17450#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:49:34,108 INFO L290 TraceCheckUtils]: 60: Hoare triple {17450#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {17450#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:49:34,120 INFO L290 TraceCheckUtils]: 61: Hoare triple {17450#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17451#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:49:34,121 INFO L290 TraceCheckUtils]: 62: Hoare triple {17451#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {17451#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:49:34,130 INFO L290 TraceCheckUtils]: 63: Hoare triple {17451#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17646#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:49:34,131 INFO L290 TraceCheckUtils]: 64: Hoare triple {17646#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17646#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:49:34,139 INFO L290 TraceCheckUtils]: 65: Hoare triple {17646#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {17653#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:49:34,162 INFO L290 TraceCheckUtils]: 66: Hoare triple {17653#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !(~x~0 % 4294967296 < 100000000); {17419#false} is VALID [2022-04-15 12:49:34,163 INFO L272 TraceCheckUtils]: 67: Hoare triple {17419#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {17419#false} is VALID [2022-04-15 12:49:34,163 INFO L290 TraceCheckUtils]: 68: Hoare triple {17419#false} ~cond := #in~cond; {17419#false} is VALID [2022-04-15 12:49:34,163 INFO L290 TraceCheckUtils]: 69: Hoare triple {17419#false} assume 0 == ~cond; {17419#false} is VALID [2022-04-15 12:49:34,163 INFO L290 TraceCheckUtils]: 70: Hoare triple {17419#false} assume !false; {17419#false} is VALID [2022-04-15 12:49:34,164 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:34,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:39,870 INFO L290 TraceCheckUtils]: 70: Hoare triple {17419#false} assume !false; {17419#false} is VALID [2022-04-15 12:49:39,870 INFO L290 TraceCheckUtils]: 69: Hoare triple {17419#false} assume 0 == ~cond; {17419#false} is VALID [2022-04-15 12:49:39,870 INFO L290 TraceCheckUtils]: 68: Hoare triple {17419#false} ~cond := #in~cond; {17419#false} is VALID [2022-04-15 12:49:39,870 INFO L272 TraceCheckUtils]: 67: Hoare triple {17419#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {17419#false} is VALID [2022-04-15 12:49:39,870 INFO L290 TraceCheckUtils]: 66: Hoare triple {17681#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {17419#false} is VALID [2022-04-15 12:49:39,877 INFO L290 TraceCheckUtils]: 65: Hoare triple {17685#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {17681#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,878 INFO L290 TraceCheckUtils]: 64: Hoare triple {17685#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17685#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,884 INFO L290 TraceCheckUtils]: 63: Hoare triple {17692#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17685#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,885 INFO L290 TraceCheckUtils]: 62: Hoare triple {17692#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17692#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,890 INFO L290 TraceCheckUtils]: 61: Hoare triple {17699#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17692#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,891 INFO L290 TraceCheckUtils]: 60: Hoare triple {17699#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17699#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,896 INFO L290 TraceCheckUtils]: 59: Hoare triple {17706#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17699#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,896 INFO L290 TraceCheckUtils]: 58: Hoare triple {17706#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17706#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,899 INFO L290 TraceCheckUtils]: 57: Hoare triple {17713#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17706#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,899 INFO L290 TraceCheckUtils]: 56: Hoare triple {17713#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17713#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,904 INFO L290 TraceCheckUtils]: 55: Hoare triple {17720#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17713#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,904 INFO L290 TraceCheckUtils]: 54: Hoare triple {17720#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17720#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,909 INFO L290 TraceCheckUtils]: 53: Hoare triple {17727#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17720#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,910 INFO L290 TraceCheckUtils]: 52: Hoare triple {17727#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17727#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,913 INFO L290 TraceCheckUtils]: 51: Hoare triple {17734#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17727#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,914 INFO L290 TraceCheckUtils]: 50: Hoare triple {17734#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17734#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {17741#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17734#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,919 INFO L290 TraceCheckUtils]: 48: Hoare triple {17741#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17741#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {17748#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17741#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,924 INFO L290 TraceCheckUtils]: 46: Hoare triple {17748#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17748#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,926 INFO L290 TraceCheckUtils]: 45: Hoare triple {17755#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17748#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,927 INFO L290 TraceCheckUtils]: 44: Hoare triple {17755#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17755#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {17762#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17755#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {17762#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17762#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {17769#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17762#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {17769#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17769#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,938 INFO L290 TraceCheckUtils]: 39: Hoare triple {17776#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17769#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {17776#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17776#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {17783#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17776#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,943 INFO L290 TraceCheckUtils]: 36: Hoare triple {17783#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17783#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {17790#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17783#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {17790#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17790#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {17797#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17790#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {17797#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17797#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {17804#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17797#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {17804#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17804#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {17811#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17804#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {17811#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17811#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {17818#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17811#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {17818#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17818#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {17825#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17818#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {17825#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17825#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {17832#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17825#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {17832#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17832#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {17839#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17832#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {17839#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17839#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {17846#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17839#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {17846#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17846#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {17853#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17846#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {17853#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17853#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {17860#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17853#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {17860#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17860#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {17867#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17860#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {17867#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17867#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {17874#(< (mod (+ 29 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17867#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {17874#(< (mod (+ 29 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17874#(< (mod (+ 29 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {17881#(< (mod (+ 30 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17874#(< (mod (+ 29 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {17881#(< (mod (+ 30 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17881#(< (mod (+ 30 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {17888#(< (mod (+ main_~x~0 31) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17881#(< (mod (+ 30 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {17888#(< (mod (+ main_~x~0 31) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17888#(< (mod (+ main_~x~0 31) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {17418#true} ~x~0 := 0; {17888#(< (mod (+ main_~x~0 31) 4294967296) 100000000)} is VALID [2022-04-15 12:49:39,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {17418#true} call #t~ret5 := main(); {17418#true} is VALID [2022-04-15 12:49:39,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17418#true} {17418#true} #40#return; {17418#true} is VALID [2022-04-15 12:49:39,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {17418#true} assume true; {17418#true} is VALID [2022-04-15 12:49:39,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {17418#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17418#true} is VALID [2022-04-15 12:49:39,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {17418#true} call ULTIMATE.init(); {17418#true} is VALID [2022-04-15 12:49:39,993 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:39,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074462414] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:39,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:39,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2022-04-15 12:49:39,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:39,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1183699684] [2022-04-15 12:49:39,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1183699684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:39,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:39,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 12:49:39,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235756355] [2022-04-15 12:49:39,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:39,994 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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 71 [2022-04-15 12:49:39,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:39,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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-15 12:49:40,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:40,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 12:49:40,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:40,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 12:49:40,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1151, Invalid=3139, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 12:49:40,595 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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-15 12:50:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:09,843 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-04-15 12:50:09,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 12:50:09,844 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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 71 [2022-04-15 12:50:09,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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-15 12:50:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 83 transitions. [2022-04-15 12:50:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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-15 12:50:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 83 transitions. [2022-04-15 12:50:09,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 83 transitions. [2022-04-15 12:50:10,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:10,382 INFO L225 Difference]: With dead ends: 82 [2022-04-15 12:50:10,382 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 12:50:10,383 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2259, Invalid=6861, Unknown=0, NotChecked=0, Total=9120 [2022-04-15 12:50:10,383 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:10,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 49 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2022-04-15 12:50:10,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 12:50:10,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-15 12:50:10,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:10,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 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-15 12:50:10,540 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 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-15 12:50:10,540 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 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-15 12:50:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:10,541 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2022-04-15 12:50:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-15 12:50:10,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:10,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:10,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 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 75 states. [2022-04-15 12:50:10,542 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 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 75 states. [2022-04-15 12:50:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:10,543 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2022-04-15 12:50:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-15 12:50:10,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:10,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:10,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:10,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 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-15 12:50:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-04-15 12:50:10,544 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 71 [2022-04-15 12:50:10,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:10,545 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-04-15 12:50:10,545 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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-15 12:50:10,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 77 transitions. [2022-04-15 12:50:11,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-15 12:50:11,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 12:50:11,175 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:11,175 INFO L499 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:11,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-15 12:50:11,378 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-04-15 12:50:11,378 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:11,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:11,379 INFO L85 PathProgramCache]: Analyzing trace with hash 873699491, now seen corresponding path program 59 times [2022-04-15 12:50:11,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:11,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1802900217] [2022-04-15 12:50:11,545 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:50:11,546 INFO L85 PathProgramCache]: Analyzing trace with hash 469984817, now seen corresponding path program 1 times [2022-04-15 12:50:11,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:11,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392264708] [2022-04-15 12:50:11,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:11,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:50:11,552 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:50:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:50:11,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:50:11,557 INFO L85 PathProgramCache]: Analyzing trace with hash 873699491, now seen corresponding path program 60 times [2022-04-15 12:50:11,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:11,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572743928] [2022-04-15 12:50:11,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:11,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:12,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:12,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {18472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18436#true} is VALID [2022-04-15 12:50:12,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {18436#true} assume true; {18436#true} is VALID [2022-04-15 12:50:12,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18436#true} {18436#true} #40#return; {18436#true} is VALID [2022-04-15 12:50:12,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {18436#true} call ULTIMATE.init(); {18472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:12,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {18472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18436#true} is VALID [2022-04-15 12:50:12,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {18436#true} assume true; {18436#true} is VALID [2022-04-15 12:50:12,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18436#true} {18436#true} #40#return; {18436#true} is VALID [2022-04-15 12:50:12,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {18436#true} call #t~ret5 := main(); {18436#true} is VALID [2022-04-15 12:50:12,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {18436#true} ~x~0 := 0; {18441#(= main_~x~0 0)} is VALID [2022-04-15 12:50:12,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {18441#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {18441#(= main_~x~0 0)} is VALID [2022-04-15 12:50:12,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {18441#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18442#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:50:12,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {18442#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {18442#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:50:12,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {18442#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18443#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:50:12,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {18443#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {18443#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:50:12,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {18443#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18444#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:50:12,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {18444#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18444#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:50:12,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {18444#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18445#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:50:12,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {18445#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18445#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:50:12,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {18445#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:50:12,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {18446#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {18446#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:50:12,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {18446#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18447#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:50:12,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {18447#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {18447#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:50:12,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {18447#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18448#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:50:12,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {18448#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18448#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:50:12,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {18448#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18449#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:50:12,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {18449#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18449#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:50:12,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {18449#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18450#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:50:12,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {18450#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18450#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:50:12,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {18450#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18451#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:50:12,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {18451#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18451#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:50:12,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {18451#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18452#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:50:12,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {18452#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18452#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:50:12,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {18452#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18453#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:50:12,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {18453#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18453#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:50:12,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {18453#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18454#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:50:12,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {18454#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18454#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:50:12,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {18454#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18455#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:50:12,544 INFO L290 TraceCheckUtils]: 34: Hoare triple {18455#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {18455#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:50:12,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {18455#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18456#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:50:12,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {18456#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {18456#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:50:12,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {18456#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18457#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:50:12,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {18457#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18457#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:50:12,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {18457#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18458#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:50:12,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {18458#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {18458#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:50:12,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {18458#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18459#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:50:12,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {18459#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18459#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:50:12,630 INFO L290 TraceCheckUtils]: 43: Hoare triple {18459#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18460#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:50:12,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {18460#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {18460#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:50:12,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {18460#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18461#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:50:12,648 INFO L290 TraceCheckUtils]: 46: Hoare triple {18461#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18461#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:50:12,665 INFO L290 TraceCheckUtils]: 47: Hoare triple {18461#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18462#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:50:12,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {18462#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {18462#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:50:12,681 INFO L290 TraceCheckUtils]: 49: Hoare triple {18462#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18463#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:50:12,682 INFO L290 TraceCheckUtils]: 50: Hoare triple {18463#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {18463#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:50:12,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {18463#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18464#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:50:12,698 INFO L290 TraceCheckUtils]: 52: Hoare triple {18464#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {18464#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:50:12,710 INFO L290 TraceCheckUtils]: 53: Hoare triple {18464#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18465#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:50:12,710 INFO L290 TraceCheckUtils]: 54: Hoare triple {18465#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18465#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:50:12,722 INFO L290 TraceCheckUtils]: 55: Hoare triple {18465#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18466#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:50:12,723 INFO L290 TraceCheckUtils]: 56: Hoare triple {18466#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18466#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:50:12,740 INFO L290 TraceCheckUtils]: 57: Hoare triple {18466#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18467#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:50:12,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {18467#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18467#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:50:12,753 INFO L290 TraceCheckUtils]: 59: Hoare triple {18467#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18468#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:50:12,754 INFO L290 TraceCheckUtils]: 60: Hoare triple {18468#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {18468#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:50:12,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {18468#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18469#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:50:12,771 INFO L290 TraceCheckUtils]: 62: Hoare triple {18469#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {18469#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:50:12,788 INFO L290 TraceCheckUtils]: 63: Hoare triple {18469#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18470#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:50:12,789 INFO L290 TraceCheckUtils]: 64: Hoare triple {18470#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18470#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:50:12,790 INFO L290 TraceCheckUtils]: 65: Hoare triple {18470#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18471#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:50:12,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {18471#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {18471#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:50:12,791 INFO L290 TraceCheckUtils]: 67: Hoare triple {18471#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {18437#false} is VALID [2022-04-15 12:50:12,791 INFO L290 TraceCheckUtils]: 68: Hoare triple {18437#false} assume !(~x~0 % 4294967296 < 100000000); {18437#false} is VALID [2022-04-15 12:50:12,792 INFO L272 TraceCheckUtils]: 69: Hoare triple {18437#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {18437#false} is VALID [2022-04-15 12:50:12,792 INFO L290 TraceCheckUtils]: 70: Hoare triple {18437#false} ~cond := #in~cond; {18437#false} is VALID [2022-04-15 12:50:12,792 INFO L290 TraceCheckUtils]: 71: Hoare triple {18437#false} assume 0 == ~cond; {18437#false} is VALID [2022-04-15 12:50:12,792 INFO L290 TraceCheckUtils]: 72: Hoare triple {18437#false} assume !false; {18437#false} is VALID [2022-04-15 12:50:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 31 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:12,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:12,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572743928] [2022-04-15 12:50:12,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572743928] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:50:12,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616123577] [2022-04-15 12:50:12,793 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:50:12,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:50:12,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:50:12,794 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:50:12,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 12:50:12,848 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:50:12,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:50:12,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:50:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:12,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:50:13,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {18436#true} call ULTIMATE.init(); {18436#true} is VALID [2022-04-15 12:50:13,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {18436#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18436#true} is VALID [2022-04-15 12:50:13,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {18436#true} assume true; {18436#true} is VALID [2022-04-15 12:50:13,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18436#true} {18436#true} #40#return; {18436#true} is VALID [2022-04-15 12:50:13,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {18436#true} call #t~ret5 := main(); {18436#true} is VALID [2022-04-15 12:50:13,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {18436#true} ~x~0 := 0; {18436#true} is VALID [2022-04-15 12:50:13,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,273 INFO L290 TraceCheckUtils]: 31: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,274 INFO L290 TraceCheckUtils]: 39: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,274 INFO L290 TraceCheckUtils]: 40: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,274 INFO L290 TraceCheckUtils]: 44: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,274 INFO L290 TraceCheckUtils]: 45: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,274 INFO L290 TraceCheckUtils]: 46: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,275 INFO L290 TraceCheckUtils]: 47: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,275 INFO L290 TraceCheckUtils]: 48: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,275 INFO L290 TraceCheckUtils]: 49: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,275 INFO L290 TraceCheckUtils]: 50: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,275 INFO L290 TraceCheckUtils]: 51: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,275 INFO L290 TraceCheckUtils]: 52: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,275 INFO L290 TraceCheckUtils]: 53: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,275 INFO L290 TraceCheckUtils]: 55: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,275 INFO L290 TraceCheckUtils]: 56: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,275 INFO L290 TraceCheckUtils]: 57: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,276 INFO L290 TraceCheckUtils]: 62: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,276 INFO L290 TraceCheckUtils]: 63: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:13,276 INFO L290 TraceCheckUtils]: 64: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:13,282 INFO L290 TraceCheckUtils]: 65: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18671#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:50:13,283 INFO L290 TraceCheckUtils]: 66: Hoare triple {18671#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {18671#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:50:13,289 INFO L290 TraceCheckUtils]: 67: Hoare triple {18671#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {18678#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 12:50:13,292 INFO L290 TraceCheckUtils]: 68: Hoare triple {18678#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {18437#false} is VALID [2022-04-15 12:50:13,293 INFO L272 TraceCheckUtils]: 69: Hoare triple {18437#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {18437#false} is VALID [2022-04-15 12:50:13,293 INFO L290 TraceCheckUtils]: 70: Hoare triple {18437#false} ~cond := #in~cond; {18437#false} is VALID [2022-04-15 12:50:13,293 INFO L290 TraceCheckUtils]: 71: Hoare triple {18437#false} assume 0 == ~cond; {18437#false} is VALID [2022-04-15 12:50:13,293 INFO L290 TraceCheckUtils]: 72: Hoare triple {18437#false} assume !false; {18437#false} is VALID [2022-04-15 12:50:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2022-04-15 12:50:13,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:50:14,718 INFO L290 TraceCheckUtils]: 72: Hoare triple {18437#false} assume !false; {18437#false} is VALID [2022-04-15 12:50:14,719 INFO L290 TraceCheckUtils]: 71: Hoare triple {18697#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18437#false} is VALID [2022-04-15 12:50:14,719 INFO L290 TraceCheckUtils]: 70: Hoare triple {18701#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18697#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:50:14,720 INFO L272 TraceCheckUtils]: 69: Hoare triple {18705#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {18701#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:50:14,720 INFO L290 TraceCheckUtils]: 68: Hoare triple {18709#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {18705#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:50:14,726 INFO L290 TraceCheckUtils]: 67: Hoare triple {18713#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {18709#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:14,727 INFO L290 TraceCheckUtils]: 66: Hoare triple {18717#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {18713#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:50:14,733 INFO L290 TraceCheckUtils]: 65: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18717#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:50:14,733 INFO L290 TraceCheckUtils]: 64: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,734 INFO L290 TraceCheckUtils]: 63: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,734 INFO L290 TraceCheckUtils]: 62: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,734 INFO L290 TraceCheckUtils]: 60: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,734 INFO L290 TraceCheckUtils]: 59: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,734 INFO L290 TraceCheckUtils]: 57: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,734 INFO L290 TraceCheckUtils]: 56: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,734 INFO L290 TraceCheckUtils]: 55: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,734 INFO L290 TraceCheckUtils]: 54: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,735 INFO L290 TraceCheckUtils]: 41: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,735 INFO L290 TraceCheckUtils]: 40: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,735 INFO L290 TraceCheckUtils]: 39: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {18436#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18436#true} is VALID [2022-04-15 12:50:14,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {18436#true} assume !!(~x~0 % 4294967296 < 100000000); {18436#true} is VALID [2022-04-15 12:50:14,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {18436#true} ~x~0 := 0; {18436#true} is VALID [2022-04-15 12:50:14,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {18436#true} call #t~ret5 := main(); {18436#true} is VALID [2022-04-15 12:50:14,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18436#true} {18436#true} #40#return; {18436#true} is VALID [2022-04-15 12:50:14,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {18436#true} assume true; {18436#true} is VALID [2022-04-15 12:50:14,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {18436#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18436#true} is VALID [2022-04-15 12:50:14,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {18436#true} call ULTIMATE.init(); {18436#true} is VALID [2022-04-15 12:50:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2022-04-15 12:50:14,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616123577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:50:14,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:50:14,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 4, 8] total 42 [2022-04-15 12:50:14,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:50:14,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1802900217] [2022-04-15 12:50:14,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1802900217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:14,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:14,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 12:50:14,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830460436] [2022-04-15 12:50:14,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:50:14,740 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 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 73 [2022-04-15 12:50:14,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:50:14,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 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-15 12:50:15,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:15,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 12:50:15,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:15,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 12:50:15,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1480, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:50:15,435 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 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-15 12:50:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:53,872 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-15 12:50:53,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 12:50:53,873 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 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 73 [2022-04-15 12:50:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 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-15 12:50:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 85 transitions. [2022-04-15 12:50:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 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-15 12:50:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 85 transitions. [2022-04-15 12:50:53,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 85 transitions. [2022-04-15 12:50:54,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:54,756 INFO L225 Difference]: With dead ends: 84 [2022-04-15 12:50:54,756 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 12:50:54,757 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=548, Invalid=4708, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 12:50:54,757 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 2019 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:54,757 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 169 Invalid, 2082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2019 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2022-04-15 12:50:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 12:50:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-15 12:50:54,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:54,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:54,919 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:54,919 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:54,920 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2022-04-15 12:50:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2022-04-15 12:50:54,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:54,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:54,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-15 12:50:54,920 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-15 12:50:54,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:54,921 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2022-04-15 12:50:54,921 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2022-04-15 12:50:54,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:54,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:54,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:54,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2022-04-15 12:50:54,923 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 73 [2022-04-15 12:50:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:54,923 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2022-04-15 12:50:54,923 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 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-15 12:50:54,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 79 transitions. [2022-04-15 12:50:55,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:55,656 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2022-04-15 12:50:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 12:50:55,657 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:55,657 INFO L499 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:55,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 12:50:55,857 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62 [2022-04-15 12:50:55,857 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:55,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:55,858 INFO L85 PathProgramCache]: Analyzing trace with hash -246442112, now seen corresponding path program 61 times [2022-04-15 12:50:55,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:55,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1747642274] [2022-04-15 12:50:56,071 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:50:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash 529090161, now seen corresponding path program 1 times [2022-04-15 12:50:56,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:56,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145977023] [2022-04-15 12:50:56,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:56,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:50:56,079 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:50:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:50:56,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:50:56,084 INFO L85 PathProgramCache]: Analyzing trace with hash -246442112, now seen corresponding path program 62 times [2022-04-15 12:50:56,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:56,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139376239] [2022-04-15 12:50:56,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:56,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:56,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:56,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {19493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19456#true} is VALID [2022-04-15 12:50:56,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {19456#true} assume true; {19456#true} is VALID [2022-04-15 12:50:56,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19456#true} {19456#true} #40#return; {19456#true} is VALID [2022-04-15 12:50:56,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {19456#true} call ULTIMATE.init(); {19493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:56,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {19493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19456#true} is VALID [2022-04-15 12:50:56,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {19456#true} assume true; {19456#true} is VALID [2022-04-15 12:50:56,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19456#true} {19456#true} #40#return; {19456#true} is VALID [2022-04-15 12:50:56,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {19456#true} call #t~ret5 := main(); {19456#true} is VALID [2022-04-15 12:50:56,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {19456#true} ~x~0 := 0; {19461#(= main_~x~0 0)} is VALID [2022-04-15 12:50:56,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {19461#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {19461#(= main_~x~0 0)} is VALID [2022-04-15 12:50:56,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {19461#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19462#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:50:56,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {19462#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {19462#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:50:56,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {19462#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:50:56,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {19463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {19463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:50:56,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {19463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19464#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:50:56,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {19464#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19464#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:50:56,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {19464#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:50:56,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {19465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:50:56,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {19465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19466#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:50:56,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {19466#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {19466#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:50:56,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {19466#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:50:56,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {19467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {19467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:50:57,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {19467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19468#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:50:57,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {19468#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19468#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:50:57,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {19468#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:50:57,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {19469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:50:57,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {19469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19470#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:50:57,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {19470#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19470#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:50:57,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {19470#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19471#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:50:57,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {19471#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19471#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:50:57,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {19471#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19472#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:50:57,102 INFO L290 TraceCheckUtils]: 28: Hoare triple {19472#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19472#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:50:57,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {19472#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19473#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:50:57,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {19473#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19473#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:50:57,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {19473#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19474#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:50:57,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {19474#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19474#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:50:57,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {19474#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19475#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:50:57,151 INFO L290 TraceCheckUtils]: 34: Hoare triple {19475#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {19475#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:50:57,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {19475#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19476#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:50:57,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {19476#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {19476#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:50:57,190 INFO L290 TraceCheckUtils]: 37: Hoare triple {19476#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19477#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:50:57,190 INFO L290 TraceCheckUtils]: 38: Hoare triple {19477#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19477#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:50:57,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {19477#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19478#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:50:57,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {19478#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {19478#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:50:57,229 INFO L290 TraceCheckUtils]: 41: Hoare triple {19478#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19479#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:50:57,229 INFO L290 TraceCheckUtils]: 42: Hoare triple {19479#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19479#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:50:57,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {19479#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19480#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:50:57,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {19480#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {19480#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:50:57,263 INFO L290 TraceCheckUtils]: 45: Hoare triple {19480#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19481#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:50:57,264 INFO L290 TraceCheckUtils]: 46: Hoare triple {19481#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19481#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:50:57,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {19481#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19482#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:50:57,283 INFO L290 TraceCheckUtils]: 48: Hoare triple {19482#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {19482#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:50:57,303 INFO L290 TraceCheckUtils]: 49: Hoare triple {19482#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19483#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:50:57,303 INFO L290 TraceCheckUtils]: 50: Hoare triple {19483#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {19483#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:50:57,322 INFO L290 TraceCheckUtils]: 51: Hoare triple {19483#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19484#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:50:57,322 INFO L290 TraceCheckUtils]: 52: Hoare triple {19484#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {19484#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:50:57,341 INFO L290 TraceCheckUtils]: 53: Hoare triple {19484#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19485#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:50:57,342 INFO L290 TraceCheckUtils]: 54: Hoare triple {19485#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19485#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:50:57,361 INFO L290 TraceCheckUtils]: 55: Hoare triple {19485#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19486#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:50:57,362 INFO L290 TraceCheckUtils]: 56: Hoare triple {19486#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19486#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:50:57,380 INFO L290 TraceCheckUtils]: 57: Hoare triple {19486#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19487#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:50:57,381 INFO L290 TraceCheckUtils]: 58: Hoare triple {19487#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19487#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:50:57,395 INFO L290 TraceCheckUtils]: 59: Hoare triple {19487#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19488#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:50:57,396 INFO L290 TraceCheckUtils]: 60: Hoare triple {19488#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {19488#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:50:57,415 INFO L290 TraceCheckUtils]: 61: Hoare triple {19488#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19489#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:50:57,416 INFO L290 TraceCheckUtils]: 62: Hoare triple {19489#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {19489#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:50:57,435 INFO L290 TraceCheckUtils]: 63: Hoare triple {19489#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19490#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:50:57,435 INFO L290 TraceCheckUtils]: 64: Hoare triple {19490#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19490#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:50:57,455 INFO L290 TraceCheckUtils]: 65: Hoare triple {19490#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19491#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:50:57,455 INFO L290 TraceCheckUtils]: 66: Hoare triple {19491#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {19491#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:50:57,461 INFO L290 TraceCheckUtils]: 67: Hoare triple {19491#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19492#(and (<= main_~x~0 31) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:50:57,462 INFO L290 TraceCheckUtils]: 68: Hoare triple {19492#(and (<= main_~x~0 31) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {19492#(and (<= main_~x~0 31) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:50:57,463 INFO L290 TraceCheckUtils]: 69: Hoare triple {19492#(and (<= main_~x~0 31) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {19457#false} is VALID [2022-04-15 12:50:57,463 INFO L290 TraceCheckUtils]: 70: Hoare triple {19457#false} assume !(~x~0 % 4294967296 < 100000000); {19457#false} is VALID [2022-04-15 12:50:57,463 INFO L272 TraceCheckUtils]: 71: Hoare triple {19457#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {19457#false} is VALID [2022-04-15 12:50:57,463 INFO L290 TraceCheckUtils]: 72: Hoare triple {19457#false} ~cond := #in~cond; {19457#false} is VALID [2022-04-15 12:50:57,463 INFO L290 TraceCheckUtils]: 73: Hoare triple {19457#false} assume 0 == ~cond; {19457#false} is VALID [2022-04-15 12:50:57,463 INFO L290 TraceCheckUtils]: 74: Hoare triple {19457#false} assume !false; {19457#false} is VALID [2022-04-15 12:50:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 32 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:57,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:57,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139376239] [2022-04-15 12:50:57,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139376239] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:50:57,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993778384] [2022-04-15 12:50:57,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:50:57,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:50:57,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:50:57,465 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:50:57,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 12:50:57,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:50:57,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:50:57,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-15 12:50:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:57,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:50:58,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {19456#true} call ULTIMATE.init(); {19456#true} is VALID [2022-04-15 12:50:58,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {19456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19456#true} is VALID [2022-04-15 12:50:58,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {19456#true} assume true; {19456#true} is VALID [2022-04-15 12:50:58,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19456#true} {19456#true} #40#return; {19456#true} is VALID [2022-04-15 12:50:58,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {19456#true} call #t~ret5 := main(); {19456#true} is VALID [2022-04-15 12:50:58,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {19456#true} ~x~0 := 0; {19461#(= main_~x~0 0)} is VALID [2022-04-15 12:50:58,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {19461#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {19461#(= main_~x~0 0)} is VALID [2022-04-15 12:50:58,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {19461#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19462#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:50:58,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {19462#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {19462#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:50:58,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {19462#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:50:58,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {19463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {19463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:50:58,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {19463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19464#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:50:58,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {19464#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19464#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:50:58,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {19464#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:50:58,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {19465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:50:58,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {19465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19466#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:50:58,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {19466#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {19466#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:50:58,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {19466#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:50:58,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {19467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {19467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:50:58,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {19467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19468#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:50:58,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {19468#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19468#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:50:58,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {19468#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:50:58,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {19469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:50:58,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {19469#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19470#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:50:58,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {19470#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19470#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:50:58,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {19470#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19471#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:50:58,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {19471#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19471#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:50:58,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {19471#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19472#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:50:58,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {19472#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19472#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:50:58,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {19472#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19473#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:50:58,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {19473#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19473#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:50:58,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {19473#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19474#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:50:58,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {19474#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19474#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:50:58,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {19474#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19475#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:50:58,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {19475#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {19475#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:50:58,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {19475#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19476#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:50:58,443 INFO L290 TraceCheckUtils]: 36: Hoare triple {19476#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {19476#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:50:58,462 INFO L290 TraceCheckUtils]: 37: Hoare triple {19476#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19477#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:50:58,462 INFO L290 TraceCheckUtils]: 38: Hoare triple {19477#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19477#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:50:58,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {19477#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19478#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:50:58,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {19478#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {19478#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:50:58,500 INFO L290 TraceCheckUtils]: 41: Hoare triple {19478#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19479#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:50:58,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {19479#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19479#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:50:58,515 INFO L290 TraceCheckUtils]: 43: Hoare triple {19479#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19480#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:50:58,515 INFO L290 TraceCheckUtils]: 44: Hoare triple {19480#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {19480#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:50:58,534 INFO L290 TraceCheckUtils]: 45: Hoare triple {19480#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19481#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:50:58,534 INFO L290 TraceCheckUtils]: 46: Hoare triple {19481#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19481#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:50:58,553 INFO L290 TraceCheckUtils]: 47: Hoare triple {19481#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19482#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:50:58,553 INFO L290 TraceCheckUtils]: 48: Hoare triple {19482#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {19482#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:50:58,572 INFO L290 TraceCheckUtils]: 49: Hoare triple {19482#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19483#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:50:58,573 INFO L290 TraceCheckUtils]: 50: Hoare triple {19483#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {19483#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:50:58,598 INFO L290 TraceCheckUtils]: 51: Hoare triple {19483#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19484#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:50:58,599 INFO L290 TraceCheckUtils]: 52: Hoare triple {19484#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {19484#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:50:58,617 INFO L290 TraceCheckUtils]: 53: Hoare triple {19484#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19485#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:50:58,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {19485#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19485#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:50:58,637 INFO L290 TraceCheckUtils]: 55: Hoare triple {19485#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19486#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:50:58,637 INFO L290 TraceCheckUtils]: 56: Hoare triple {19486#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19486#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:50:58,656 INFO L290 TraceCheckUtils]: 57: Hoare triple {19486#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19487#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:50:58,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {19487#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19487#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:50:58,671 INFO L290 TraceCheckUtils]: 59: Hoare triple {19487#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19488#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:50:58,671 INFO L290 TraceCheckUtils]: 60: Hoare triple {19488#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {19488#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:50:58,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {19488#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19489#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:50:58,691 INFO L290 TraceCheckUtils]: 62: Hoare triple {19489#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {19489#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:50:58,709 INFO L290 TraceCheckUtils]: 63: Hoare triple {19489#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19490#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:50:58,710 INFO L290 TraceCheckUtils]: 64: Hoare triple {19490#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19490#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:50:58,728 INFO L290 TraceCheckUtils]: 65: Hoare triple {19490#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19491#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:50:58,729 INFO L290 TraceCheckUtils]: 66: Hoare triple {19491#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {19491#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:50:58,750 INFO L290 TraceCheckUtils]: 67: Hoare triple {19491#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19698#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:50:58,750 INFO L290 TraceCheckUtils]: 68: Hoare triple {19698#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {19698#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:50:58,765 INFO L290 TraceCheckUtils]: 69: Hoare triple {19698#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {19457#false} is VALID [2022-04-15 12:50:58,765 INFO L290 TraceCheckUtils]: 70: Hoare triple {19457#false} assume !(~x~0 % 4294967296 < 100000000); {19457#false} is VALID [2022-04-15 12:50:58,765 INFO L272 TraceCheckUtils]: 71: Hoare triple {19457#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {19457#false} is VALID [2022-04-15 12:50:58,765 INFO L290 TraceCheckUtils]: 72: Hoare triple {19457#false} ~cond := #in~cond; {19457#false} is VALID [2022-04-15 12:50:58,765 INFO L290 TraceCheckUtils]: 73: Hoare triple {19457#false} assume 0 == ~cond; {19457#false} is VALID [2022-04-15 12:50:58,765 INFO L290 TraceCheckUtils]: 74: Hoare triple {19457#false} assume !false; {19457#false} is VALID [2022-04-15 12:50:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 32 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:58,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:51:14,295 INFO L290 TraceCheckUtils]: 74: Hoare triple {19457#false} assume !false; {19457#false} is VALID [2022-04-15 12:51:14,295 INFO L290 TraceCheckUtils]: 73: Hoare triple {19457#false} assume 0 == ~cond; {19457#false} is VALID [2022-04-15 12:51:14,295 INFO L290 TraceCheckUtils]: 72: Hoare triple {19457#false} ~cond := #in~cond; {19457#false} is VALID [2022-04-15 12:51:14,295 INFO L272 TraceCheckUtils]: 71: Hoare triple {19457#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {19457#false} is VALID [2022-04-15 12:51:14,296 INFO L290 TraceCheckUtils]: 70: Hoare triple {19457#false} assume !(~x~0 % 4294967296 < 100000000); {19457#false} is VALID [2022-04-15 12:51:14,296 INFO L290 TraceCheckUtils]: 69: Hoare triple {19735#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {19457#false} is VALID [2022-04-15 12:51:14,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {19739#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19735#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:51:14,301 INFO L290 TraceCheckUtils]: 67: Hoare triple {19743#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19739#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,302 INFO L290 TraceCheckUtils]: 66: Hoare triple {19743#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19743#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,307 INFO L290 TraceCheckUtils]: 65: Hoare triple {19750#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19743#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,307 INFO L290 TraceCheckUtils]: 64: Hoare triple {19750#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19750#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,313 INFO L290 TraceCheckUtils]: 63: Hoare triple {19757#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19750#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {19757#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {19757#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,319 INFO L290 TraceCheckUtils]: 61: Hoare triple {19764#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19757#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,319 INFO L290 TraceCheckUtils]: 60: Hoare triple {19764#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19764#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,322 INFO L290 TraceCheckUtils]: 59: Hoare triple {19771#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19764#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,322 INFO L290 TraceCheckUtils]: 58: Hoare triple {19771#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {19771#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,325 INFO L290 TraceCheckUtils]: 57: Hoare triple {19778#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19771#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {19778#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {19778#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,331 INFO L290 TraceCheckUtils]: 55: Hoare triple {19785#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19778#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,331 INFO L290 TraceCheckUtils]: 54: Hoare triple {19785#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {19785#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,333 INFO L290 TraceCheckUtils]: 53: Hoare triple {19792#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19785#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,334 INFO L290 TraceCheckUtils]: 52: Hoare triple {19792#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {19792#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,340 INFO L290 TraceCheckUtils]: 51: Hoare triple {19799#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19792#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {19799#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19799#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,342 INFO L290 TraceCheckUtils]: 49: Hoare triple {19806#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19799#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,342 INFO L290 TraceCheckUtils]: 48: Hoare triple {19806#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19806#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,349 INFO L290 TraceCheckUtils]: 47: Hoare triple {19813#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19806#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,349 INFO L290 TraceCheckUtils]: 46: Hoare triple {19813#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {19813#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,353 INFO L290 TraceCheckUtils]: 45: Hoare triple {19820#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19813#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,353 INFO L290 TraceCheckUtils]: 44: Hoare triple {19820#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {19820#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,356 INFO L290 TraceCheckUtils]: 43: Hoare triple {19827#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19820#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,357 INFO L290 TraceCheckUtils]: 42: Hoare triple {19827#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19827#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {19834#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19827#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {19834#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19834#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {19841#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19834#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,363 INFO L290 TraceCheckUtils]: 38: Hoare triple {19841#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19841#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {19848#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19841#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,366 INFO L290 TraceCheckUtils]: 36: Hoare triple {19848#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19848#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {19855#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19848#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {19855#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19855#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {19862#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19855#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {19862#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19862#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {19869#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19862#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {19869#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19869#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {19876#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19869#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {19876#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19876#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {19883#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19876#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {19883#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19883#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {19890#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19883#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {19890#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19890#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {19897#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19890#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {19897#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19897#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {19904#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19897#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {19904#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19904#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {19911#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19904#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {19911#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {19911#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {19918#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19911#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {19918#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19918#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {19925#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19918#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {19925#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19925#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {19932#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19925#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {19932#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {19932#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {19939#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19932#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-15 12:51:14,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {19939#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19939#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {19946#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19939#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {19946#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19946#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {19953#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19946#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {19953#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {19953#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {19456#true} ~x~0 := 0; {19953#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:14,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {19456#true} call #t~ret5 := main(); {19456#true} is VALID [2022-04-15 12:51:14,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19456#true} {19456#true} #40#return; {19456#true} is VALID [2022-04-15 12:51:14,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {19456#true} assume true; {19456#true} is VALID [2022-04-15 12:51:14,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {19456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19456#true} is VALID [2022-04-15 12:51:14,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {19456#true} call ULTIMATE.init(); {19456#true} is VALID [2022-04-15 12:51:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 32 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:51:14,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993778384] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:51:14,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:51:14,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 35] total 69 [2022-04-15 12:51:14,424 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:14,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1747642274] [2022-04-15 12:51:14,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1747642274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:14,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:14,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 12:51:14,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066317930] [2022-04-15 12:51:14,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:14,424 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 34 states have internal predecessors, (71), 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 75 [2022-04-15 12:51:14,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:14,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 34 states have internal predecessors, (71), 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-15 12:51:15,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:15,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 12:51:15,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:15,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 12:51:15,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1257, Invalid=3435, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 12:51:15,254 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 34 states have internal predecessors, (71), 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-15 12:52:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:02,453 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-04-15 12:52:02,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 12:52:02,453 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 34 states have internal predecessors, (71), 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 75 [2022-04-15 12:52:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 34 states have internal predecessors, (71), 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-15 12:52:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 87 transitions. [2022-04-15 12:52:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 34 states have internal predecessors, (71), 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-15 12:52:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 87 transitions. [2022-04-15 12:52:02,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 87 transitions. [2022-04-15 12:52:03,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:03,491 INFO L225 Difference]: With dead ends: 86 [2022-04-15 12:52:03,491 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 12:52:03,492 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=2503, Invalid=7597, Unknown=0, NotChecked=0, Total=10100 [2022-04-15 12:52:03,492 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:03,492 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 84 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 16.1s Time] [2022-04-15 12:52:03,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 12:52:03,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-15 12:52:03,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:03,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 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-15 12:52:03,659 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 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-15 12:52:03,659 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 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-15 12:52:03,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:03,660 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-15 12:52:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-15 12:52:03,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:03,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:03,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 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 79 states. [2022-04-15 12:52:03,660 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 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 79 states. [2022-04-15 12:52:03,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:03,661 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-15 12:52:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-15 12:52:03,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:03,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:03,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:03,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 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-15 12:52:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-04-15 12:52:03,662 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 75 [2022-04-15 12:52:03,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:03,663 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-04-15 12:52:03,663 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 34 states have internal predecessors, (71), 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-15 12:52:03,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 81 transitions. [2022-04-15 12:52:04,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-15 12:52:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 12:52:04,436 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:04,436 INFO L499 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:04,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-15 12:52:04,639 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:04,639 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:04,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:04,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1334268701, now seen corresponding path program 63 times [2022-04-15 12:52:04,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:04,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [338719604] [2022-04-15 12:52:04,823 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:52:04,825 INFO L85 PathProgramCache]: Analyzing trace with hash 588195505, now seen corresponding path program 1 times [2022-04-15 12:52:04,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:04,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248774507] [2022-04-15 12:52:04,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:04,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:52:04,831 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:52:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:52:04,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:52:04,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1334268701, now seen corresponding path program 64 times [2022-04-15 12:52:04,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:04,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857926419] [2022-04-15 12:52:04,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:04,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:05,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:05,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {20567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20529#true} is VALID [2022-04-15 12:52:05,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {20529#true} assume true; {20529#true} is VALID [2022-04-15 12:52:05,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20529#true} {20529#true} #40#return; {20529#true} is VALID [2022-04-15 12:52:05,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {20529#true} call ULTIMATE.init(); {20567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:05,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {20567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20529#true} is VALID [2022-04-15 12:52:05,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {20529#true} assume true; {20529#true} is VALID [2022-04-15 12:52:05,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20529#true} {20529#true} #40#return; {20529#true} is VALID [2022-04-15 12:52:05,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {20529#true} call #t~ret5 := main(); {20529#true} is VALID [2022-04-15 12:52:05,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {20529#true} ~x~0 := 0; {20534#(= main_~x~0 0)} is VALID [2022-04-15 12:52:05,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {20534#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {20534#(= main_~x~0 0)} is VALID [2022-04-15 12:52:05,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {20534#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20535#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:52:05,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {20535#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {20535#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:52:05,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {20535#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20536#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:52:05,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {20536#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {20536#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:52:05,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {20536#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20537#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:52:05,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {20537#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20537#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:52:05,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {20537#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20538#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:52:05,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {20538#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20538#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:52:05,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {20538#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20539#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:52:05,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {20539#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {20539#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:52:05,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {20539#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20540#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:52:05,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {20540#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {20540#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:52:05,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {20540#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20541#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:52:05,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {20541#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20541#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:52:05,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {20541#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20542#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:52:05,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {20542#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20542#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:52:05,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {20542#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20543#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:52:05,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {20543#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20543#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:52:05,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {20543#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20544#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:52:05,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {20544#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20544#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:52:05,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {20544#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20545#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:52:05,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {20545#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20545#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:52:05,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {20545#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20546#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:52:05,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {20546#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20546#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:52:05,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {20546#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20547#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:52:05,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {20547#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20547#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:52:05,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {20547#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20548#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:52:05,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {20548#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {20548#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:52:05,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {20548#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20549#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:52:05,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {20549#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {20549#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:52:05,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {20549#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20550#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:52:05,953 INFO L290 TraceCheckUtils]: 38: Hoare triple {20550#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20550#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:52:05,981 INFO L290 TraceCheckUtils]: 39: Hoare triple {20550#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20551#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:52:05,981 INFO L290 TraceCheckUtils]: 40: Hoare triple {20551#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {20551#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:52:06,004 INFO L290 TraceCheckUtils]: 41: Hoare triple {20551#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20552#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:52:06,005 INFO L290 TraceCheckUtils]: 42: Hoare triple {20552#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20552#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:52:06,014 INFO L290 TraceCheckUtils]: 43: Hoare triple {20552#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20553#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:52:06,015 INFO L290 TraceCheckUtils]: 44: Hoare triple {20553#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {20553#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:52:06,031 INFO L290 TraceCheckUtils]: 45: Hoare triple {20553#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20554#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:52:06,031 INFO L290 TraceCheckUtils]: 46: Hoare triple {20554#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20554#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:52:06,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {20554#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20555#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:52:06,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {20555#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {20555#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:52:06,082 INFO L290 TraceCheckUtils]: 49: Hoare triple {20555#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20556#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:52:06,083 INFO L290 TraceCheckUtils]: 50: Hoare triple {20556#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {20556#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:52:06,109 INFO L290 TraceCheckUtils]: 51: Hoare triple {20556#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20557#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:52:06,109 INFO L290 TraceCheckUtils]: 52: Hoare triple {20557#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {20557#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:52:06,136 INFO L290 TraceCheckUtils]: 53: Hoare triple {20557#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20558#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:52:06,137 INFO L290 TraceCheckUtils]: 54: Hoare triple {20558#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20558#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:52:06,164 INFO L290 TraceCheckUtils]: 55: Hoare triple {20558#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20559#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:52:06,165 INFO L290 TraceCheckUtils]: 56: Hoare triple {20559#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20559#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:52:06,187 INFO L290 TraceCheckUtils]: 57: Hoare triple {20559#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20560#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:52:06,188 INFO L290 TraceCheckUtils]: 58: Hoare triple {20560#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20560#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:52:06,206 INFO L290 TraceCheckUtils]: 59: Hoare triple {20560#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20561#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:52:06,206 INFO L290 TraceCheckUtils]: 60: Hoare triple {20561#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {20561#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:52:06,229 INFO L290 TraceCheckUtils]: 61: Hoare triple {20561#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20562#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:52:06,230 INFO L290 TraceCheckUtils]: 62: Hoare triple {20562#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {20562#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:52:06,252 INFO L290 TraceCheckUtils]: 63: Hoare triple {20562#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20563#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:52:06,252 INFO L290 TraceCheckUtils]: 64: Hoare triple {20563#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20563#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:52:06,274 INFO L290 TraceCheckUtils]: 65: Hoare triple {20563#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:52:06,274 INFO L290 TraceCheckUtils]: 66: Hoare triple {20564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {20564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:52:06,296 INFO L290 TraceCheckUtils]: 67: Hoare triple {20564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20565#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:52:06,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {20565#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {20565#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:52:06,302 INFO L290 TraceCheckUtils]: 69: Hoare triple {20565#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20566#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:52:06,303 INFO L290 TraceCheckUtils]: 70: Hoare triple {20566#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {20566#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:52:06,304 INFO L290 TraceCheckUtils]: 71: Hoare triple {20566#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {20530#false} is VALID [2022-04-15 12:52:06,304 INFO L290 TraceCheckUtils]: 72: Hoare triple {20530#false} assume !(~x~0 % 4294967296 < 100000000); {20530#false} is VALID [2022-04-15 12:52:06,304 INFO L272 TraceCheckUtils]: 73: Hoare triple {20530#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {20530#false} is VALID [2022-04-15 12:52:06,304 INFO L290 TraceCheckUtils]: 74: Hoare triple {20530#false} ~cond := #in~cond; {20530#false} is VALID [2022-04-15 12:52:06,304 INFO L290 TraceCheckUtils]: 75: Hoare triple {20530#false} assume 0 == ~cond; {20530#false} is VALID [2022-04-15 12:52:06,304 INFO L290 TraceCheckUtils]: 76: Hoare triple {20530#false} assume !false; {20530#false} is VALID [2022-04-15 12:52:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 33 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:52:06,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:06,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857926419] [2022-04-15 12:52:06,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857926419] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:06,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222359455] [2022-04-15 12:52:06,305 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:52:06,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:06,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:06,306 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:52:06,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 12:52:06,389 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:52:06,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:52:06,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-15 12:52:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:06,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:07,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {20529#true} call ULTIMATE.init(); {20529#true} is VALID [2022-04-15 12:52:07,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {20529#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20529#true} is VALID [2022-04-15 12:52:07,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {20529#true} assume true; {20529#true} is VALID [2022-04-15 12:52:07,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20529#true} {20529#true} #40#return; {20529#true} is VALID [2022-04-15 12:52:07,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {20529#true} call #t~ret5 := main(); {20529#true} is VALID [2022-04-15 12:52:07,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {20529#true} ~x~0 := 0; {20534#(= main_~x~0 0)} is VALID [2022-04-15 12:52:07,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {20534#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {20534#(= main_~x~0 0)} is VALID [2022-04-15 12:52:07,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {20534#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20535#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:52:07,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {20535#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {20535#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:52:07,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {20535#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20536#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:52:07,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {20536#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {20536#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:52:07,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {20536#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20537#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:52:07,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {20537#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20537#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:52:07,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {20537#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20538#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:52:07,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {20538#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20538#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:52:07,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {20538#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20539#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:52:07,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {20539#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {20539#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:52:07,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {20539#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20540#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:52:07,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {20540#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {20540#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:52:07,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {20540#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20541#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:52:07,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {20541#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20541#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:52:07,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {20541#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20542#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:52:07,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {20542#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20542#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:52:07,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {20542#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20543#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:52:07,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {20543#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20543#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:52:07,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {20543#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20544#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:52:07,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {20544#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20544#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:52:07,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {20544#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20545#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:52:07,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {20545#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20545#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:52:07,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {20545#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20546#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:52:07,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {20546#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20546#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:52:07,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {20546#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20547#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:52:07,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {20547#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20547#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:52:07,360 INFO L290 TraceCheckUtils]: 33: Hoare triple {20547#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20548#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:52:07,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {20548#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {20548#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:52:07,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {20548#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20549#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:52:07,382 INFO L290 TraceCheckUtils]: 36: Hoare triple {20549#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {20549#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:52:07,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {20549#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20550#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:52:07,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {20550#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20550#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:52:07,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {20550#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20551#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:52:07,429 INFO L290 TraceCheckUtils]: 40: Hoare triple {20551#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {20551#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:52:07,452 INFO L290 TraceCheckUtils]: 41: Hoare triple {20551#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20552#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:52:07,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {20552#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20552#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:52:07,470 INFO L290 TraceCheckUtils]: 43: Hoare triple {20552#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20553#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:52:07,471 INFO L290 TraceCheckUtils]: 44: Hoare triple {20553#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {20553#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:52:07,487 INFO L290 TraceCheckUtils]: 45: Hoare triple {20553#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20554#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:52:07,488 INFO L290 TraceCheckUtils]: 46: Hoare triple {20554#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20554#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:52:07,509 INFO L290 TraceCheckUtils]: 47: Hoare triple {20554#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20555#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:52:07,509 INFO L290 TraceCheckUtils]: 48: Hoare triple {20555#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {20555#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:52:07,531 INFO L290 TraceCheckUtils]: 49: Hoare triple {20555#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20556#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:52:07,531 INFO L290 TraceCheckUtils]: 50: Hoare triple {20556#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {20556#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:52:07,554 INFO L290 TraceCheckUtils]: 51: Hoare triple {20556#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20557#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:52:07,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {20557#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {20557#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:52:07,579 INFO L290 TraceCheckUtils]: 53: Hoare triple {20557#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20558#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:52:07,580 INFO L290 TraceCheckUtils]: 54: Hoare triple {20558#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20558#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:52:07,605 INFO L290 TraceCheckUtils]: 55: Hoare triple {20558#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20559#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:52:07,606 INFO L290 TraceCheckUtils]: 56: Hoare triple {20559#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20559#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:52:07,631 INFO L290 TraceCheckUtils]: 57: Hoare triple {20559#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20560#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:52:07,632 INFO L290 TraceCheckUtils]: 58: Hoare triple {20560#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20560#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:52:07,652 INFO L290 TraceCheckUtils]: 59: Hoare triple {20560#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20561#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:52:07,652 INFO L290 TraceCheckUtils]: 60: Hoare triple {20561#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {20561#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:52:07,679 INFO L290 TraceCheckUtils]: 61: Hoare triple {20561#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20562#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:52:07,679 INFO L290 TraceCheckUtils]: 62: Hoare triple {20562#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {20562#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:52:07,701 INFO L290 TraceCheckUtils]: 63: Hoare triple {20562#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20563#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:52:07,702 INFO L290 TraceCheckUtils]: 64: Hoare triple {20563#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20563#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:52:07,725 INFO L290 TraceCheckUtils]: 65: Hoare triple {20563#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:52:07,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {20564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {20564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:52:07,747 INFO L290 TraceCheckUtils]: 67: Hoare triple {20564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20565#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:52:07,748 INFO L290 TraceCheckUtils]: 68: Hoare triple {20565#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {20565#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:52:07,769 INFO L290 TraceCheckUtils]: 69: Hoare triple {20565#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20778#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:52:07,769 INFO L290 TraceCheckUtils]: 70: Hoare triple {20778#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20778#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:52:07,786 INFO L290 TraceCheckUtils]: 71: Hoare triple {20778#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {20530#false} is VALID [2022-04-15 12:52:07,787 INFO L290 TraceCheckUtils]: 72: Hoare triple {20530#false} assume !(~x~0 % 4294967296 < 100000000); {20530#false} is VALID [2022-04-15 12:52:07,787 INFO L272 TraceCheckUtils]: 73: Hoare triple {20530#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {20530#false} is VALID [2022-04-15 12:52:07,787 INFO L290 TraceCheckUtils]: 74: Hoare triple {20530#false} ~cond := #in~cond; {20530#false} is VALID [2022-04-15 12:52:07,787 INFO L290 TraceCheckUtils]: 75: Hoare triple {20530#false} assume 0 == ~cond; {20530#false} is VALID [2022-04-15 12:52:07,787 INFO L290 TraceCheckUtils]: 76: Hoare triple {20530#false} assume !false; {20530#false} is VALID [2022-04-15 12:52:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 33 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:52:07,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:27,889 INFO L290 TraceCheckUtils]: 76: Hoare triple {20530#false} assume !false; {20530#false} is VALID [2022-04-15 12:52:27,890 INFO L290 TraceCheckUtils]: 75: Hoare triple {20530#false} assume 0 == ~cond; {20530#false} is VALID [2022-04-15 12:52:27,890 INFO L290 TraceCheckUtils]: 74: Hoare triple {20530#false} ~cond := #in~cond; {20530#false} is VALID [2022-04-15 12:52:27,890 INFO L272 TraceCheckUtils]: 73: Hoare triple {20530#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {20530#false} is VALID [2022-04-15 12:52:27,890 INFO L290 TraceCheckUtils]: 72: Hoare triple {20530#false} assume !(~x~0 % 4294967296 < 100000000); {20530#false} is VALID [2022-04-15 12:52:27,890 INFO L290 TraceCheckUtils]: 71: Hoare triple {20815#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {20530#false} is VALID [2022-04-15 12:52:27,891 INFO L290 TraceCheckUtils]: 70: Hoare triple {20819#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20815#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:52:27,897 INFO L290 TraceCheckUtils]: 69: Hoare triple {20823#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20819#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,898 INFO L290 TraceCheckUtils]: 68: Hoare triple {20823#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20823#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,906 INFO L290 TraceCheckUtils]: 67: Hoare triple {20830#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20823#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,906 INFO L290 TraceCheckUtils]: 66: Hoare triple {20830#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20830#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,913 INFO L290 TraceCheckUtils]: 65: Hoare triple {20837#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20830#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,914 INFO L290 TraceCheckUtils]: 64: Hoare triple {20837#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {20837#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:52:27,921 INFO L290 TraceCheckUtils]: 63: Hoare triple {20844#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20837#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:52:27,921 INFO L290 TraceCheckUtils]: 62: Hoare triple {20844#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20844#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,925 INFO L290 TraceCheckUtils]: 61: Hoare triple {20851#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20844#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,926 INFO L290 TraceCheckUtils]: 60: Hoare triple {20851#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {20851#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:52:27,930 INFO L290 TraceCheckUtils]: 59: Hoare triple {20858#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20851#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:52:27,930 INFO L290 TraceCheckUtils]: 58: Hoare triple {20858#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {20858#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:52:27,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {20865#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20858#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:52:27,937 INFO L290 TraceCheckUtils]: 56: Hoare triple {20865#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {20865#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:52:27,939 INFO L290 TraceCheckUtils]: 55: Hoare triple {20872#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20865#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:52:27,939 INFO L290 TraceCheckUtils]: 54: Hoare triple {20872#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {20872#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:52:27,944 INFO L290 TraceCheckUtils]: 53: Hoare triple {20879#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20872#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:52:27,945 INFO L290 TraceCheckUtils]: 52: Hoare triple {20879#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20879#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,947 INFO L290 TraceCheckUtils]: 51: Hoare triple {20886#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20879#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,947 INFO L290 TraceCheckUtils]: 50: Hoare triple {20886#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20886#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,954 INFO L290 TraceCheckUtils]: 49: Hoare triple {20893#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20886#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,955 INFO L290 TraceCheckUtils]: 48: Hoare triple {20893#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {20893#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:52:27,958 INFO L290 TraceCheckUtils]: 47: Hoare triple {20900#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20893#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:52:27,959 INFO L290 TraceCheckUtils]: 46: Hoare triple {20900#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {20900#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:52:27,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {20907#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20900#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:52:27,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {20907#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20907#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,965 INFO L290 TraceCheckUtils]: 43: Hoare triple {20914#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20907#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,966 INFO L290 TraceCheckUtils]: 42: Hoare triple {20914#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20914#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {20921#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20914#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {20921#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20921#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {20928#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20921#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {20928#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20928#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,976 INFO L290 TraceCheckUtils]: 37: Hoare triple {20935#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20928#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {20935#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20935#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {20942#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20935#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,979 INFO L290 TraceCheckUtils]: 34: Hoare triple {20942#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20942#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {20949#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20942#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,985 INFO L290 TraceCheckUtils]: 32: Hoare triple {20949#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20949#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {20956#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20949#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,989 INFO L290 TraceCheckUtils]: 30: Hoare triple {20956#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20956#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {20963#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20956#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {20963#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20963#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {20970#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20963#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {20970#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20970#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {20977#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20970#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:27,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {20977#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20977#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:28,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {20984#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20977#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:28,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {20984#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20984#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:28,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {20991#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20984#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:28,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {20991#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {20991#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 12:52:28,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {20998#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20991#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 12:52:28,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {20998#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20998#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:28,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {21005#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20998#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:28,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {21005#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {21005#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:28,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {21012#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21005#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:28,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {21012#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {21012#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-15 12:52:28,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {21019#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21012#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-15 12:52:28,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {21019#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {21019#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:28,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {21026#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21019#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:28,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {21026#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {21026#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:28,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {21033#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21026#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:28,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {21033#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {21033#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:28,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {21040#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21033#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:28,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {21040#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {21040#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:28,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {20529#true} ~x~0 := 0; {21040#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:52:28,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {20529#true} call #t~ret5 := main(); {20529#true} is VALID [2022-04-15 12:52:28,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20529#true} {20529#true} #40#return; {20529#true} is VALID [2022-04-15 12:52:28,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {20529#true} assume true; {20529#true} is VALID [2022-04-15 12:52:28,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {20529#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20529#true} is VALID [2022-04-15 12:52:28,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {20529#true} call ULTIMATE.init(); {20529#true} is VALID [2022-04-15 12:52:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 33 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:52:28,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222359455] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:28,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:28,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 36] total 71 [2022-04-15 12:52:28,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:28,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [338719604] [2022-04-15 12:52:28,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [338719604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:28,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:28,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 12:52:28,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312414837] [2022-04-15 12:52:28,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:28,054 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 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 77 [2022-04-15 12:52:28,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:28,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 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-15 12:52:28,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:28,934 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 12:52:28,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:28,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 12:52:28,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=3641, Unknown=0, NotChecked=0, Total=4970 [2022-04-15 12:52:28,935 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 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-15 12:53:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:27,436 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-04-15 12:53:27,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 12:53:27,436 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 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 77 [2022-04-15 12:53:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:53:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 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-15 12:53:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 89 transitions. [2022-04-15 12:53:27,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 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-15 12:53:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 89 transitions. [2022-04-15 12:53:27,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 89 transitions. [2022-04-15 12:53:28,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:28,644 INFO L225 Difference]: With dead ends: 88 [2022-04-15 12:53:28,644 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 12:53:28,645 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=2647, Invalid=8065, Unknown=0, NotChecked=0, Total=10712 [2022-04-15 12:53:28,645 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:53:28,646 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 144 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 20.0s Time] [2022-04-15 12:53:28,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 12:53:28,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-15 12:53:28,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:53:28,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 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-15 12:53:28,824 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 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-15 12:53:28,825 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 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-15 12:53:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:28,825 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2022-04-15 12:53:28,825 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-04-15 12:53:28,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:28,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:28,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 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 81 states. [2022-04-15 12:53:28,826 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 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 81 states. [2022-04-15 12:53:28,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:28,827 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2022-04-15 12:53:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-04-15 12:53:28,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:28,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:28,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:53:28,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:53:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 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-15 12:53:28,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2022-04-15 12:53:28,828 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 77 [2022-04-15 12:53:28,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:53:28,829 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2022-04-15 12:53:28,829 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 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-15 12:53:28,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 83 transitions. [2022-04-15 12:53:29,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:29,804 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-04-15 12:53:29,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 12:53:29,804 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:53:29,805 INFO L499 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:53:29,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 12:53:30,005 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,SelfDestructingSolverStorable66,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:53:30,005 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:53:30,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:53:30,006 INFO L85 PathProgramCache]: Analyzing trace with hash -21062790, now seen corresponding path program 65 times [2022-04-15 12:53:30,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:30,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1143033312] [2022-04-15 12:53:30,219 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:53:30,221 INFO L85 PathProgramCache]: Analyzing trace with hash 647300849, now seen corresponding path program 1 times [2022-04-15 12:53:30,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:53:30,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007878337] [2022-04-15 12:53:30,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:30,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:53:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:53:30,227 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:53:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:53:30,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:53:30,232 INFO L85 PathProgramCache]: Analyzing trace with hash -21062790, now seen corresponding path program 66 times [2022-04-15 12:53:30,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:53:30,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815464488] [2022-04-15 12:53:30,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:30,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:53:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:31,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:53:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:31,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {21669#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {21630#true} is VALID [2022-04-15 12:53:31,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {21630#true} assume true; {21630#true} is VALID [2022-04-15 12:53:31,014 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21630#true} {21630#true} #40#return; {21630#true} is VALID [2022-04-15 12:53:31,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {21630#true} call ULTIMATE.init(); {21669#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:53:31,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {21669#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {21630#true} is VALID [2022-04-15 12:53:31,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {21630#true} assume true; {21630#true} is VALID [2022-04-15 12:53:31,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21630#true} {21630#true} #40#return; {21630#true} is VALID [2022-04-15 12:53:31,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {21630#true} call #t~ret5 := main(); {21630#true} is VALID [2022-04-15 12:53:31,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {21630#true} ~x~0 := 0; {21635#(= main_~x~0 0)} is VALID [2022-04-15 12:53:31,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {21635#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {21635#(= main_~x~0 0)} is VALID [2022-04-15 12:53:31,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {21635#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21636#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:53:31,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {21636#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {21636#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:53:31,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {21636#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21637#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:53:31,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {21637#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {21637#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:53:31,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {21637#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21638#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:53:31,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {21638#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21638#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:53:31,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {21638#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21639#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:53:31,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {21639#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21639#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:53:31,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {21639#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21640#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:53:31,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {21640#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {21640#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:53:31,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {21640#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:53:31,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {21641#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {21641#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:53:31,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {21641#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21642#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:53:31,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {21642#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21642#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:53:31,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {21642#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21643#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:53:31,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {21643#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21643#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:53:31,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {21643#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21644#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:53:31,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {21644#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21644#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:53:31,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {21644#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21645#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:53:31,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {21645#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21645#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:53:31,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {21645#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21646#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:53:31,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {21646#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21646#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:53:31,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {21646#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21647#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:53:31,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {21647#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21647#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:53:31,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {21647#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21648#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:53:31,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {21648#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21648#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:53:31,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {21648#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21649#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:53:31,342 INFO L290 TraceCheckUtils]: 34: Hoare triple {21649#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {21649#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:53:31,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {21649#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21650#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:53:31,363 INFO L290 TraceCheckUtils]: 36: Hoare triple {21650#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {21650#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:53:31,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {21650#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21651#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:53:31,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {21651#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21651#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:53:31,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {21651#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21652#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:53:31,413 INFO L290 TraceCheckUtils]: 40: Hoare triple {21652#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {21652#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:53:31,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {21652#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21653#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:53:31,438 INFO L290 TraceCheckUtils]: 42: Hoare triple {21653#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21653#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:53:31,457 INFO L290 TraceCheckUtils]: 43: Hoare triple {21653#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21654#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:53:31,459 INFO L290 TraceCheckUtils]: 44: Hoare triple {21654#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {21654#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:53:31,485 INFO L290 TraceCheckUtils]: 45: Hoare triple {21654#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21655#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:53:31,485 INFO L290 TraceCheckUtils]: 46: Hoare triple {21655#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21655#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:53:31,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {21655#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21656#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:53:31,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {21656#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {21656#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:53:31,536 INFO L290 TraceCheckUtils]: 49: Hoare triple {21656#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21657#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:53:31,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {21657#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {21657#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:53:31,561 INFO L290 TraceCheckUtils]: 51: Hoare triple {21657#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21658#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:53:31,562 INFO L290 TraceCheckUtils]: 52: Hoare triple {21658#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {21658#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:53:31,585 INFO L290 TraceCheckUtils]: 53: Hoare triple {21658#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21659#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:53:31,586 INFO L290 TraceCheckUtils]: 54: Hoare triple {21659#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21659#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:53:31,610 INFO L290 TraceCheckUtils]: 55: Hoare triple {21659#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21660#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:53:31,611 INFO L290 TraceCheckUtils]: 56: Hoare triple {21660#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21660#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:53:31,636 INFO L290 TraceCheckUtils]: 57: Hoare triple {21660#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21661#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:53:31,636 INFO L290 TraceCheckUtils]: 58: Hoare triple {21661#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21661#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:53:31,656 INFO L290 TraceCheckUtils]: 59: Hoare triple {21661#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21662#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:53:31,657 INFO L290 TraceCheckUtils]: 60: Hoare triple {21662#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {21662#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:53:31,681 INFO L290 TraceCheckUtils]: 61: Hoare triple {21662#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21663#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:53:31,682 INFO L290 TraceCheckUtils]: 62: Hoare triple {21663#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {21663#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:53:31,706 INFO L290 TraceCheckUtils]: 63: Hoare triple {21663#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21664#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:53:31,707 INFO L290 TraceCheckUtils]: 64: Hoare triple {21664#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21664#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:53:31,731 INFO L290 TraceCheckUtils]: 65: Hoare triple {21664#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21665#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:53:31,732 INFO L290 TraceCheckUtils]: 66: Hoare triple {21665#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {21665#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:53:31,756 INFO L290 TraceCheckUtils]: 67: Hoare triple {21665#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21666#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:53:31,757 INFO L290 TraceCheckUtils]: 68: Hoare triple {21666#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {21666#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:53:31,781 INFO L290 TraceCheckUtils]: 69: Hoare triple {21666#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21667#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:53:31,782 INFO L290 TraceCheckUtils]: 70: Hoare triple {21667#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21667#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:53:31,789 INFO L290 TraceCheckUtils]: 71: Hoare triple {21667#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21668#(and (<= main_~x~0 33) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:53:31,789 INFO L290 TraceCheckUtils]: 72: Hoare triple {21668#(and (<= main_~x~0 33) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {21668#(and (<= main_~x~0 33) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:53:31,791 INFO L290 TraceCheckUtils]: 73: Hoare triple {21668#(and (<= main_~x~0 33) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {21631#false} is VALID [2022-04-15 12:53:31,791 INFO L290 TraceCheckUtils]: 74: Hoare triple {21631#false} assume !(~x~0 % 4294967296 < 100000000); {21631#false} is VALID [2022-04-15 12:53:31,791 INFO L272 TraceCheckUtils]: 75: Hoare triple {21631#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {21631#false} is VALID [2022-04-15 12:53:31,791 INFO L290 TraceCheckUtils]: 76: Hoare triple {21631#false} ~cond := #in~cond; {21631#false} is VALID [2022-04-15 12:53:31,791 INFO L290 TraceCheckUtils]: 77: Hoare triple {21631#false} assume 0 == ~cond; {21631#false} is VALID [2022-04-15 12:53:31,791 INFO L290 TraceCheckUtils]: 78: Hoare triple {21631#false} assume !false; {21631#false} is VALID [2022-04-15 12:53:31,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 34 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:53:31,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:53:31,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815464488] [2022-04-15 12:53:31,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815464488] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:53:31,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967627049] [2022-04-15 12:53:31,792 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:53:31,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:53:31,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:53:31,795 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:53:31,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 12:53:31,926 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:53:31,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:53:31,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:53:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:31,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:53:32,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {21630#true} call ULTIMATE.init(); {21630#true} is VALID [2022-04-15 12:53:32,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {21630#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {21630#true} is VALID [2022-04-15 12:53:32,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {21630#true} assume true; {21630#true} is VALID [2022-04-15 12:53:32,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21630#true} {21630#true} #40#return; {21630#true} is VALID [2022-04-15 12:53:32,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {21630#true} call #t~ret5 := main(); {21630#true} is VALID [2022-04-15 12:53:32,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {21630#true} ~x~0 := 0; {21630#true} is VALID [2022-04-15 12:53:32,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,457 INFO L290 TraceCheckUtils]: 43: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,457 INFO L290 TraceCheckUtils]: 44: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,457 INFO L290 TraceCheckUtils]: 45: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,458 INFO L290 TraceCheckUtils]: 46: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,458 INFO L290 TraceCheckUtils]: 47: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,458 INFO L290 TraceCheckUtils]: 48: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,458 INFO L290 TraceCheckUtils]: 49: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,458 INFO L290 TraceCheckUtils]: 50: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,458 INFO L290 TraceCheckUtils]: 51: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,458 INFO L290 TraceCheckUtils]: 52: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,458 INFO L290 TraceCheckUtils]: 53: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,458 INFO L290 TraceCheckUtils]: 54: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,458 INFO L290 TraceCheckUtils]: 55: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,458 INFO L290 TraceCheckUtils]: 56: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,458 INFO L290 TraceCheckUtils]: 57: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,458 INFO L290 TraceCheckUtils]: 58: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,458 INFO L290 TraceCheckUtils]: 59: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,458 INFO L290 TraceCheckUtils]: 60: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,459 INFO L290 TraceCheckUtils]: 61: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,459 INFO L290 TraceCheckUtils]: 62: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,459 INFO L290 TraceCheckUtils]: 63: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,459 INFO L290 TraceCheckUtils]: 64: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,459 INFO L290 TraceCheckUtils]: 65: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,459 INFO L290 TraceCheckUtils]: 66: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,459 INFO L290 TraceCheckUtils]: 67: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,459 INFO L290 TraceCheckUtils]: 68: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,459 INFO L290 TraceCheckUtils]: 69: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:32,459 INFO L290 TraceCheckUtils]: 70: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:32,466 INFO L290 TraceCheckUtils]: 71: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21886#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:53:32,467 INFO L290 TraceCheckUtils]: 72: Hoare triple {21886#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {21886#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:53:32,475 INFO L290 TraceCheckUtils]: 73: Hoare triple {21886#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {21893#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 12:53:32,479 INFO L290 TraceCheckUtils]: 74: Hoare triple {21893#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {21631#false} is VALID [2022-04-15 12:53:32,479 INFO L272 TraceCheckUtils]: 75: Hoare triple {21631#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {21631#false} is VALID [2022-04-15 12:53:32,479 INFO L290 TraceCheckUtils]: 76: Hoare triple {21631#false} ~cond := #in~cond; {21631#false} is VALID [2022-04-15 12:53:32,479 INFO L290 TraceCheckUtils]: 77: Hoare triple {21631#false} assume 0 == ~cond; {21631#false} is VALID [2022-04-15 12:53:32,479 INFO L290 TraceCheckUtils]: 78: Hoare triple {21631#false} assume !false; {21631#false} is VALID [2022-04-15 12:53:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 99 proven. 1 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2022-04-15 12:53:32,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:53:34,304 INFO L290 TraceCheckUtils]: 78: Hoare triple {21631#false} assume !false; {21631#false} is VALID [2022-04-15 12:53:34,304 INFO L290 TraceCheckUtils]: 77: Hoare triple {21912#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {21631#false} is VALID [2022-04-15 12:53:34,304 INFO L290 TraceCheckUtils]: 76: Hoare triple {21916#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21912#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:53:34,305 INFO L272 TraceCheckUtils]: 75: Hoare triple {21920#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {21916#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:53:34,305 INFO L290 TraceCheckUtils]: 74: Hoare triple {21924#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {21920#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:53:34,310 INFO L290 TraceCheckUtils]: 73: Hoare triple {21928#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {21924#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:53:34,310 INFO L290 TraceCheckUtils]: 72: Hoare triple {21932#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {21928#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:53:34,335 INFO L290 TraceCheckUtils]: 71: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21932#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:53:34,335 INFO L290 TraceCheckUtils]: 70: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,335 INFO L290 TraceCheckUtils]: 69: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,335 INFO L290 TraceCheckUtils]: 68: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,335 INFO L290 TraceCheckUtils]: 67: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,336 INFO L290 TraceCheckUtils]: 66: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,336 INFO L290 TraceCheckUtils]: 65: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,336 INFO L290 TraceCheckUtils]: 64: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,336 INFO L290 TraceCheckUtils]: 63: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,336 INFO L290 TraceCheckUtils]: 62: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,336 INFO L290 TraceCheckUtils]: 61: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,336 INFO L290 TraceCheckUtils]: 60: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,336 INFO L290 TraceCheckUtils]: 59: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,336 INFO L290 TraceCheckUtils]: 55: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,336 INFO L290 TraceCheckUtils]: 52: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,337 INFO L290 TraceCheckUtils]: 51: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,337 INFO L290 TraceCheckUtils]: 50: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,337 INFO L290 TraceCheckUtils]: 49: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,337 INFO L290 TraceCheckUtils]: 47: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,337 INFO L290 TraceCheckUtils]: 46: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,337 INFO L290 TraceCheckUtils]: 45: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,337 INFO L290 TraceCheckUtils]: 44: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,337 INFO L290 TraceCheckUtils]: 43: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,337 INFO L290 TraceCheckUtils]: 39: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,337 INFO L290 TraceCheckUtils]: 38: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,338 INFO L290 TraceCheckUtils]: 36: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,338 INFO L290 TraceCheckUtils]: 32: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {21630#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21630#true} is VALID [2022-04-15 12:53:34,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {21630#true} assume !!(~x~0 % 4294967296 < 100000000); {21630#true} is VALID [2022-04-15 12:53:34,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {21630#true} ~x~0 := 0; {21630#true} is VALID [2022-04-15 12:53:34,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {21630#true} call #t~ret5 := main(); {21630#true} is VALID [2022-04-15 12:53:34,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21630#true} {21630#true} #40#return; {21630#true} is VALID [2022-04-15 12:53:34,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {21630#true} assume true; {21630#true} is VALID [2022-04-15 12:53:34,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {21630#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {21630#true} is VALID [2022-04-15 12:53:34,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {21630#true} call ULTIMATE.init(); {21630#true} is VALID [2022-04-15 12:53:34,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 99 proven. 1 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2022-04-15 12:53:34,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967627049] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:53:34,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:53:34,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 4, 8] total 45 [2022-04-15 12:53:34,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:53:34,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1143033312] [2022-04-15 12:53:34,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1143033312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:53:34,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:53:34,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 12:53:34,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908667455] [2022-04-15 12:53:34,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:53:34,348 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 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 79 [2022-04-15 12:53:34,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:53:34,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 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-15 12:53:35,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:35,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 12:53:35,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:35,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 12:53:35,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1717, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:53:35,437 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 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-15 12:54:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:44,595 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-04-15 12:54:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 12:54:44,596 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 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 79 [2022-04-15 12:54:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:54:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 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-15 12:54:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 91 transitions. [2022-04-15 12:54:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 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-15 12:54:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 91 transitions. [2022-04-15 12:54:44,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 91 transitions. [2022-04-15 12:54:45,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:45,986 INFO L225 Difference]: With dead ends: 90 [2022-04-15 12:54:45,986 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 12:54:45,987 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=599, Invalid=5563, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 12:54:45,987 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 2238 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:54:45,987 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 34 Invalid, 2307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2238 Invalid, 0 Unknown, 0 Unchecked, 23.8s Time] [2022-04-15 12:54:45,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 12:54:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-15 12:54:46,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:54:46,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 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-15 12:54:46,165 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 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-15 12:54:46,165 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 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-15 12:54:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:46,166 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2022-04-15 12:54:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2022-04-15 12:54:46,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:46,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:46,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 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 83 states. [2022-04-15 12:54:46,166 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 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 83 states. [2022-04-15 12:54:46,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:46,167 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2022-04-15 12:54:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2022-04-15 12:54:46,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:46,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:46,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:54:46,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:54:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 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-15 12:54:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2022-04-15 12:54:46,170 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 79 [2022-04-15 12:54:46,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:54:46,170 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2022-04-15 12:54:46,170 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 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-15 12:54:46,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 85 transitions. [2022-04-15 12:54:47,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2022-04-15 12:54:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 12:54:47,124 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:54:47,124 INFO L499 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:54:47,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-15 12:54:47,324 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67,SelfDestructingSolverStorable68 [2022-04-15 12:54:47,324 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:54:47,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:54:47,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1119534953, now seen corresponding path program 67 times [2022-04-15 12:54:47,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:47,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [332967191] [2022-04-15 12:54:47,546 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:54:47,548 INFO L85 PathProgramCache]: Analyzing trace with hash 706406193, now seen corresponding path program 1 times [2022-04-15 12:54:47,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:54:47,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912379692] [2022-04-15 12:54:47,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:47,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:54:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:54:47,554 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:54:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:54:47,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:54:47,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1119534953, now seen corresponding path program 68 times [2022-04-15 12:54:47,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:54:47,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076985360] [2022-04-15 12:54:47,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:47,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:54:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:48,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:54:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:48,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {22771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22731#true} is VALID [2022-04-15 12:54:48,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {22731#true} assume true; {22731#true} is VALID [2022-04-15 12:54:48,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22731#true} {22731#true} #40#return; {22731#true} is VALID [2022-04-15 12:54:48,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {22731#true} call ULTIMATE.init(); {22771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:54:48,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {22771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22731#true} is VALID [2022-04-15 12:54:48,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {22731#true} assume true; {22731#true} is VALID [2022-04-15 12:54:48,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22731#true} {22731#true} #40#return; {22731#true} is VALID [2022-04-15 12:54:48,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {22731#true} call #t~ret5 := main(); {22731#true} is VALID [2022-04-15 12:54:48,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {22731#true} ~x~0 := 0; {22736#(= main_~x~0 0)} is VALID [2022-04-15 12:54:48,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {22736#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {22736#(= main_~x~0 0)} is VALID [2022-04-15 12:54:48,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {22736#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22737#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:54:48,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {22737#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {22737#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:54:48,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {22737#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22738#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:54:48,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {22738#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {22738#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:54:48,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {22738#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22739#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:54:48,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {22739#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22739#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:54:48,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {22739#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22740#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:54:48,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {22740#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22740#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:54:48,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {22740#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22741#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:54:48,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {22741#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {22741#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:54:48,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {22741#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22742#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:54:48,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {22742#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {22742#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:54:48,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {22742#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22743#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:54:48,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {22743#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22743#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:54:48,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {22743#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22744#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:54:48,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {22744#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22744#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:54:48,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {22744#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22745#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:54:48,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {22745#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22745#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:54:48,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {22745#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22746#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:54:48,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {22746#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22746#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:54:48,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {22746#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22747#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:54:48,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {22747#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22747#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:54:48,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {22747#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22748#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:54:48,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {22748#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22748#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:54:48,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {22748#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22749#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:54:48,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {22749#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22749#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:54:48,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {22749#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22750#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:54:48,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {22750#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {22750#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:54:48,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {22750#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22751#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:54:48,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {22751#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {22751#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:54:48,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {22751#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22752#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:54:48,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {22752#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22752#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:54:48,979 INFO L290 TraceCheckUtils]: 39: Hoare triple {22752#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22753#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:54:48,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {22753#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {22753#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:54:49,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {22753#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22754#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:54:49,007 INFO L290 TraceCheckUtils]: 42: Hoare triple {22754#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22754#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:54:49,029 INFO L290 TraceCheckUtils]: 43: Hoare triple {22754#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22755#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:54:49,030 INFO L290 TraceCheckUtils]: 44: Hoare triple {22755#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {22755#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:54:49,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {22755#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22756#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:54:49,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {22756#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22756#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:54:49,088 INFO L290 TraceCheckUtils]: 47: Hoare triple {22756#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22757#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:54:49,088 INFO L290 TraceCheckUtils]: 48: Hoare triple {22757#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {22757#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:54:49,118 INFO L290 TraceCheckUtils]: 49: Hoare triple {22757#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22758#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:54:49,119 INFO L290 TraceCheckUtils]: 50: Hoare triple {22758#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {22758#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:54:49,145 INFO L290 TraceCheckUtils]: 51: Hoare triple {22758#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22759#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:54:49,146 INFO L290 TraceCheckUtils]: 52: Hoare triple {22759#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {22759#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:54:49,172 INFO L290 TraceCheckUtils]: 53: Hoare triple {22759#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22760#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:54:49,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {22760#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22760#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:54:49,199 INFO L290 TraceCheckUtils]: 55: Hoare triple {22760#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22761#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:54:49,200 INFO L290 TraceCheckUtils]: 56: Hoare triple {22761#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22761#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:54:49,227 INFO L290 TraceCheckUtils]: 57: Hoare triple {22761#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22762#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:54:49,228 INFO L290 TraceCheckUtils]: 58: Hoare triple {22762#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22762#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:54:49,251 INFO L290 TraceCheckUtils]: 59: Hoare triple {22762#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22763#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:54:49,252 INFO L290 TraceCheckUtils]: 60: Hoare triple {22763#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {22763#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:54:49,280 INFO L290 TraceCheckUtils]: 61: Hoare triple {22763#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22764#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:54:49,280 INFO L290 TraceCheckUtils]: 62: Hoare triple {22764#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {22764#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:54:49,307 INFO L290 TraceCheckUtils]: 63: Hoare triple {22764#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22765#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:54:49,308 INFO L290 TraceCheckUtils]: 64: Hoare triple {22765#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22765#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:54:49,335 INFO L290 TraceCheckUtils]: 65: Hoare triple {22765#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22766#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:54:49,336 INFO L290 TraceCheckUtils]: 66: Hoare triple {22766#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {22766#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:54:49,365 INFO L290 TraceCheckUtils]: 67: Hoare triple {22766#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22767#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:54:49,365 INFO L290 TraceCheckUtils]: 68: Hoare triple {22767#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {22767#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:54:49,393 INFO L290 TraceCheckUtils]: 69: Hoare triple {22767#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22768#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:54:49,394 INFO L290 TraceCheckUtils]: 70: Hoare triple {22768#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22768#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:54:49,422 INFO L290 TraceCheckUtils]: 71: Hoare triple {22768#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22769#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:54:49,423 INFO L290 TraceCheckUtils]: 72: Hoare triple {22769#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22769#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:54:49,431 INFO L290 TraceCheckUtils]: 73: Hoare triple {22769#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22770#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:54:49,432 INFO L290 TraceCheckUtils]: 74: Hoare triple {22770#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {22770#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:54:49,433 INFO L290 TraceCheckUtils]: 75: Hoare triple {22770#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {22732#false} is VALID [2022-04-15 12:54:49,433 INFO L290 TraceCheckUtils]: 76: Hoare triple {22732#false} assume !(~x~0 % 4294967296 < 100000000); {22732#false} is VALID [2022-04-15 12:54:49,433 INFO L272 TraceCheckUtils]: 77: Hoare triple {22732#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {22732#false} is VALID [2022-04-15 12:54:49,433 INFO L290 TraceCheckUtils]: 78: Hoare triple {22732#false} ~cond := #in~cond; {22732#false} is VALID [2022-04-15 12:54:49,434 INFO L290 TraceCheckUtils]: 79: Hoare triple {22732#false} assume 0 == ~cond; {22732#false} is VALID [2022-04-15 12:54:49,434 INFO L290 TraceCheckUtils]: 80: Hoare triple {22732#false} assume !false; {22732#false} is VALID [2022-04-15 12:54:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 35 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:54:49,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:54:49,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076985360] [2022-04-15 12:54:49,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076985360] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:54:49,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356831370] [2022-04-15 12:54:49,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:54:49,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:54:49,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:54:49,435 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:54:49,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 12:54:49,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:54:49,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:54:49,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-15 12:54:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:49,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:54:50,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {22731#true} call ULTIMATE.init(); {22731#true} is VALID [2022-04-15 12:54:50,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {22731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22731#true} is VALID [2022-04-15 12:54:50,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {22731#true} assume true; {22731#true} is VALID [2022-04-15 12:54:50,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22731#true} {22731#true} #40#return; {22731#true} is VALID [2022-04-15 12:54:50,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {22731#true} call #t~ret5 := main(); {22731#true} is VALID [2022-04-15 12:54:50,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {22731#true} ~x~0 := 0; {22736#(= main_~x~0 0)} is VALID [2022-04-15 12:54:50,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {22736#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {22736#(= main_~x~0 0)} is VALID [2022-04-15 12:54:50,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {22736#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22737#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:54:50,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {22737#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {22737#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:54:50,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {22737#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22738#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:54:50,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {22738#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {22738#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:54:50,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {22738#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22739#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:54:50,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {22739#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22739#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:54:50,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {22739#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22740#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:54:50,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {22740#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22740#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:54:50,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {22740#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22741#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:54:50,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {22741#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {22741#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:54:50,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {22741#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22742#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:54:50,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {22742#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {22742#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:54:50,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {22742#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22743#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:54:50,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {22743#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22743#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:54:50,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {22743#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22744#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:54:50,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {22744#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22744#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:54:50,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {22744#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22745#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:54:50,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {22745#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22745#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:54:50,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {22745#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22746#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:54:50,484 INFO L290 TraceCheckUtils]: 26: Hoare triple {22746#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22746#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:54:50,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {22746#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22747#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:54:50,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {22747#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22747#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:54:50,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {22747#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22748#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:54:50,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {22748#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22748#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:54:50,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {22748#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22749#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:54:50,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {22749#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22749#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:54:50,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {22749#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22750#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:54:50,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {22750#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {22750#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:54:50,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {22750#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22751#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:54:50,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {22751#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {22751#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:54:50,642 INFO L290 TraceCheckUtils]: 37: Hoare triple {22751#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22752#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:54:50,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {22752#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22752#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:54:50,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {22752#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22753#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:54:50,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {22753#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {22753#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:54:50,701 INFO L290 TraceCheckUtils]: 41: Hoare triple {22753#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22754#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:54:50,701 INFO L290 TraceCheckUtils]: 42: Hoare triple {22754#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22754#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:54:50,723 INFO L290 TraceCheckUtils]: 43: Hoare triple {22754#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22755#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:54:50,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {22755#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {22755#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:54:50,752 INFO L290 TraceCheckUtils]: 45: Hoare triple {22755#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22756#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:54:50,752 INFO L290 TraceCheckUtils]: 46: Hoare triple {22756#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22756#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:54:50,779 INFO L290 TraceCheckUtils]: 47: Hoare triple {22756#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22757#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:54:50,780 INFO L290 TraceCheckUtils]: 48: Hoare triple {22757#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {22757#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:54:50,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {22757#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22758#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:54:50,812 INFO L290 TraceCheckUtils]: 50: Hoare triple {22758#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {22758#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:54:50,842 INFO L290 TraceCheckUtils]: 51: Hoare triple {22758#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22759#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:54:50,842 INFO L290 TraceCheckUtils]: 52: Hoare triple {22759#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {22759#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:54:50,869 INFO L290 TraceCheckUtils]: 53: Hoare triple {22759#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22760#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:54:50,870 INFO L290 TraceCheckUtils]: 54: Hoare triple {22760#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22760#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:54:50,900 INFO L290 TraceCheckUtils]: 55: Hoare triple {22760#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22761#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:54:50,900 INFO L290 TraceCheckUtils]: 56: Hoare triple {22761#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22761#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:54:50,929 INFO L290 TraceCheckUtils]: 57: Hoare triple {22761#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22762#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:54:50,930 INFO L290 TraceCheckUtils]: 58: Hoare triple {22762#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22762#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:54:50,952 INFO L290 TraceCheckUtils]: 59: Hoare triple {22762#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22763#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:54:50,952 INFO L290 TraceCheckUtils]: 60: Hoare triple {22763#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {22763#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:54:50,983 INFO L290 TraceCheckUtils]: 61: Hoare triple {22763#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22764#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:54:50,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {22764#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {22764#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:54:51,016 INFO L290 TraceCheckUtils]: 63: Hoare triple {22764#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22765#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:54:51,017 INFO L290 TraceCheckUtils]: 64: Hoare triple {22765#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22765#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:54:51,050 INFO L290 TraceCheckUtils]: 65: Hoare triple {22765#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22766#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:54:51,050 INFO L290 TraceCheckUtils]: 66: Hoare triple {22766#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {22766#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:54:51,084 INFO L290 TraceCheckUtils]: 67: Hoare triple {22766#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22767#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:54:51,087 INFO L290 TraceCheckUtils]: 68: Hoare triple {22767#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {22767#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:54:51,118 INFO L290 TraceCheckUtils]: 69: Hoare triple {22767#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22768#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:54:51,119 INFO L290 TraceCheckUtils]: 70: Hoare triple {22768#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22768#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:54:51,143 INFO L290 TraceCheckUtils]: 71: Hoare triple {22768#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22769#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:54:51,144 INFO L290 TraceCheckUtils]: 72: Hoare triple {22769#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22769#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:54:51,170 INFO L290 TraceCheckUtils]: 73: Hoare triple {22769#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22994#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:54:51,171 INFO L290 TraceCheckUtils]: 74: Hoare triple {22994#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22994#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:54:51,193 INFO L290 TraceCheckUtils]: 75: Hoare triple {22994#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {22732#false} is VALID [2022-04-15 12:54:51,193 INFO L290 TraceCheckUtils]: 76: Hoare triple {22732#false} assume !(~x~0 % 4294967296 < 100000000); {22732#false} is VALID [2022-04-15 12:54:51,193 INFO L272 TraceCheckUtils]: 77: Hoare triple {22732#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {22732#false} is VALID [2022-04-15 12:54:51,193 INFO L290 TraceCheckUtils]: 78: Hoare triple {22732#false} ~cond := #in~cond; {22732#false} is VALID [2022-04-15 12:54:51,193 INFO L290 TraceCheckUtils]: 79: Hoare triple {22732#false} assume 0 == ~cond; {22732#false} is VALID [2022-04-15 12:54:51,193 INFO L290 TraceCheckUtils]: 80: Hoare triple {22732#false} assume !false; {22732#false} is VALID [2022-04-15 12:54:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 35 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:54:51,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:55:20,091 INFO L290 TraceCheckUtils]: 80: Hoare triple {22732#false} assume !false; {22732#false} is VALID [2022-04-15 12:55:20,091 INFO L290 TraceCheckUtils]: 79: Hoare triple {22732#false} assume 0 == ~cond; {22732#false} is VALID [2022-04-15 12:55:20,091 INFO L290 TraceCheckUtils]: 78: Hoare triple {22732#false} ~cond := #in~cond; {22732#false} is VALID [2022-04-15 12:55:20,091 INFO L272 TraceCheckUtils]: 77: Hoare triple {22732#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {22732#false} is VALID [2022-04-15 12:55:20,091 INFO L290 TraceCheckUtils]: 76: Hoare triple {22732#false} assume !(~x~0 % 4294967296 < 100000000); {22732#false} is VALID [2022-04-15 12:55:20,092 INFO L290 TraceCheckUtils]: 75: Hoare triple {23031#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {22732#false} is VALID [2022-04-15 12:55:20,092 INFO L290 TraceCheckUtils]: 74: Hoare triple {23035#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23031#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:55:20,100 INFO L290 TraceCheckUtils]: 73: Hoare triple {23039#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23035#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,101 INFO L290 TraceCheckUtils]: 72: Hoare triple {23039#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23039#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,109 INFO L290 TraceCheckUtils]: 71: Hoare triple {23046#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23039#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,110 INFO L290 TraceCheckUtils]: 70: Hoare triple {23046#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23046#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,117 INFO L290 TraceCheckUtils]: 69: Hoare triple {23053#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23046#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,118 INFO L290 TraceCheckUtils]: 68: Hoare triple {23053#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {23053#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,128 INFO L290 TraceCheckUtils]: 67: Hoare triple {23060#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23053#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,128 INFO L290 TraceCheckUtils]: 66: Hoare triple {23060#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23060#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {23067#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23060#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,134 INFO L290 TraceCheckUtils]: 64: Hoare triple {23067#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {23067#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,138 INFO L290 TraceCheckUtils]: 63: Hoare triple {23074#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23067#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,139 INFO L290 TraceCheckUtils]: 62: Hoare triple {23074#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {23074#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,146 INFO L290 TraceCheckUtils]: 61: Hoare triple {23081#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23074#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,147 INFO L290 TraceCheckUtils]: 60: Hoare triple {23081#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {23081#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,149 INFO L290 TraceCheckUtils]: 59: Hoare triple {23088#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23081#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,149 INFO L290 TraceCheckUtils]: 58: Hoare triple {23088#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {23088#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {23095#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23088#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,156 INFO L290 TraceCheckUtils]: 56: Hoare triple {23095#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23095#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,158 INFO L290 TraceCheckUtils]: 55: Hoare triple {23102#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23095#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {23102#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23102#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,166 INFO L290 TraceCheckUtils]: 53: Hoare triple {23109#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23102#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,167 INFO L290 TraceCheckUtils]: 52: Hoare triple {23109#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {23109#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,171 INFO L290 TraceCheckUtils]: 51: Hoare triple {23116#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23109#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,172 INFO L290 TraceCheckUtils]: 50: Hoare triple {23116#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {23116#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,177 INFO L290 TraceCheckUtils]: 49: Hoare triple {23123#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23116#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,177 INFO L290 TraceCheckUtils]: 48: Hoare triple {23123#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23123#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,181 INFO L290 TraceCheckUtils]: 47: Hoare triple {23130#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23123#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,182 INFO L290 TraceCheckUtils]: 46: Hoare triple {23130#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23130#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {23137#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23130#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {23137#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23137#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {23144#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23137#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {23144#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23144#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,196 INFO L290 TraceCheckUtils]: 41: Hoare triple {23151#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23144#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,196 INFO L290 TraceCheckUtils]: 40: Hoare triple {23151#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23151#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {23158#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23151#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,198 INFO L290 TraceCheckUtils]: 38: Hoare triple {23158#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23158#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,205 INFO L290 TraceCheckUtils]: 37: Hoare triple {23165#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23158#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {23165#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23165#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {23172#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23165#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {23172#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23172#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {23179#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23172#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,216 INFO L290 TraceCheckUtils]: 32: Hoare triple {23179#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23179#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {23186#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23179#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {23186#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23186#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {23193#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23186#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {23193#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23193#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {23200#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23193#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {23200#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23200#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {23207#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23200#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {23207#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {23207#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {23214#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23207#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {23214#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23214#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {23221#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23214#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {23221#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23221#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {23228#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23221#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {23228#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {23228#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {23235#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23228#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {23235#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23235#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {23242#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23235#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {23242#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23242#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {23249#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23242#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {23249#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23249#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {23256#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23249#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {23256#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23256#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {23263#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23256#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {23263#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {23263#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {23270#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23263#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} is VALID [2022-04-15 12:55:20,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {23270#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {23270#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {22731#true} ~x~0 := 0; {23270#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} is VALID [2022-04-15 12:55:20,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {22731#true} call #t~ret5 := main(); {22731#true} is VALID [2022-04-15 12:55:20,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22731#true} {22731#true} #40#return; {22731#true} is VALID [2022-04-15 12:55:20,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {22731#true} assume true; {22731#true} is VALID [2022-04-15 12:55:20,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {22731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22731#true} is VALID [2022-04-15 12:55:20,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {22731#true} call ULTIMATE.init(); {22731#true} is VALID [2022-04-15 12:55:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 35 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:20,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356831370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:55:20,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:55:20,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 38] total 75 [2022-04-15 12:55:20,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:20,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [332967191] [2022-04-15 12:55:20,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [332967191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:20,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:20,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 12:55:20,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160213563] [2022-04-15 12:55:20,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:20,285 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 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 81 [2022-04-15 12:55:20,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:20,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 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-15 12:55:21,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:21,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 12:55:21,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:21,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 12:55:21,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1479, Invalid=4071, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 12:55:21,565 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 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-15 12:56:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:47,407 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-15 12:56:47,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 12:56:47,407 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 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 81 [2022-04-15 12:56:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:47,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 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-15 12:56:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 93 transitions. [2022-04-15 12:56:47,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 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-15 12:56:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 93 transitions. [2022-04-15 12:56:47,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 93 transitions. [2022-04-15 12:56:48,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:48,997 INFO L225 Difference]: With dead ends: 92 [2022-04-15 12:56:48,998 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 12:56:48,998 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=2947, Invalid=9043, Unknown=0, NotChecked=0, Total=11990 [2022-04-15 12:56:48,999 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2529 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:48,999 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 164 Invalid, 2600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2529 Invalid, 0 Unknown, 0 Unchecked, 29.9s Time] [2022-04-15 12:56:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 12:56:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-15 12:56:49,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:49,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 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-15 12:56:49,176 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 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-15 12:56:49,176 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 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-15 12:56:49,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:49,177 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2022-04-15 12:56:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2022-04-15 12:56:49,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:49,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:49,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 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 85 states. [2022-04-15 12:56:49,178 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 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 85 states. [2022-04-15 12:56:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:49,178 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2022-04-15 12:56:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2022-04-15 12:56:49,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:49,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:49,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:49,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 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-15 12:56:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2022-04-15 12:56:49,180 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 81 [2022-04-15 12:56:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:49,180 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2022-04-15 12:56:49,180 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 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-15 12:56:49,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 87 transitions. [2022-04-15 12:56:50,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2022-04-15 12:56:50,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 12:56:50,316 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:50,316 INFO L499 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:50,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 12:56:50,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-04-15 12:56:50,527 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:50,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:50,528 INFO L85 PathProgramCache]: Analyzing trace with hash -189328780, now seen corresponding path program 69 times [2022-04-15 12:56:50,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:50,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [965909805] [2022-04-15 12:56:50,729 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:56:50,730 INFO L85 PathProgramCache]: Analyzing trace with hash 765511537, now seen corresponding path program 1 times [2022-04-15 12:56:50,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:50,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442944117] [2022-04-15 12:56:50,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:50,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:56:50,736 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:56:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:56:50,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:56:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash -189328780, now seen corresponding path program 70 times [2022-04-15 12:56:50,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:50,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296928423] [2022-04-15 12:56:50,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:50,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:51,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:51,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {23929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23888#true} is VALID [2022-04-15 12:56:51,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {23888#true} assume true; {23888#true} is VALID [2022-04-15 12:56:51,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23888#true} {23888#true} #40#return; {23888#true} is VALID [2022-04-15 12:56:51,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {23888#true} call ULTIMATE.init(); {23929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:51,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {23929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23888#true} is VALID [2022-04-15 12:56:51,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {23888#true} assume true; {23888#true} is VALID [2022-04-15 12:56:51,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23888#true} {23888#true} #40#return; {23888#true} is VALID [2022-04-15 12:56:51,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {23888#true} call #t~ret5 := main(); {23888#true} is VALID [2022-04-15 12:56:51,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {23888#true} ~x~0 := 0; {23893#(= main_~x~0 0)} is VALID [2022-04-15 12:56:51,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {23893#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {23893#(= main_~x~0 0)} is VALID [2022-04-15 12:56:51,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {23893#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23894#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:56:51,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {23894#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {23894#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:56:51,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {23894#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:56:51,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {23895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {23895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:56:51,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {23895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23896#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:56:51,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {23896#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23896#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:56:51,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {23896#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23897#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:56:51,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {23897#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23897#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:56:51,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {23897#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23898#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:56:51,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {23898#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {23898#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:56:51,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {23898#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23899#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:56:51,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {23899#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {23899#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:56:51,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {23899#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23900#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:56:51,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {23900#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23900#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:56:51,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {23900#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23901#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:56:51,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {23901#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23901#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:56:51,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {23901#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23902#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:56:51,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {23902#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23902#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:56:51,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {23902#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23903#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:56:51,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {23903#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23903#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:56:51,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {23903#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23904#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:56:51,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {23904#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23904#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:56:51,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {23904#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23905#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:56:51,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {23905#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23905#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:56:52,020 INFO L290 TraceCheckUtils]: 31: Hoare triple {23905#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23906#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:56:52,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {23906#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23906#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:56:52,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {23906#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23907#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:56:52,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {23907#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {23907#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:56:52,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {23907#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23908#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:56:52,077 INFO L290 TraceCheckUtils]: 36: Hoare triple {23908#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {23908#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:56:52,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {23908#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23909#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:56:52,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {23909#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23909#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:56:52,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {23909#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23910#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:56:52,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {23910#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {23910#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:56:52,170 INFO L290 TraceCheckUtils]: 41: Hoare triple {23910#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23911#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:56:52,170 INFO L290 TraceCheckUtils]: 42: Hoare triple {23911#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23911#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:56:52,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {23911#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23912#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:56:52,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {23912#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {23912#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:56:52,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {23912#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23913#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:56:52,230 INFO L290 TraceCheckUtils]: 46: Hoare triple {23913#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23913#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:56:52,261 INFO L290 TraceCheckUtils]: 47: Hoare triple {23913#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23914#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:56:52,261 INFO L290 TraceCheckUtils]: 48: Hoare triple {23914#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {23914#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:56:52,293 INFO L290 TraceCheckUtils]: 49: Hoare triple {23914#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23915#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:56:52,293 INFO L290 TraceCheckUtils]: 50: Hoare triple {23915#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {23915#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:56:52,325 INFO L290 TraceCheckUtils]: 51: Hoare triple {23915#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23916#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:56:52,326 INFO L290 TraceCheckUtils]: 52: Hoare triple {23916#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {23916#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:56:52,359 INFO L290 TraceCheckUtils]: 53: Hoare triple {23916#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23917#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:56:52,360 INFO L290 TraceCheckUtils]: 54: Hoare triple {23917#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23917#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:56:52,393 INFO L290 TraceCheckUtils]: 55: Hoare triple {23917#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23918#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:56:52,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {23918#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23918#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:56:52,426 INFO L290 TraceCheckUtils]: 57: Hoare triple {23918#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23919#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:56:52,427 INFO L290 TraceCheckUtils]: 58: Hoare triple {23919#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23919#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:56:52,451 INFO L290 TraceCheckUtils]: 59: Hoare triple {23919#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23920#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:56:52,452 INFO L290 TraceCheckUtils]: 60: Hoare triple {23920#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {23920#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:56:52,484 INFO L290 TraceCheckUtils]: 61: Hoare triple {23920#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23921#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:56:52,485 INFO L290 TraceCheckUtils]: 62: Hoare triple {23921#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {23921#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:56:52,517 INFO L290 TraceCheckUtils]: 63: Hoare triple {23921#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23922#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:56:52,517 INFO L290 TraceCheckUtils]: 64: Hoare triple {23922#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23922#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:56:52,551 INFO L290 TraceCheckUtils]: 65: Hoare triple {23922#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23923#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:56:52,552 INFO L290 TraceCheckUtils]: 66: Hoare triple {23923#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {23923#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:56:52,587 INFO L290 TraceCheckUtils]: 67: Hoare triple {23923#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23924#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:56:52,587 INFO L290 TraceCheckUtils]: 68: Hoare triple {23924#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {23924#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:56:52,620 INFO L290 TraceCheckUtils]: 69: Hoare triple {23924#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23925#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:56:52,620 INFO L290 TraceCheckUtils]: 70: Hoare triple {23925#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23925#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:56:52,652 INFO L290 TraceCheckUtils]: 71: Hoare triple {23925#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23926#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:56:52,653 INFO L290 TraceCheckUtils]: 72: Hoare triple {23926#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23926#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:56:52,685 INFO L290 TraceCheckUtils]: 73: Hoare triple {23926#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23927#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:56:52,685 INFO L290 TraceCheckUtils]: 74: Hoare triple {23927#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23927#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:56:52,694 INFO L290 TraceCheckUtils]: 75: Hoare triple {23927#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23928#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:56:52,695 INFO L290 TraceCheckUtils]: 76: Hoare triple {23928#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {23928#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:56:52,696 INFO L290 TraceCheckUtils]: 77: Hoare triple {23928#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {23889#false} is VALID [2022-04-15 12:56:52,697 INFO L290 TraceCheckUtils]: 78: Hoare triple {23889#false} assume !(~x~0 % 4294967296 < 100000000); {23889#false} is VALID [2022-04-15 12:56:52,697 INFO L272 TraceCheckUtils]: 79: Hoare triple {23889#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {23889#false} is VALID [2022-04-15 12:56:52,697 INFO L290 TraceCheckUtils]: 80: Hoare triple {23889#false} ~cond := #in~cond; {23889#false} is VALID [2022-04-15 12:56:52,697 INFO L290 TraceCheckUtils]: 81: Hoare triple {23889#false} assume 0 == ~cond; {23889#false} is VALID [2022-04-15 12:56:52,697 INFO L290 TraceCheckUtils]: 82: Hoare triple {23889#false} assume !false; {23889#false} is VALID [2022-04-15 12:56:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 36 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:52,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:52,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296928423] [2022-04-15 12:56:52,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296928423] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:52,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399097349] [2022-04-15 12:56:52,698 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:56:52,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:52,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:52,704 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:56:52,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 12:56:52,829 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:56:52,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:56:52,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 74 conjunts are in the unsatisfiable core [2022-04-15 12:56:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:52,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:53,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {23888#true} call ULTIMATE.init(); {23888#true} is VALID [2022-04-15 12:56:53,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {23888#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23888#true} is VALID [2022-04-15 12:56:53,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {23888#true} assume true; {23888#true} is VALID [2022-04-15 12:56:53,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23888#true} {23888#true} #40#return; {23888#true} is VALID [2022-04-15 12:56:53,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {23888#true} call #t~ret5 := main(); {23888#true} is VALID [2022-04-15 12:56:53,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {23888#true} ~x~0 := 0; {23893#(= main_~x~0 0)} is VALID [2022-04-15 12:56:53,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {23893#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {23893#(= main_~x~0 0)} is VALID [2022-04-15 12:56:53,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {23893#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23894#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:56:53,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {23894#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {23894#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:56:53,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {23894#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:56:53,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {23895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {23895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:56:53,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {23895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23896#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:56:53,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {23896#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23896#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:56:53,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {23896#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23897#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:56:53,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {23897#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23897#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:56:53,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {23897#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23898#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:56:53,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {23898#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {23898#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:56:53,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {23898#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23899#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:56:53,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {23899#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {23899#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:56:53,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {23899#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23900#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:56:53,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {23900#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23900#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:56:53,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {23900#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23901#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:56:53,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {23901#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23901#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:56:53,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {23901#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23902#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:56:53,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {23902#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23902#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:56:53,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {23902#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23903#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:56:53,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {23903#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23903#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:56:53,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {23903#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23904#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:56:53,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {23904#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23904#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:56:53,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {23904#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23905#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:56:53,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {23905#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23905#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:56:53,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {23905#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23906#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:56:53,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {23906#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23906#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:56:53,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {23906#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23907#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:56:53,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {23907#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {23907#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:56:53,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {23907#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23908#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:56:53,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {23908#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {23908#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:56:54,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {23908#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23909#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:56:54,030 INFO L290 TraceCheckUtils]: 38: Hoare triple {23909#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23909#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:56:54,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {23909#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23910#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:56:54,061 INFO L290 TraceCheckUtils]: 40: Hoare triple {23910#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {23910#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:56:54,092 INFO L290 TraceCheckUtils]: 41: Hoare triple {23910#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23911#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:56:54,093 INFO L290 TraceCheckUtils]: 42: Hoare triple {23911#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23911#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:56:54,117 INFO L290 TraceCheckUtils]: 43: Hoare triple {23911#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23912#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:56:54,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {23912#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {23912#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:56:54,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {23912#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23913#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:56:54,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {23913#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23913#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:56:54,188 INFO L290 TraceCheckUtils]: 47: Hoare triple {23913#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23914#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:56:54,189 INFO L290 TraceCheckUtils]: 48: Hoare triple {23914#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {23914#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:56:54,219 INFO L290 TraceCheckUtils]: 49: Hoare triple {23914#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23915#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:56:54,220 INFO L290 TraceCheckUtils]: 50: Hoare triple {23915#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {23915#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:56:54,251 INFO L290 TraceCheckUtils]: 51: Hoare triple {23915#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23916#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:56:54,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {23916#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {23916#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:56:54,282 INFO L290 TraceCheckUtils]: 53: Hoare triple {23916#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23917#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:56:54,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {23917#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23917#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:56:54,313 INFO L290 TraceCheckUtils]: 55: Hoare triple {23917#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23918#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:56:54,314 INFO L290 TraceCheckUtils]: 56: Hoare triple {23918#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23918#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:56:54,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {23918#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23919#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:56:54,349 INFO L290 TraceCheckUtils]: 58: Hoare triple {23919#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23919#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:56:54,374 INFO L290 TraceCheckUtils]: 59: Hoare triple {23919#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23920#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:56:54,374 INFO L290 TraceCheckUtils]: 60: Hoare triple {23920#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {23920#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:56:54,406 INFO L290 TraceCheckUtils]: 61: Hoare triple {23920#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23921#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:56:54,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {23921#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {23921#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:56:54,438 INFO L290 TraceCheckUtils]: 63: Hoare triple {23921#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23922#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:56:54,438 INFO L290 TraceCheckUtils]: 64: Hoare triple {23922#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23922#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:56:54,470 INFO L290 TraceCheckUtils]: 65: Hoare triple {23922#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23923#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:56:54,470 INFO L290 TraceCheckUtils]: 66: Hoare triple {23923#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {23923#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:56:54,502 INFO L290 TraceCheckUtils]: 67: Hoare triple {23923#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23924#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:56:54,502 INFO L290 TraceCheckUtils]: 68: Hoare triple {23924#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {23924#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:56:54,535 INFO L290 TraceCheckUtils]: 69: Hoare triple {23924#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23925#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:56:54,536 INFO L290 TraceCheckUtils]: 70: Hoare triple {23925#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23925#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:56:54,568 INFO L290 TraceCheckUtils]: 71: Hoare triple {23925#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23926#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:56:54,569 INFO L290 TraceCheckUtils]: 72: Hoare triple {23926#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23926#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:56:54,603 INFO L290 TraceCheckUtils]: 73: Hoare triple {23926#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23927#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:56:54,603 INFO L290 TraceCheckUtils]: 74: Hoare triple {23927#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23927#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:56:54,634 INFO L290 TraceCheckUtils]: 75: Hoare triple {23927#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24158#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:56:54,635 INFO L290 TraceCheckUtils]: 76: Hoare triple {24158#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !!(~x~0 % 4294967296 < 100000000); {24158#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:56:54,660 INFO L290 TraceCheckUtils]: 77: Hoare triple {24158#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {23889#false} is VALID [2022-04-15 12:56:54,660 INFO L290 TraceCheckUtils]: 78: Hoare triple {23889#false} assume !(~x~0 % 4294967296 < 100000000); {23889#false} is VALID [2022-04-15 12:56:54,660 INFO L272 TraceCheckUtils]: 79: Hoare triple {23889#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {23889#false} is VALID [2022-04-15 12:56:54,661 INFO L290 TraceCheckUtils]: 80: Hoare triple {23889#false} ~cond := #in~cond; {23889#false} is VALID [2022-04-15 12:56:54,661 INFO L290 TraceCheckUtils]: 81: Hoare triple {23889#false} assume 0 == ~cond; {23889#false} is VALID [2022-04-15 12:56:54,661 INFO L290 TraceCheckUtils]: 82: Hoare triple {23889#false} assume !false; {23889#false} is VALID [2022-04-15 12:56:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 36 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:54,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:57:28,645 INFO L290 TraceCheckUtils]: 82: Hoare triple {23889#false} assume !false; {23889#false} is VALID [2022-04-15 12:57:28,645 INFO L290 TraceCheckUtils]: 81: Hoare triple {23889#false} assume 0 == ~cond; {23889#false} is VALID [2022-04-15 12:57:28,645 INFO L290 TraceCheckUtils]: 80: Hoare triple {23889#false} ~cond := #in~cond; {23889#false} is VALID [2022-04-15 12:57:28,645 INFO L272 TraceCheckUtils]: 79: Hoare triple {23889#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {23889#false} is VALID [2022-04-15 12:57:28,646 INFO L290 TraceCheckUtils]: 78: Hoare triple {23889#false} assume !(~x~0 % 4294967296 < 100000000); {23889#false} is VALID [2022-04-15 12:57:28,646 INFO L290 TraceCheckUtils]: 77: Hoare triple {24195#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {23889#false} is VALID [2022-04-15 12:57:28,646 INFO L290 TraceCheckUtils]: 76: Hoare triple {24199#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24195#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:57:28,655 INFO L290 TraceCheckUtils]: 75: Hoare triple {24203#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24199#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,655 INFO L290 TraceCheckUtils]: 74: Hoare triple {24203#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24203#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,665 INFO L290 TraceCheckUtils]: 73: Hoare triple {24210#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24203#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,666 INFO L290 TraceCheckUtils]: 72: Hoare triple {24210#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24210#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,675 INFO L290 TraceCheckUtils]: 71: Hoare triple {24217#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24210#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,676 INFO L290 TraceCheckUtils]: 70: Hoare triple {24217#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24217#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,687 INFO L290 TraceCheckUtils]: 69: Hoare triple {24224#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24217#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,688 INFO L290 TraceCheckUtils]: 68: Hoare triple {24224#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24224#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,696 INFO L290 TraceCheckUtils]: 67: Hoare triple {24231#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24224#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,697 INFO L290 TraceCheckUtils]: 66: Hoare triple {24231#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24231#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,705 INFO L290 TraceCheckUtils]: 65: Hoare triple {24238#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24231#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,706 INFO L290 TraceCheckUtils]: 64: Hoare triple {24238#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24238#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,714 INFO L290 TraceCheckUtils]: 63: Hoare triple {24245#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24238#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,715 INFO L290 TraceCheckUtils]: 62: Hoare triple {24245#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24245#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,717 INFO L290 TraceCheckUtils]: 61: Hoare triple {24252#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24245#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,717 INFO L290 TraceCheckUtils]: 60: Hoare triple {24252#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24252#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,727 INFO L290 TraceCheckUtils]: 59: Hoare triple {24259#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24252#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,728 INFO L290 TraceCheckUtils]: 58: Hoare triple {24259#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24259#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {24266#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24259#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {24266#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24266#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {24273#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24266#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {24273#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24273#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,754 INFO L290 TraceCheckUtils]: 53: Hoare triple {24280#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24273#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,754 INFO L290 TraceCheckUtils]: 52: Hoare triple {24280#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24280#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,763 INFO L290 TraceCheckUtils]: 51: Hoare triple {24287#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24280#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,764 INFO L290 TraceCheckUtils]: 50: Hoare triple {24287#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24287#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {24294#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24287#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,773 INFO L290 TraceCheckUtils]: 48: Hoare triple {24294#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24294#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {24301#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24294#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,783 INFO L290 TraceCheckUtils]: 46: Hoare triple {24301#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24301#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {24308#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24301#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {24308#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24308#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {24315#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24308#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,804 INFO L290 TraceCheckUtils]: 42: Hoare triple {24315#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24315#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,806 INFO L290 TraceCheckUtils]: 41: Hoare triple {24322#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24315#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,806 INFO L290 TraceCheckUtils]: 40: Hoare triple {24322#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24322#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {24329#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24322#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {24329#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24329#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {24336#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24329#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {24336#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24336#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,833 INFO L290 TraceCheckUtils]: 35: Hoare triple {24343#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24336#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,833 INFO L290 TraceCheckUtils]: 34: Hoare triple {24343#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24343#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,835 INFO L290 TraceCheckUtils]: 33: Hoare triple {24350#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24343#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {24350#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24350#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {24357#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24350#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {24357#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24357#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {24364#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24357#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {24364#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24364#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {24371#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24364#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {24371#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24371#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {24378#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24371#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {24378#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24378#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {24385#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24378#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {24385#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24385#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {24392#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24385#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {24392#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24392#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {24399#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24392#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {24399#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24399#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {24406#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24399#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {24406#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24406#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {24413#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24406#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {24413#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24413#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {24420#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24413#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {24420#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24420#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {24427#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24420#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {24427#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24427#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {24434#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24427#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} is VALID [2022-04-15 12:57:28,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {24434#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24434#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {24441#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 100000000)) (< (mod (+ 35 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24434#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {24441#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 100000000)) (< (mod (+ 35 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24441#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 100000000)) (< (mod (+ 35 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {23888#true} ~x~0 := 0; {24441#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 100000000)) (< (mod (+ 35 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:57:28,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {23888#true} call #t~ret5 := main(); {23888#true} is VALID [2022-04-15 12:57:28,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23888#true} {23888#true} #40#return; {23888#true} is VALID [2022-04-15 12:57:28,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {23888#true} assume true; {23888#true} is VALID [2022-04-15 12:57:28,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {23888#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23888#true} is VALID [2022-04-15 12:57:28,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {23888#true} call ULTIMATE.init(); {23888#true} is VALID [2022-04-15 12:57:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 36 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:57:28,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399097349] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:57:28,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:57:28,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 39] total 77 [2022-04-15 12:57:28,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:57:28,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [965909805] [2022-04-15 12:57:28,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [965909805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:28,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:28,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 12:57:28,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29950030] [2022-04-15 12:57:28,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:57:28,942 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 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 83 [2022-04-15 12:57:28,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:57:28,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 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-15 12:57:30,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:30,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 12:57:30,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:30,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 12:57:30,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1557, Invalid=4295, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 12:57:30,401 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 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-15 12:59:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:11,577 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-04-15 12:59:11,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 12:59:11,577 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 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 83 [2022-04-15 12:59:11,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:59:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 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-15 12:59:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 95 transitions. [2022-04-15 12:59:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 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-15 12:59:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 95 transitions. [2022-04-15 12:59:11,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 95 transitions. [2022-04-15 12:59:13,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:13,424 INFO L225 Difference]: With dead ends: 94 [2022-04-15 12:59:13,424 INFO L226 Difference]: Without dead ends: 87 [2022-04-15 12:59:13,424 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=3103, Invalid=9553, Unknown=0, NotChecked=0, Total=12656 [2022-04-15 12:59:13,425 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2626 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 2699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:59:13,425 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 129 Invalid, 2699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2626 Invalid, 0 Unknown, 0 Unchecked, 35.6s Time] [2022-04-15 12:59:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-15 12:59:13,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-15 12:59:13,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:59:13,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 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-15 12:59:13,617 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 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-15 12:59:13,617 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 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-15 12:59:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:13,618 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-15 12:59:13,618 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-15 12:59:13,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:13,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:13,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 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 87 states. [2022-04-15 12:59:13,619 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 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 87 states. [2022-04-15 12:59:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:13,620 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-15 12:59:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-15 12:59:13,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:13,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:13,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:59:13,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:59:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 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-15 12:59:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2022-04-15 12:59:13,621 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2022-04-15 12:59:13,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:59:13,622 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2022-04-15 12:59:13,622 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 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-15 12:59:13,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 89 transitions. [2022-04-15 12:59:14,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-15 12:59:14,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 12:59:14,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:59:14,965 INFO L499 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:59:14,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-15 12:59:15,165 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,SelfDestructingSolverStorable72,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:15,166 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:59:15,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:59:15,166 INFO L85 PathProgramCache]: Analyzing trace with hash 385605905, now seen corresponding path program 71 times [2022-04-15 12:59:15,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:15,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [713603142] [2022-04-15 12:59:15,402 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:59:15,403 INFO L85 PathProgramCache]: Analyzing trace with hash 824616881, now seen corresponding path program 1 times [2022-04-15 12:59:15,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:59:15,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458705204] [2022-04-15 12:59:15,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:15,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:59:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:59:15,410 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:59:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:59:15,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:59:15,414 INFO L85 PathProgramCache]: Analyzing trace with hash 385605905, now seen corresponding path program 72 times [2022-04-15 12:59:15,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:59:15,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801984351] [2022-04-15 12:59:15,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:15,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:59:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:16,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:59:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:16,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {25115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {25073#true} is VALID [2022-04-15 12:59:16,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {25073#true} assume true; {25073#true} is VALID [2022-04-15 12:59:16,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25073#true} {25073#true} #40#return; {25073#true} is VALID [2022-04-15 12:59:16,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {25073#true} call ULTIMATE.init(); {25115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:59:16,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {25115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {25073#true} is VALID [2022-04-15 12:59:16,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {25073#true} assume true; {25073#true} is VALID [2022-04-15 12:59:16,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25073#true} {25073#true} #40#return; {25073#true} is VALID [2022-04-15 12:59:16,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {25073#true} call #t~ret5 := main(); {25073#true} is VALID [2022-04-15 12:59:16,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {25073#true} ~x~0 := 0; {25078#(= main_~x~0 0)} is VALID [2022-04-15 12:59:16,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {25078#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {25078#(= main_~x~0 0)} is VALID [2022-04-15 12:59:16,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {25078#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25079#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:59:16,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {25079#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {25079#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:59:16,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {25079#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25080#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:59:16,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {25080#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {25080#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:59:16,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {25080#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25081#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:59:16,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {25081#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25081#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:59:16,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {25081#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25082#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:59:16,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {25082#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25082#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:59:16,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {25082#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25083#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:59:16,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {25083#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {25083#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:59:16,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {25083#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25084#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:59:16,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {25084#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {25084#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:59:16,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {25084#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25085#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:59:16,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {25085#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25085#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:59:16,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {25085#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25086#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:59:16,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {25086#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25086#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:59:16,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {25086#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25087#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:59:16,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {25087#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25087#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:59:16,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {25087#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:59:16,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {25088#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25088#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:59:16,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {25088#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25089#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:59:16,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {25089#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25089#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:59:16,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {25089#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25090#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:59:16,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {25090#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25090#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:59:16,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {25090#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25091#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:59:16,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {25091#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25091#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:59:16,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {25091#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25092#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:59:16,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {25092#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {25092#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:59:16,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {25092#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25093#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:59:16,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {25093#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {25093#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:59:16,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {25093#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25094#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:59:16,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {25094#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25094#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:59:16,932 INFO L290 TraceCheckUtils]: 39: Hoare triple {25094#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25095#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:59:16,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {25095#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {25095#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:59:16,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {25095#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25096#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:59:16,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {25096#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25096#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:59:16,998 INFO L290 TraceCheckUtils]: 43: Hoare triple {25096#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25097#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:59:16,998 INFO L290 TraceCheckUtils]: 44: Hoare triple {25097#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {25097#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:59:17,035 INFO L290 TraceCheckUtils]: 45: Hoare triple {25097#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25098#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:59:17,035 INFO L290 TraceCheckUtils]: 46: Hoare triple {25098#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25098#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:59:17,072 INFO L290 TraceCheckUtils]: 47: Hoare triple {25098#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25099#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:59:17,073 INFO L290 TraceCheckUtils]: 48: Hoare triple {25099#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {25099#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:59:17,110 INFO L290 TraceCheckUtils]: 49: Hoare triple {25099#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25100#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:59:17,110 INFO L290 TraceCheckUtils]: 50: Hoare triple {25100#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {25100#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:59:17,146 INFO L290 TraceCheckUtils]: 51: Hoare triple {25100#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25101#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:59:17,147 INFO L290 TraceCheckUtils]: 52: Hoare triple {25101#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {25101#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:59:17,183 INFO L290 TraceCheckUtils]: 53: Hoare triple {25101#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25102#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:59:17,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {25102#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25102#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:59:17,220 INFO L290 TraceCheckUtils]: 55: Hoare triple {25102#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25103#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:59:17,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {25103#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25103#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:59:17,256 INFO L290 TraceCheckUtils]: 57: Hoare triple {25103#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25104#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:59:17,257 INFO L290 TraceCheckUtils]: 58: Hoare triple {25104#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25104#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:59:17,285 INFO L290 TraceCheckUtils]: 59: Hoare triple {25104#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25105#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:59:17,286 INFO L290 TraceCheckUtils]: 60: Hoare triple {25105#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {25105#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:59:17,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {25105#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25106#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:59:17,322 INFO L290 TraceCheckUtils]: 62: Hoare triple {25106#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {25106#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:59:17,358 INFO L290 TraceCheckUtils]: 63: Hoare triple {25106#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25107#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:59:17,358 INFO L290 TraceCheckUtils]: 64: Hoare triple {25107#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25107#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:59:17,394 INFO L290 TraceCheckUtils]: 65: Hoare triple {25107#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25108#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:59:17,394 INFO L290 TraceCheckUtils]: 66: Hoare triple {25108#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {25108#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:59:17,429 INFO L290 TraceCheckUtils]: 67: Hoare triple {25108#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25109#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:59:17,430 INFO L290 TraceCheckUtils]: 68: Hoare triple {25109#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {25109#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:59:17,467 INFO L290 TraceCheckUtils]: 69: Hoare triple {25109#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25110#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:59:17,468 INFO L290 TraceCheckUtils]: 70: Hoare triple {25110#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25110#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:59:17,504 INFO L290 TraceCheckUtils]: 71: Hoare triple {25110#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25111#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:59:17,505 INFO L290 TraceCheckUtils]: 72: Hoare triple {25111#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25111#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:59:17,543 INFO L290 TraceCheckUtils]: 73: Hoare triple {25111#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25112#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:59:17,544 INFO L290 TraceCheckUtils]: 74: Hoare triple {25112#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25112#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:59:17,580 INFO L290 TraceCheckUtils]: 75: Hoare triple {25112#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25113#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:59:17,581 INFO L290 TraceCheckUtils]: 76: Hoare triple {25113#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !!(~x~0 % 4294967296 < 100000000); {25113#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:59:17,593 INFO L290 TraceCheckUtils]: 77: Hoare triple {25113#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25114#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:59:17,594 INFO L290 TraceCheckUtils]: 78: Hoare triple {25114#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {25114#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:59:17,595 INFO L290 TraceCheckUtils]: 79: Hoare triple {25114#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {25074#false} is VALID [2022-04-15 12:59:17,595 INFO L290 TraceCheckUtils]: 80: Hoare triple {25074#false} assume !(~x~0 % 4294967296 < 100000000); {25074#false} is VALID [2022-04-15 12:59:17,595 INFO L272 TraceCheckUtils]: 81: Hoare triple {25074#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {25074#false} is VALID [2022-04-15 12:59:17,595 INFO L290 TraceCheckUtils]: 82: Hoare triple {25074#false} ~cond := #in~cond; {25074#false} is VALID [2022-04-15 12:59:17,595 INFO L290 TraceCheckUtils]: 83: Hoare triple {25074#false} assume 0 == ~cond; {25074#false} is VALID [2022-04-15 12:59:17,595 INFO L290 TraceCheckUtils]: 84: Hoare triple {25074#false} assume !false; {25074#false} is VALID [2022-04-15 12:59:17,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 37 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:59:17,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:59:17,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801984351] [2022-04-15 12:59:17,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801984351] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:59:17,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483581140] [2022-04-15 12:59:17,596 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:59:17,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:17,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:59:17,597 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:59:17,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 12:59:17,661 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:59:17,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:59:17,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:59:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:17,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:59:18,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {25073#true} call ULTIMATE.init(); {25073#true} is VALID [2022-04-15 12:59:18,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {25073#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {25073#true} is VALID [2022-04-15 12:59:18,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {25073#true} assume true; {25073#true} is VALID [2022-04-15 12:59:18,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25073#true} {25073#true} #40#return; {25073#true} is VALID [2022-04-15 12:59:18,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {25073#true} call #t~ret5 := main(); {25073#true} is VALID [2022-04-15 12:59:18,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {25073#true} ~x~0 := 0; {25073#true} is VALID [2022-04-15 12:59:18,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,408 INFO L290 TraceCheckUtils]: 38: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,408 INFO L290 TraceCheckUtils]: 39: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,408 INFO L290 TraceCheckUtils]: 41: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,409 INFO L290 TraceCheckUtils]: 42: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,409 INFO L290 TraceCheckUtils]: 43: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,409 INFO L290 TraceCheckUtils]: 44: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,409 INFO L290 TraceCheckUtils]: 45: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,409 INFO L290 TraceCheckUtils]: 46: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,409 INFO L290 TraceCheckUtils]: 47: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,409 INFO L290 TraceCheckUtils]: 48: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,409 INFO L290 TraceCheckUtils]: 49: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,409 INFO L290 TraceCheckUtils]: 50: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,409 INFO L290 TraceCheckUtils]: 51: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,409 INFO L290 TraceCheckUtils]: 52: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,409 INFO L290 TraceCheckUtils]: 53: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,409 INFO L290 TraceCheckUtils]: 54: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,409 INFO L290 TraceCheckUtils]: 55: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,409 INFO L290 TraceCheckUtils]: 56: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,410 INFO L290 TraceCheckUtils]: 57: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,410 INFO L290 TraceCheckUtils]: 58: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,410 INFO L290 TraceCheckUtils]: 59: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,410 INFO L290 TraceCheckUtils]: 60: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,410 INFO L290 TraceCheckUtils]: 61: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,410 INFO L290 TraceCheckUtils]: 62: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,410 INFO L290 TraceCheckUtils]: 63: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,410 INFO L290 TraceCheckUtils]: 64: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,410 INFO L290 TraceCheckUtils]: 65: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,410 INFO L290 TraceCheckUtils]: 66: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,410 INFO L290 TraceCheckUtils]: 67: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,410 INFO L290 TraceCheckUtils]: 68: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,410 INFO L290 TraceCheckUtils]: 69: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,410 INFO L290 TraceCheckUtils]: 70: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,411 INFO L290 TraceCheckUtils]: 71: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,411 INFO L290 TraceCheckUtils]: 72: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,411 INFO L290 TraceCheckUtils]: 73: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,411 INFO L290 TraceCheckUtils]: 74: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,411 INFO L290 TraceCheckUtils]: 75: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:18,411 INFO L290 TraceCheckUtils]: 76: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:18,420 INFO L290 TraceCheckUtils]: 77: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25350#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:59:18,421 INFO L290 TraceCheckUtils]: 78: Hoare triple {25350#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {25350#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:59:18,426 INFO L290 TraceCheckUtils]: 79: Hoare triple {25350#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {25357#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 12:59:18,431 INFO L290 TraceCheckUtils]: 80: Hoare triple {25357#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {25074#false} is VALID [2022-04-15 12:59:18,431 INFO L272 TraceCheckUtils]: 81: Hoare triple {25074#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {25074#false} is VALID [2022-04-15 12:59:18,431 INFO L290 TraceCheckUtils]: 82: Hoare triple {25074#false} ~cond := #in~cond; {25074#false} is VALID [2022-04-15 12:59:18,431 INFO L290 TraceCheckUtils]: 83: Hoare triple {25074#false} assume 0 == ~cond; {25074#false} is VALID [2022-04-15 12:59:18,431 INFO L290 TraceCheckUtils]: 84: Hoare triple {25074#false} assume !false; {25074#false} is VALID [2022-04-15 12:59:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2022-04-15 12:59:18,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:59:20,807 INFO L290 TraceCheckUtils]: 84: Hoare triple {25074#false} assume !false; {25074#false} is VALID [2022-04-15 12:59:20,811 INFO L290 TraceCheckUtils]: 83: Hoare triple {25376#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25074#false} is VALID [2022-04-15 12:59:20,812 INFO L290 TraceCheckUtils]: 82: Hoare triple {25380#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25376#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:59:20,812 INFO L272 TraceCheckUtils]: 81: Hoare triple {25384#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {25380#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:59:20,813 INFO L290 TraceCheckUtils]: 80: Hoare triple {25388#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {25384#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:59:20,822 INFO L290 TraceCheckUtils]: 79: Hoare triple {25392#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {25388#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-15 12:59:20,823 INFO L290 TraceCheckUtils]: 78: Hoare triple {25396#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {25392#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:59:20,853 INFO L290 TraceCheckUtils]: 77: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25396#(or (= 100000000 (mod (+ main_~x~0 2) 4294967296)) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:59:20,854 INFO L290 TraceCheckUtils]: 76: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,854 INFO L290 TraceCheckUtils]: 75: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,854 INFO L290 TraceCheckUtils]: 74: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,854 INFO L290 TraceCheckUtils]: 73: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,854 INFO L290 TraceCheckUtils]: 72: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,854 INFO L290 TraceCheckUtils]: 71: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,854 INFO L290 TraceCheckUtils]: 70: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,854 INFO L290 TraceCheckUtils]: 69: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,854 INFO L290 TraceCheckUtils]: 68: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,854 INFO L290 TraceCheckUtils]: 67: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,854 INFO L290 TraceCheckUtils]: 66: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,854 INFO L290 TraceCheckUtils]: 65: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,854 INFO L290 TraceCheckUtils]: 64: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,854 INFO L290 TraceCheckUtils]: 63: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,855 INFO L290 TraceCheckUtils]: 62: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,855 INFO L290 TraceCheckUtils]: 61: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,855 INFO L290 TraceCheckUtils]: 60: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,855 INFO L290 TraceCheckUtils]: 59: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,855 INFO L290 TraceCheckUtils]: 58: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,855 INFO L290 TraceCheckUtils]: 52: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,855 INFO L290 TraceCheckUtils]: 51: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,855 INFO L290 TraceCheckUtils]: 50: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,855 INFO L290 TraceCheckUtils]: 49: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,855 INFO L290 TraceCheckUtils]: 48: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,856 INFO L290 TraceCheckUtils]: 47: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,856 INFO L290 TraceCheckUtils]: 46: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,856 INFO L290 TraceCheckUtils]: 45: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,856 INFO L290 TraceCheckUtils]: 44: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,856 INFO L290 TraceCheckUtils]: 43: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,856 INFO L290 TraceCheckUtils]: 42: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,856 INFO L290 TraceCheckUtils]: 41: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,856 INFO L290 TraceCheckUtils]: 40: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {25073#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25073#true} is VALID [2022-04-15 12:59:20,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {25073#true} assume !!(~x~0 % 4294967296 < 100000000); {25073#true} is VALID [2022-04-15 12:59:20,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {25073#true} ~x~0 := 0; {25073#true} is VALID [2022-04-15 12:59:20,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {25073#true} call #t~ret5 := main(); {25073#true} is VALID [2022-04-15 12:59:20,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25073#true} {25073#true} #40#return; {25073#true} is VALID [2022-04-15 12:59:20,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {25073#true} assume true; {25073#true} is VALID [2022-04-15 12:59:20,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {25073#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {25073#true} is VALID [2022-04-15 12:59:20,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {25073#true} call ULTIMATE.init(); {25073#true} is VALID [2022-04-15 12:59:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2022-04-15 12:59:20,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483581140] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:59:20,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:59:20,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 4, 8] total 48 [2022-04-15 12:59:20,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:59:20,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [713603142] [2022-04-15 12:59:20,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [713603142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:59:20,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:59:20,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 12:59:20,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264661127] [2022-04-15 12:59:20,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:59:20,861 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 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 85 [2022-04-15 12:59:20,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:59:20,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 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-15 12:59:22,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:22,568 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 12:59:22,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:22,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 12:59:22,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1972, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:59:22,568 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 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)