/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/loop-acceleration/phases_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:17:22,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:17:22,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:17:22,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:17:22,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:17:22,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:17:22,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:17:22,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:17:22,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:17:22,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:17:22,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:17:22,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:17:22,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:17:22,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:17:22,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:17:22,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:17:22,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:17:22,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:17:22,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:17:22,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:17:22,935 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:17:22,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:17:22,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:17:22,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:17:22,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:17:22,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:17:22,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:17:22,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:17:22,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:17:22,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:17:22,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:17:22,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:17:22,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:17:22,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:17:22,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:17:22,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:17:22,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:17:22,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:17:22,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:17:22,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:17:22,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:17:22,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:17:22,951 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:17:22,961 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:17:22,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:17:22,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:17:22,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:17:22,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:17:22,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:17:22,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:17:22,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:17:22,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:17:22,963 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:17:22,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:17:22,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:17:22,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:17:22,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:17:22,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:17:22,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:17:22,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:17:22,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:17:22,964 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:17:22,964 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:17:22,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:17:22,964 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:17:22,964 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:17:23,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:17:23,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:17:23,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:17:23,174 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:17:23,175 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:17:23,176 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_1-2.c [2022-04-15 12:17:23,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c25cf354f/921a765db6f44473af21e3c6a044dc39/FLAG6ee70084a [2022-04-15 12:17:23,598 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:17:23,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-2.c [2022-04-15 12:17:23,603 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c25cf354f/921a765db6f44473af21e3c6a044dc39/FLAG6ee70084a [2022-04-15 12:17:23,616 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c25cf354f/921a765db6f44473af21e3c6a044dc39 [2022-04-15 12:17:23,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:17:23,621 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:17:23,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:17:23,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:17:23,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:17:23,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:17:23" (1/1) ... [2022-04-15 12:17:23,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f2788d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:23, skipping insertion in model container [2022-04-15 12:17:23,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:17:23" (1/1) ... [2022-04-15 12:17:23,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:17:23,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:17:23,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-2.c[322,335] [2022-04-15 12:17:23,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:17:23,835 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:17:23,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-2.c[322,335] [2022-04-15 12:17:23,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:17:23,870 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:17:23,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:23 WrapperNode [2022-04-15 12:17:23,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:17:23,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:17:23,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:17:23,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:17:23,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:23" (1/1) ... [2022-04-15 12:17:23,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:23" (1/1) ... [2022-04-15 12:17:23,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:23" (1/1) ... [2022-04-15 12:17:23,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:23" (1/1) ... [2022-04-15 12:17:23,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:23" (1/1) ... [2022-04-15 12:17:23,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:23" (1/1) ... [2022-04-15 12:17:23,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:23" (1/1) ... [2022-04-15 12:17:23,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:17:23,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:17:23,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:17:23,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:17:23,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:23" (1/1) ... [2022-04-15 12:17:23,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:17:23,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:23,961 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:17:24,007 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:17:24,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:17:24,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:17:24,020 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:17:24,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:17:24,021 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:17:24,021 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:17:24,021 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:17:24,021 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:17:24,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:17:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:17:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:17:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:17:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:17:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:17:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:17:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:17:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:17:24,075 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:17:24,078 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:17:24,251 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:17:24,256 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:17:24,256 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:17:24,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:17:24 BoogieIcfgContainer [2022-04-15 12:17:24,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:17:24,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:17:24,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:17:24,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:17:24,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:17:23" (1/3) ... [2022-04-15 12:17:24,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b164e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:17:24, skipping insertion in model container [2022-04-15 12:17:24,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:23" (2/3) ... [2022-04-15 12:17:24,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b164e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:17:24, skipping insertion in model container [2022-04-15 12:17:24,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:17:24" (3/3) ... [2022-04-15 12:17:24,287 INFO L111 eAbstractionObserver]: Analyzing ICFG phases_1-2.c [2022-04-15 12:17:24,291 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:17:24,291 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:17:24,331 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:17:24,335 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:17:24,336 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:17:24,360 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:17:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:17:24,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:24,368 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:24,369 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:24,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:24,373 INFO L85 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 1 times [2022-04-15 12:17:24,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:24,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [873182264] [2022-04-15 12:17:24,389 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:17:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 2 times [2022-04-15 12:17:24,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:24,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923800408] [2022-04-15 12:17:24,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:24,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:24,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:24,578 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(13, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-15 12:17:24,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:17:24,579 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #40#return; {22#true} is VALID [2022-04-15 12:17:24,581 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:17:24,581 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(13, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-15 12:17:24,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:17:24,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #40#return; {22#true} is VALID [2022-04-15 12:17:24,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret5 := main(); {22#true} is VALID [2022-04-15 12:17:24,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~x~0 := 0; {22#true} is VALID [2022-04-15 12:17:24,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-15 12:17:24,585 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23#false} is VALID [2022-04-15 12:17:24,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-15 12:17:24,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-15 12:17:24,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-15 12:17:24,586 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:17:24,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:24,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923800408] [2022-04-15 12:17:24,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923800408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:24,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:24,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:17:24,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:24,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [873182264] [2022-04-15 12:17:24,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [873182264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:24,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:24,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:17:24,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119985962] [2022-04-15 12:17:24,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:24,597 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:17:24,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:24,600 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:17:24,617 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:17:24,617 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:17:24,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:24,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:17:24,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:17:24,643 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:17:24,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:24,723 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 12:17:24,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:17:24,724 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:17:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:24,725 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:17:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-15 12:17:24,736 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:17:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-15 12:17:24,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-15 12:17:24,809 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:17:24,815 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:17:24,815 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 12:17:24,818 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:17:24,821 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:17:24,821 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:17:24,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 12:17:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 12:17:24,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:24,862 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:17:24,862 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:17:24,863 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:17:24,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:24,871 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 12:17:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 12:17:24,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:24,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:24,872 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:17:24,872 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:17:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:24,875 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 12:17:24,876 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 12:17:24,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:24,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:24,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:24,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:24,877 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:17:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-15 12:17:24,880 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-15 12:17:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:24,880 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-15 12:17:24,881 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:17:24,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-15 12:17:24,903 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:17:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 12:17:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:17:24,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:24,906 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:24,906 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:17:24,909 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:24,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:24,915 INFO L85 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 1 times [2022-04-15 12:17:24,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:24,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2000639542] [2022-04-15 12:17:24,918 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:17:24,918 INFO L85 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 2 times [2022-04-15 12:17:24,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:24,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633240805] [2022-04-15 12:17:24,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:24,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:25,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:25,042 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(13, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-15 12:17:25,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-15 12:17:25,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #40#return; {142#true} is VALID [2022-04-15 12:17:25,044 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:17:25,044 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(13, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-15 12:17:25,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-15 12:17:25,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #40#return; {142#true} is VALID [2022-04-15 12:17:25,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret5 := main(); {142#true} is VALID [2022-04-15 12:17:25,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#true} ~x~0 := 0; {147#(= main_~x~0 0)} is VALID [2022-04-15 12:17:25,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {143#false} is VALID [2022-04-15 12:17:25,046 INFO L272 TraceCheckUtils]: 7: Hoare triple {143#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {143#false} is VALID [2022-04-15 12:17:25,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2022-04-15 12:17:25,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2022-04-15 12:17:25,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2022-04-15 12:17:25,048 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:17:25,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:25,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633240805] [2022-04-15 12:17:25,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633240805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:25,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:25,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:25,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:25,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2000639542] [2022-04-15 12:17:25,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2000639542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:25,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:25,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:25,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061657207] [2022-04-15 12:17:25,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:25,053 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:17:25,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:25,054 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:17:25,063 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:17:25,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:17:25,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:25,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:17:25,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:17:25,066 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:17:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:25,153 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 12:17:25,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:17:25,153 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:17:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:25,153 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:17:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 12:17:25,155 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:17:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 12:17:25,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-15 12:17:25,178 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:17:25,181 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:17:25,181 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 12:17:25,182 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:17:25,184 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:17:25,184 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:17:25,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 12:17:25,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 12:17:25,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:25,191 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:17:25,191 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:17:25,192 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:17:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:25,194 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 12:17:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:17:25,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:25,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:25,195 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:17:25,197 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:17:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:25,199 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 12:17:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:17:25,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:25,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:25,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:25,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:25,200 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:17:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 12:17:25,210 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-15 12:17:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:25,210 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 12:17:25,212 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:17:25,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 12:17:25,231 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:17:25,231 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:17:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:17:25,232 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:25,232 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:25,232 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:17:25,232 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:25,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:25,233 INFO L85 PathProgramCache]: Analyzing trace with hash 925229631, now seen corresponding path program 1 times [2022-04-15 12:17:25,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:25,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1465173341] [2022-04-15 12:17:25,337 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:25,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1303175503, now seen corresponding path program 1 times [2022-04-15 12:17:25,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:25,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358995038] [2022-04-15 12:17:25,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:25,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:25,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:25,515 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(13, 2);call #Ultimate.allocInit(12, 3); {257#true} is VALID [2022-04-15 12:17:25,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-15 12:17:25,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {257#true} {257#true} #40#return; {257#true} is VALID [2022-04-15 12:17:25,517 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:17:25,517 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(13, 2);call #Ultimate.allocInit(12, 3); {257#true} is VALID [2022-04-15 12:17:25,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-15 12:17:25,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #40#return; {257#true} is VALID [2022-04-15 12:17:25,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret5 := main(); {257#true} is VALID [2022-04-15 12:17:25,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#true} ~x~0 := 0; {262#(= main_~x~0 0)} is VALID [2022-04-15 12:17:25,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#(= main_~x~0 0)} [46] L16-2-->L15-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) 65521)) (= 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 (and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0))) (<= (+ main_~x~0 4294901775) (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296)))} is VALID [2022-04-15 12:17:25,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(or (and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0))) (<= (+ main_~x~0 4294901775) (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296)))} [45] L15-2_primed-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) 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:17:25,520 INFO L272 TraceCheckUtils]: 8: Hoare triple {258#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {258#false} is VALID [2022-04-15 12:17:25,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {258#false} ~cond := #in~cond; {258#false} is VALID [2022-04-15 12:17:25,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {258#false} assume 0 == ~cond; {258#false} is VALID [2022-04-15 12:17:25,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {258#false} assume !false; {258#false} is VALID [2022-04-15 12:17:25,521 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:17:25,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:25,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358995038] [2022-04-15 12:17:25,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358995038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:25,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:25,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:17:25,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:25,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1465173341] [2022-04-15 12:17:25,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1465173341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:25,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:25,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:17:25,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821454744] [2022-04-15 12:17:25,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:25,664 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:17:25,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:25,664 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:17:25,690 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:17:25,690 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:17:25,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:25,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:17:25,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:17:25,691 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:17:25,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:25,924 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 12:17:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:17:25,925 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:17:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:25,925 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:17:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 12:17:25,926 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:17:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 12:17:25,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-15 12:17:26,019 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:17:26,020 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:17:26,020 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:17:26,020 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:17:26,021 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:17:26,021 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:17:26,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:17:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:17:26,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:26,031 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:17:26,031 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:17:26,031 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:17:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:26,032 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:17:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:17:26,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:26,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:26,033 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:17:26,033 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:17:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:26,034 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:17:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:17:26,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:26,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:26,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:26,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:26,034 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:17:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 12:17:26,035 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-15 12:17:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:26,035 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 12:17:26,035 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:17:26,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 12:17:26,098 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:17:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:17:26,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:17:26,098 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:26,098 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:26,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:17:26,099 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:26,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1220035546, now seen corresponding path program 1 times [2022-04-15 12:17:26,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:26,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2012462546] [2022-04-15 12:17:26,384 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1244070159, now seen corresponding path program 1 times [2022-04-15 12:17:26,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:26,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083989805] [2022-04-15 12:17:26,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:26,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:26,433 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:26,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:26,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1220035546, now seen corresponding path program 2 times [2022-04-15 12:17:26,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:26,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887365180] [2022-04-15 12:17:26,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:26,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:26,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:26,548 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(13, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-15 12:17:26,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 12:17:26,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-15 12:17:26,549 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:17:26,549 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(13, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-15 12:17:26,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 12:17:26,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-15 12:17:26,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-15 12:17:26,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} ~x~0 := 0; {390#(= main_~x~0 0)} is VALID [2022-04-15 12:17:26,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {390#(= main_~x~0 0)} is VALID [2022-04-15 12:17:26,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#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:17:26,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {391#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:26,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {386#false} is VALID [2022-04-15 12:17:26,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {386#false} assume !(~x~0 % 4294967296 < 268435455); {386#false} is VALID [2022-04-15 12:17:26,552 INFO L272 TraceCheckUtils]: 11: Hoare triple {386#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {386#false} is VALID [2022-04-15 12:17:26,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 12:17:26,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 12:17:26,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 12:17:26,553 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:17:26,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:26,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887365180] [2022-04-15 12:17:26,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887365180] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:26,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937561104] [2022-04-15 12:17:26,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:26,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:26,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:26,554 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:17:26,555 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:17:26,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:26,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:26,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 12:17:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:26,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:26,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-15 12:17:26,667 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(13, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-15 12:17:26,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 12:17:26,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-15 12:17:26,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-15 12:17:26,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} ~x~0 := 0; {390#(= main_~x~0 0)} is VALID [2022-04-15 12:17:26,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {390#(= main_~x~0 0)} is VALID [2022-04-15 12:17:26,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {417#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 12:17:26,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#(= (+ (- 1) main_~x~0) 0)} assume !!(~x~0 % 4294967296 < 268435455); {417#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 12:17:26,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#(= (+ (- 1) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {424#(= main_~x~0 3)} is VALID [2022-04-15 12:17:26,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {424#(= main_~x~0 3)} assume !(~x~0 % 4294967296 < 268435455); {386#false} is VALID [2022-04-15 12:17:26,670 INFO L272 TraceCheckUtils]: 11: Hoare triple {386#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {386#false} is VALID [2022-04-15 12:17:26,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 12:17:26,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 12:17:26,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 12:17:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:26,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:26,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 12:17:26,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 12:17:26,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 12:17:26,749 INFO L272 TraceCheckUtils]: 11: Hoare triple {386#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {386#false} is VALID [2022-04-15 12:17:26,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {452#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {386#false} is VALID [2022-04-15 12:17:26,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {456#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {452#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:26,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {456#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {456#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:26,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {456#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:26,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {463#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {463#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:17:26,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} ~x~0 := 0; {463#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:17:26,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-15 12:17:26,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-15 12:17:26,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 12:17:26,755 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(13, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-15 12:17:26,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-15 12:17:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:26,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937561104] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:26,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:26,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-04-15 12:17:26,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:26,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2012462546] [2022-04-15 12:17:26,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2012462546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:26,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:26,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:17:26,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192754533] [2022-04-15 12:17:26,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:26,757 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:17:26,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:26,757 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:17:26,768 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:17:26,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:17:26,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:26,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:17:26,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:17:26,770 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:17:26,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:26,869 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 12:17:26,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:17:26,869 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:17:26,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:26,869 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:17:26,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-15 12:17:26,870 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:17:26,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-15 12:17:26,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-15 12:17:26,889 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:17:26,890 INFO L225 Difference]: With dead ends: 26 [2022-04-15 12:17:26,890 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 12:17:26,890 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:17:26,890 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:17:26,891 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:17:26,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 12:17:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 12:17:26,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:26,905 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:17:26,905 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:17:26,905 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:17:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:26,908 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 12:17:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:17:26,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:26,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:26,908 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:17:26,910 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:17:26,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:26,911 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 12:17:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:17:26,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:26,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:26,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:26,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:26,912 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:17:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 12:17:26,914 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-15 12:17:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:26,914 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 12:17:26,914 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:17:26,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 12:17:26,945 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:17:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:17:26,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:17:26,946 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:26,946 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:26,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:17:27,146 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:17:27,147 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:27,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1870024951, now seen corresponding path program 3 times [2022-04-15 12:17:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:27,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2128351864] [2022-04-15 12:17:27,388 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:27,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1184964815, now seen corresponding path program 1 times [2022-04-15 12:17:27,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:27,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682427875] [2022-04-15 12:17:27,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:27,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:27,408 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:27,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:27,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1870024951, now seen corresponding path program 4 times [2022-04-15 12:17:27,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:27,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865155531] [2022-04-15 12:17:27,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:27,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:27,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:27,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {627#(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(13, 2);call #Ultimate.allocInit(12, 3); {619#true} is VALID [2022-04-15 12:17:27,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-15 12:17:27,505 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {619#true} {619#true} #40#return; {619#true} is VALID [2022-04-15 12:17:27,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {619#true} call ULTIMATE.init(); {627#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:27,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {627#(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(13, 2);call #Ultimate.allocInit(12, 3); {619#true} is VALID [2022-04-15 12:17:27,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-15 12:17:27,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {619#true} #40#return; {619#true} is VALID [2022-04-15 12:17:27,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {619#true} call #t~ret5 := main(); {619#true} is VALID [2022-04-15 12:17:27,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {619#true} ~x~0 := 0; {624#(= main_~x~0 0)} is VALID [2022-04-15 12:17:27,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {624#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {624#(= main_~x~0 0)} is VALID [2022-04-15 12:17:27,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {624#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {625#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:27,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {625#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {625#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:27,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {625#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {626#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:27,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {626#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {626#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:27,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {626#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {620#false} is VALID [2022-04-15 12:17:27,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {620#false} assume !(~x~0 % 4294967296 < 268435455); {620#false} is VALID [2022-04-15 12:17:27,513 INFO L272 TraceCheckUtils]: 13: Hoare triple {620#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {620#false} is VALID [2022-04-15 12:17:27,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {620#false} ~cond := #in~cond; {620#false} is VALID [2022-04-15 12:17:27,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {620#false} assume 0 == ~cond; {620#false} is VALID [2022-04-15 12:17:27,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {620#false} assume !false; {620#false} is VALID [2022-04-15 12:17:27,514 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:17:27,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:27,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865155531] [2022-04-15 12:17:27,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865155531] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:27,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774963321] [2022-04-15 12:17:27,514 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:27,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:27,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:27,525 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:17:27,526 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:17:27,554 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:27,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:27,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:17:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:27,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:27,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {619#true} call ULTIMATE.init(); {619#true} is VALID [2022-04-15 12:17:27,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#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(13, 2);call #Ultimate.allocInit(12, 3); {619#true} is VALID [2022-04-15 12:17:27,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-15 12:17:27,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {619#true} #40#return; {619#true} is VALID [2022-04-15 12:17:27,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {619#true} call #t~ret5 := main(); {619#true} is VALID [2022-04-15 12:17:27,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {619#true} ~x~0 := 0; {624#(= main_~x~0 0)} is VALID [2022-04-15 12:17:27,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {624#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {624#(= main_~x~0 0)} is VALID [2022-04-15 12:17:27,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {624#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {625#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:27,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {625#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {625#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:27,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {625#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:27,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:27,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {665#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:27,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {665#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {665#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:27,902 INFO L272 TraceCheckUtils]: 13: Hoare triple {665#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:27,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:27,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {620#false} is VALID [2022-04-15 12:17:27,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {620#false} assume !false; {620#false} is VALID [2022-04-15 12:17:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:27,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:28,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {620#false} assume !false; {620#false} is VALID [2022-04-15 12:17:28,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {620#false} is VALID [2022-04-15 12:17:28,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:28,017 INFO L272 TraceCheckUtils]: 13: Hoare triple {692#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:28,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {692#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:28,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {692#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:28,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {692#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:28,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {705#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:28,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {705#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:28,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {692#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:28,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {692#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:28,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {619#true} ~x~0 := 0; {692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:28,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {619#true} call #t~ret5 := main(); {619#true} is VALID [2022-04-15 12:17:28,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {619#true} #40#return; {619#true} is VALID [2022-04-15 12:17:28,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-15 12:17:28,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#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(13, 2);call #Ultimate.allocInit(12, 3); {619#true} is VALID [2022-04-15 12:17:28,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {619#true} call ULTIMATE.init(); {619#true} is VALID [2022-04-15 12:17:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:17:28,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774963321] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:28,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:28,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2022-04-15 12:17:28,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:28,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2128351864] [2022-04-15 12:17:28,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2128351864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:28,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:28,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:17:28,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66396827] [2022-04-15 12:17:28,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:28,022 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:17:28,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:28,023 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:17:28,034 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:17:28,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:17:28,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:28,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:17:28,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:17:28,036 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:17:28,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:28,149 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 12:17:28,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:17:28,149 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:17:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:28,150 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:17:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-15 12:17:28,151 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:17:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-15 12:17:28,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2022-04-15 12:17:28,177 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:17:28,177 INFO L225 Difference]: With dead ends: 28 [2022-04-15 12:17:28,177 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:17:28,178 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:17:28,178 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:17:28,179 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:17:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:17:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 12:17:28,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:28,197 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:17:28,197 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:17:28,197 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:17:28,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:28,198 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 12:17:28,198 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:17:28,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:28,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:28,199 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:17:28,199 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:17:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:28,200 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 12:17:28,200 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:17:28,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:28,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:28,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:28,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:28,200 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:17:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-15 12:17:28,201 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-04-15 12:17:28,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:28,201 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-15 12:17:28,201 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:17:28,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-15 12:17:28,251 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:17:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:17:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:17:28,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:28,252 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:28,276 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:17:28,452 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:17:28,453 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:28,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:28,453 INFO L85 PathProgramCache]: Analyzing trace with hash -555382060, now seen corresponding path program 5 times [2022-04-15 12:17:28,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:28,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1395834103] [2022-04-15 12:17:28,663 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1125859471, now seen corresponding path program 1 times [2022-04-15 12:17:28,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:28,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940484803] [2022-04-15 12:17:28,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:28,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:28,676 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:28,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:28,696 INFO L85 PathProgramCache]: Analyzing trace with hash -555382060, now seen corresponding path program 6 times [2022-04-15 12:17:28,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:28,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821196021] [2022-04-15 12:17:28,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:28,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:28,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:28,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {890#(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(13, 2);call #Ultimate.allocInit(12, 3); {881#true} is VALID [2022-04-15 12:17:28,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 12:17:28,815 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {881#true} {881#true} #40#return; {881#true} is VALID [2022-04-15 12:17:28,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {881#true} call ULTIMATE.init(); {890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:28,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {890#(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(13, 2);call #Ultimate.allocInit(12, 3); {881#true} is VALID [2022-04-15 12:17:28,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 12:17:28,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {881#true} #40#return; {881#true} is VALID [2022-04-15 12:17:28,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {881#true} call #t~ret5 := main(); {881#true} is VALID [2022-04-15 12:17:28,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#true} ~x~0 := 0; {886#(= main_~x~0 0)} is VALID [2022-04-15 12:17:28,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {886#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {886#(= main_~x~0 0)} is VALID [2022-04-15 12:17:28,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {886#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {887#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:28,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {887#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {887#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:28,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {887#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {888#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:28,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {888#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {888#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:28,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {888#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {889#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-15 12:17:28,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {889#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !!(~x~0 % 4294967296 < 268435455); {889#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-15 12:17:28,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {889#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {882#false} is VALID [2022-04-15 12:17:28,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {882#false} assume !(~x~0 % 4294967296 < 268435455); {882#false} is VALID [2022-04-15 12:17:28,822 INFO L272 TraceCheckUtils]: 15: Hoare triple {882#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {882#false} is VALID [2022-04-15 12:17:28,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {882#false} ~cond := #in~cond; {882#false} is VALID [2022-04-15 12:17:28,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {882#false} assume 0 == ~cond; {882#false} is VALID [2022-04-15 12:17:28,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {882#false} assume !false; {882#false} is VALID [2022-04-15 12:17:28,823 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:17:28,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:28,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821196021] [2022-04-15 12:17:28,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821196021] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:28,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586002836] [2022-04-15 12:17:28,823 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:28,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:28,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:28,824 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:17:28,839 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:17:28,889 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 12:17:28,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:28,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:17:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:28,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:29,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {881#true} call ULTIMATE.init(); {881#true} is VALID [2022-04-15 12:17:29,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#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(13, 2);call #Ultimate.allocInit(12, 3); {881#true} is VALID [2022-04-15 12:17:29,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 12:17:29,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {881#true} #40#return; {881#true} is VALID [2022-04-15 12:17:29,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {881#true} call #t~ret5 := main(); {881#true} is VALID [2022-04-15 12:17:29,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#true} ~x~0 := 0; {881#true} is VALID [2022-04-15 12:17:29,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#true} assume !!(~x~0 % 4294967296 < 268435455); {881#true} is VALID [2022-04-15 12:17:29,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {881#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {881#true} is VALID [2022-04-15 12:17:29,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {881#true} assume !!(~x~0 % 4294967296 < 268435455); {881#true} is VALID [2022-04-15 12:17:29,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {881#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {881#true} is VALID [2022-04-15 12:17:29,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {881#true} assume !!(~x~0 % 4294967296 < 268435455); {881#true} is VALID [2022-04-15 12:17:29,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {881#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {927#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:17:29,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {927#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {927#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:17:29,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {927#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {934#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} is VALID [2022-04-15 12:17:29,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {934#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 268435455); {882#false} is VALID [2022-04-15 12:17:29,123 INFO L272 TraceCheckUtils]: 15: Hoare triple {882#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {882#false} is VALID [2022-04-15 12:17:29,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {882#false} ~cond := #in~cond; {882#false} is VALID [2022-04-15 12:17:29,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {882#false} assume 0 == ~cond; {882#false} is VALID [2022-04-15 12:17:29,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {882#false} assume !false; {882#false} is VALID [2022-04-15 12:17:29,123 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:17:29,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:29,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {882#false} assume !false; {882#false} is VALID [2022-04-15 12:17:29,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {882#false} assume 0 == ~cond; {882#false} is VALID [2022-04-15 12:17:29,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {882#false} ~cond := #in~cond; {882#false} is VALID [2022-04-15 12:17:29,335 INFO L272 TraceCheckUtils]: 15: Hoare triple {882#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {882#false} is VALID [2022-04-15 12:17:29,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {962#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {882#false} is VALID [2022-04-15 12:17:29,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {966#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {962#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:29,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {966#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {966#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:29,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {881#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {966#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:29,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {881#true} assume !!(~x~0 % 4294967296 < 268435455); {881#true} is VALID [2022-04-15 12:17:29,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {881#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {881#true} is VALID [2022-04-15 12:17:29,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {881#true} assume !!(~x~0 % 4294967296 < 268435455); {881#true} is VALID [2022-04-15 12:17:29,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {881#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {881#true} is VALID [2022-04-15 12:17:29,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#true} assume !!(~x~0 % 4294967296 < 268435455); {881#true} is VALID [2022-04-15 12:17:29,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#true} ~x~0 := 0; {881#true} is VALID [2022-04-15 12:17:29,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {881#true} call #t~ret5 := main(); {881#true} is VALID [2022-04-15 12:17:29,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {881#true} #40#return; {881#true} is VALID [2022-04-15 12:17:29,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 12:17:29,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#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(13, 2);call #Ultimate.allocInit(12, 3); {881#true} is VALID [2022-04-15 12:17:29,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {881#true} call ULTIMATE.init(); {881#true} is VALID [2022-04-15 12:17:29,338 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:17:29,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586002836] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:29,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:29,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2022-04-15 12:17:29,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:29,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1395834103] [2022-04-15 12:17:29,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1395834103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:29,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:29,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:17:29,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673234253] [2022-04-15 12:17:29,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:29,340 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:17:29,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:29,340 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:17:29,358 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:17:29,359 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:17:29,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:29,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:17:29,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:17:29,360 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:17:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:29,511 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 12:17:29,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:17:29,511 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:17:29,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:29,512 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:17:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 12:17:29,513 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:17:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 12:17:29,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-15 12:17:29,543 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:17:29,544 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:17:29,544 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:17:29,545 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:17:29,546 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:29,547 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:17:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:17:29,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 12:17:29,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:29,606 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:17:29,607 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:17:29,607 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:17:29,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:29,607 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 12:17:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:17:29,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:29,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:29,609 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:17:29,610 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:17:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:29,612 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 12:17:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:17:29,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:29,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:29,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:29,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:29,614 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:17:29,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-15 12:17:29,614 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2022-04-15 12:17:29,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:29,614 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-15 12:17:29,615 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:17:29,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-15 12:17:29,649 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:17:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:17:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:17:29,649 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:29,650 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:29,665 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:17:29,850 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:17:29,850 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:29,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:29,851 INFO L85 PathProgramCache]: Analyzing trace with hash 795722097, now seen corresponding path program 7 times [2022-04-15 12:17:29,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:29,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [945387174] [2022-04-15 12:17:30,081 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1066754127, now seen corresponding path program 1 times [2022-04-15 12:17:30,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:30,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21137583] [2022-04-15 12:17:30,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:30,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:30,100 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:30,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:30,125 INFO L85 PathProgramCache]: Analyzing trace with hash 795722097, now seen corresponding path program 8 times [2022-04-15 12:17:30,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:30,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863927375] [2022-04-15 12:17:30,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:30,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:30,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:30,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {1178#(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(13, 2);call #Ultimate.allocInit(12, 3); {1168#true} is VALID [2022-04-15 12:17:30,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {1168#true} assume true; {1168#true} is VALID [2022-04-15 12:17:30,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1168#true} {1168#true} #40#return; {1168#true} is VALID [2022-04-15 12:17:30,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {1168#true} call ULTIMATE.init(); {1178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:30,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {1178#(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(13, 2);call #Ultimate.allocInit(12, 3); {1168#true} is VALID [2022-04-15 12:17:30,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {1168#true} assume true; {1168#true} is VALID [2022-04-15 12:17:30,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1168#true} {1168#true} #40#return; {1168#true} is VALID [2022-04-15 12:17:30,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {1168#true} call #t~ret5 := main(); {1168#true} is VALID [2022-04-15 12:17:30,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {1168#true} ~x~0 := 0; {1173#(= main_~x~0 0)} is VALID [2022-04-15 12:17:30,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {1173#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {1173#(= main_~x~0 0)} is VALID [2022-04-15 12:17:30,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1174#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:30,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {1174#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {1174#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:30,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {1174#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1175#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:30,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {1175#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1175#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:30,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {1175#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1176#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:30,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {1176#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1176#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:30,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {1176#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1177#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:30,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {1177#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {1177#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:30,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {1177#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1169#false} is VALID [2022-04-15 12:17:30,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {1169#false} assume !(~x~0 % 4294967296 < 268435455); {1169#false} is VALID [2022-04-15 12:17:30,248 INFO L272 TraceCheckUtils]: 17: Hoare triple {1169#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1169#false} is VALID [2022-04-15 12:17:30,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {1169#false} ~cond := #in~cond; {1169#false} is VALID [2022-04-15 12:17:30,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {1169#false} assume 0 == ~cond; {1169#false} is VALID [2022-04-15 12:17:30,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {1169#false} assume !false; {1169#false} is VALID [2022-04-15 12:17:30,249 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:17:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:30,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863927375] [2022-04-15 12:17:30,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863927375] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:30,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760650543] [2022-04-15 12:17:30,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:30,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:30,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:30,250 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:17:30,252 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:17:30,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:30,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:30,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 12:17:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:30,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:30,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {1168#true} call ULTIMATE.init(); {1168#true} is VALID [2022-04-15 12:17:30,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {1168#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(13, 2);call #Ultimate.allocInit(12, 3); {1168#true} is VALID [2022-04-15 12:17:30,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {1168#true} assume true; {1168#true} is VALID [2022-04-15 12:17:30,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1168#true} {1168#true} #40#return; {1168#true} is VALID [2022-04-15 12:17:30,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {1168#true} call #t~ret5 := main(); {1168#true} is VALID [2022-04-15 12:17:30,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {1168#true} ~x~0 := 0; {1173#(= main_~x~0 0)} is VALID [2022-04-15 12:17:30,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {1173#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {1173#(= main_~x~0 0)} is VALID [2022-04-15 12:17:30,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1174#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:30,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {1174#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {1174#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:30,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {1174#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1175#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:30,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {1175#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1175#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:30,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {1175#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1176#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:30,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {1176#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1176#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:30,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {1176#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1221#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:30,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {1221#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1221#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:30,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {1221#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1228#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:30,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {1228#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 268435455); {1228#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:30,538 INFO L272 TraceCheckUtils]: 17: Hoare triple {1228#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1235#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:30,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {1235#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1239#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:30,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {1239#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1169#false} is VALID [2022-04-15 12:17:30,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {1169#false} assume !false; {1169#false} is VALID [2022-04-15 12:17:30,540 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:17:30,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:30,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {1169#false} assume !false; {1169#false} is VALID [2022-04-15 12:17:30,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {1239#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1169#false} is VALID [2022-04-15 12:17:30,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {1235#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1239#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:30,646 INFO L272 TraceCheckUtils]: 17: Hoare triple {1255#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1235#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:30,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {1255#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {1255#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:30,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {1255#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1255#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:30,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {1255#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1255#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:30,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {1268#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1255#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:30,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {1268#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1268#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:30,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {1255#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1268#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:30,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {1255#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1255#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:30,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {1268#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1255#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:30,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {1268#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1268#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:30,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {1255#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1268#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:30,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {1255#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {1255#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:30,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {1168#true} ~x~0 := 0; {1255#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:30,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {1168#true} call #t~ret5 := main(); {1168#true} is VALID [2022-04-15 12:17:30,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1168#true} {1168#true} #40#return; {1168#true} is VALID [2022-04-15 12:17:30,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {1168#true} assume true; {1168#true} is VALID [2022-04-15 12:17:30,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {1168#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(13, 2);call #Ultimate.allocInit(12, 3); {1168#true} is VALID [2022-04-15 12:17:30,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {1168#true} call ULTIMATE.init(); {1168#true} is VALID [2022-04-15 12:17:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 12:17:30,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760650543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:30,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:30,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 14 [2022-04-15 12:17:30,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:30,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [945387174] [2022-04-15 12:17:30,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [945387174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:30,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:30,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:17:30,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818620319] [2022-04-15 12:17:30,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:30,656 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:17:30,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:30,656 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:17:30,669 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:17:30,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:17:30,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:30,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:17:30,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:17:30,670 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:17:30,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:30,863 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 12:17:30,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:17:30,863 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:17:30,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:30,865 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:17:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-15 12:17:30,868 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:17:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-15 12:17:30,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2022-04-15 12:17:30,894 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:17:30,896 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:17:30,896 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:17:30,896 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:17:30,897 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:30,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 24 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:17:30,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:17:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 12:17:30,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:30,929 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:17:30,929 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:17:30,929 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:17:30,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:30,930 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 12:17:30,930 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:17:30,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:30,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:30,931 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:17:30,931 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:17:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:30,932 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 12:17:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:17:30,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:30,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:30,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:30,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:30,932 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:17:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 12:17:30,933 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-04-15 12:17:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:30,933 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 12:17:30,933 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:17:30,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-15 12:17:30,963 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:17:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:17:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:17:30,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:30,963 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:30,989 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:17:31,180 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:17:31,181 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:31,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:31,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2126693582, now seen corresponding path program 9 times [2022-04-15 12:17:31,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:31,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [258514973] [2022-04-15 12:17:31,350 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:31,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1007648783, now seen corresponding path program 1 times [2022-04-15 12:17:31,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:31,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143515261] [2022-04-15 12:17:31,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:31,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:31,371 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:31,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:31,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2126693582, now seen corresponding path program 10 times [2022-04-15 12:17:31,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:31,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890743088] [2022-04-15 12:17:31,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:31,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:31,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:31,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {1495#(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(13, 2);call #Ultimate.allocInit(12, 3); {1484#true} is VALID [2022-04-15 12:17:31,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-15 12:17:31,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1484#true} {1484#true} #40#return; {1484#true} is VALID [2022-04-15 12:17:31,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {1484#true} call ULTIMATE.init(); {1495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:31,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {1495#(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(13, 2);call #Ultimate.allocInit(12, 3); {1484#true} is VALID [2022-04-15 12:17:31,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-15 12:17:31,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1484#true} #40#return; {1484#true} is VALID [2022-04-15 12:17:31,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {1484#true} call #t~ret5 := main(); {1484#true} is VALID [2022-04-15 12:17:31,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {1484#true} ~x~0 := 0; {1489#(= main_~x~0 0)} is VALID [2022-04-15 12:17:31,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {1489#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {1489#(= main_~x~0 0)} is VALID [2022-04-15 12:17:31,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {1489#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1490#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:31,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {1490#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {1490#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:31,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {1490#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:31,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {1491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:31,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {1491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1492#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:31,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {1492#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1492#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:31,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {1492#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1493#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:31,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {1493#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1493#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:31,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {1493#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1494#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:31,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {1494#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1494#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:31,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {1494#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1485#false} is VALID [2022-04-15 12:17:31,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {1485#false} assume !(~x~0 % 4294967296 < 268435455); {1485#false} is VALID [2022-04-15 12:17:31,523 INFO L272 TraceCheckUtils]: 19: Hoare triple {1485#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1485#false} is VALID [2022-04-15 12:17:31,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {1485#false} ~cond := #in~cond; {1485#false} is VALID [2022-04-15 12:17:31,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {1485#false} assume 0 == ~cond; {1485#false} is VALID [2022-04-15 12:17:31,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {1485#false} assume !false; {1485#false} is VALID [2022-04-15 12:17:31,524 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:17:31,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:31,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890743088] [2022-04-15 12:17:31,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890743088] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:31,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686490113] [2022-04-15 12:17:31,526 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:31,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:31,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:31,527 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:17:31,556 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:17:31,573 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:31,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:31,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:17:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:31,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:31,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {1484#true} call ULTIMATE.init(); {1484#true} is VALID [2022-04-15 12:17:31,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {1484#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(13, 2);call #Ultimate.allocInit(12, 3); {1484#true} is VALID [2022-04-15 12:17:31,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-15 12:17:31,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1484#true} #40#return; {1484#true} is VALID [2022-04-15 12:17:31,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {1484#true} call #t~ret5 := main(); {1484#true} is VALID [2022-04-15 12:17:31,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {1484#true} ~x~0 := 0; {1489#(= main_~x~0 0)} is VALID [2022-04-15 12:17:31,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {1489#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {1489#(= main_~x~0 0)} is VALID [2022-04-15 12:17:31,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {1489#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1490#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:31,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {1490#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {1490#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:31,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {1490#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:31,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {1491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:31,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {1491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1492#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:31,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {1492#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1492#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:31,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {1492#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1493#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:31,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {1493#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1493#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:31,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {1493#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:31,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {1544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:31,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {1544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1485#false} is VALID [2022-04-15 12:17:31,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {1485#false} assume !(~x~0 % 4294967296 < 268435455); {1485#false} is VALID [2022-04-15 12:17:31,793 INFO L272 TraceCheckUtils]: 19: Hoare triple {1485#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1485#false} is VALID [2022-04-15 12:17:31,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {1485#false} ~cond := #in~cond; {1485#false} is VALID [2022-04-15 12:17:31,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {1485#false} assume 0 == ~cond; {1485#false} is VALID [2022-04-15 12:17:31,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {1485#false} assume !false; {1485#false} is VALID [2022-04-15 12:17:31,793 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:17:31,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:32,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {1485#false} assume !false; {1485#false} is VALID [2022-04-15 12:17:32,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {1485#false} assume 0 == ~cond; {1485#false} is VALID [2022-04-15 12:17:32,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {1485#false} ~cond := #in~cond; {1485#false} is VALID [2022-04-15 12:17:32,065 INFO L272 TraceCheckUtils]: 19: Hoare triple {1485#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1485#false} is VALID [2022-04-15 12:17:32,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {1485#false} assume !(~x~0 % 4294967296 < 268435455); {1485#false} is VALID [2022-04-15 12:17:32,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {1581#(< (mod main_~x~0 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1485#false} is VALID [2022-04-15 12:17:32,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {1585#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod main_~x~0 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {1581#(< (mod main_~x~0 4294967296) 65521)} is VALID [2022-04-15 12:17:32,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {1589#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1585#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod main_~x~0 4294967296) 65521))} is VALID [2022-04-15 12:17:32,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {1589#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {1589#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65521))} is VALID [2022-04-15 12:17:32,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {1596#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1589#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65521))} is VALID [2022-04-15 12:17:32,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {1596#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {1596#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} is VALID [2022-04-15 12:17:32,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {1603#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1596#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} is VALID [2022-04-15 12:17:32,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {1603#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {1603#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65521))} is VALID [2022-04-15 12:17:32,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {1610#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1603#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65521))} is VALID [2022-04-15 12:17:32,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {1610#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {1610#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-15 12:17:32,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {1617#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1610#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-15 12:17:32,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {1617#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {1617#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65521))} is VALID [2022-04-15 12:17:32,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {1484#true} ~x~0 := 0; {1617#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65521))} is VALID [2022-04-15 12:17:32,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {1484#true} call #t~ret5 := main(); {1484#true} is VALID [2022-04-15 12:17:32,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1484#true} #40#return; {1484#true} is VALID [2022-04-15 12:17:32,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-15 12:17:32,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {1484#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(13, 2);call #Ultimate.allocInit(12, 3); {1484#true} is VALID [2022-04-15 12:17:32,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {1484#true} call ULTIMATE.init(); {1484#true} is VALID [2022-04-15 12:17:32,074 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:17:32,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686490113] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:32,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:32,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2022-04-15 12:17:32,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:32,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [258514973] [2022-04-15 12:17:32,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [258514973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:32,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:32,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:17:32,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758420711] [2022-04-15 12:17:32,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:32,075 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:17:32,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:32,075 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:17:32,094 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:17:32,094 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:17:32,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:32,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:17:32,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:17:32,095 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:17:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:32,350 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 12:17:32,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:17:32,350 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:17:32,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:32,351 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:17:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-15 12:17:32,352 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:17:32,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-15 12:17:32,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-15 12:17:32,381 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:17:32,381 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:17:32,381 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:17:32,382 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:17:32,382 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:32,382 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 34 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:17:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:17:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 12:17:32,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:32,431 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:17:32,431 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:17:32,431 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:17:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:32,432 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:17:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:17:32,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:32,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:32,434 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:17:32,434 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:17:32,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:32,435 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:17:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:17:32,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:32,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:32,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:32,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:32,436 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:17:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-15 12:17:32,436 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2022-04-15 12:17:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:32,436 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-15 12:17:32,436 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:17:32,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-15 12:17:32,481 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:17:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:17:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:17:32,482 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:32,482 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:32,499 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:17:32,682 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:17:32,683 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:32,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:32,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1290036459, now seen corresponding path program 11 times [2022-04-15 12:17:32,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:32,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [758203500] [2022-04-15 12:17:32,881 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:32,883 INFO L85 PathProgramCache]: Analyzing trace with hash -948543439, now seen corresponding path program 1 times [2022-04-15 12:17:32,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:32,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918405168] [2022-04-15 12:17:32,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:32,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:32,898 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:32,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:32,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1290036459, now seen corresponding path program 12 times [2022-04-15 12:17:32,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:32,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234886306] [2022-04-15 12:17:32,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:32,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:33,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:33,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {1841#(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(13, 2);call #Ultimate.allocInit(12, 3); {1829#true} is VALID [2022-04-15 12:17:33,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {1829#true} assume true; {1829#true} is VALID [2022-04-15 12:17:33,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1829#true} {1829#true} #40#return; {1829#true} is VALID [2022-04-15 12:17:33,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {1829#true} call ULTIMATE.init(); {1841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:33,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {1841#(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(13, 2);call #Ultimate.allocInit(12, 3); {1829#true} is VALID [2022-04-15 12:17:33,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {1829#true} assume true; {1829#true} is VALID [2022-04-15 12:17:33,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1829#true} {1829#true} #40#return; {1829#true} is VALID [2022-04-15 12:17:33,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {1829#true} call #t~ret5 := main(); {1829#true} is VALID [2022-04-15 12:17:33,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {1829#true} ~x~0 := 0; {1834#(= main_~x~0 0)} is VALID [2022-04-15 12:17:33,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {1834#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {1834#(= main_~x~0 0)} is VALID [2022-04-15 12:17:33,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {1834#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1835#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:33,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {1835#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {1835#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:33,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {1835#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1836#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:33,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {1836#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1836#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:33,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {1836#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1837#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:33,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {1837#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1837#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:33,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {1837#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:33,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {1838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:33,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {1838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1839#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:33,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {1839#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {1839#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:33,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {1839#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1840#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:33,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {1840#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {1840#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:33,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {1840#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1830#false} is VALID [2022-04-15 12:17:33,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {1830#false} assume !(~x~0 % 4294967296 < 268435455); {1830#false} is VALID [2022-04-15 12:17:33,105 INFO L272 TraceCheckUtils]: 21: Hoare triple {1830#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1830#false} is VALID [2022-04-15 12:17:33,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {1830#false} ~cond := #in~cond; {1830#false} is VALID [2022-04-15 12:17:33,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {1830#false} assume 0 == ~cond; {1830#false} is VALID [2022-04-15 12:17:33,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {1830#false} assume !false; {1830#false} is VALID [2022-04-15 12:17:33,105 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:17:33,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:33,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234886306] [2022-04-15 12:17:33,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234886306] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:33,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136699507] [2022-04-15 12:17:33,106 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:33,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:33,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:33,107 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:17:33,158 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:17:33,176 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:17:33,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:33,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:17:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:33,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:33,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {1829#true} call ULTIMATE.init(); {1829#true} is VALID [2022-04-15 12:17:33,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {1829#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(13, 2);call #Ultimate.allocInit(12, 3); {1829#true} is VALID [2022-04-15 12:17:33,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {1829#true} assume true; {1829#true} is VALID [2022-04-15 12:17:33,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1829#true} {1829#true} #40#return; {1829#true} is VALID [2022-04-15 12:17:33,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {1829#true} call #t~ret5 := main(); {1829#true} is VALID [2022-04-15 12:17:33,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {1829#true} ~x~0 := 0; {1829#true} is VALID [2022-04-15 12:17:33,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:33,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1829#true} is VALID [2022-04-15 12:17:33,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:33,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1829#true} is VALID [2022-04-15 12:17:33,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:33,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1829#true} is VALID [2022-04-15 12:17:33,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:33,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1829#true} is VALID [2022-04-15 12:17:33,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:33,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1829#true} is VALID [2022-04-15 12:17:33,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:33,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1896#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:17:33,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {1896#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {1896#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:17:33,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {1896#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1903#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65521)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65521))} is VALID [2022-04-15 12:17:33,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {1903#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65521)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65521))} assume !(~x~0 % 4294967296 < 268435455); {1830#false} is VALID [2022-04-15 12:17:33,579 INFO L272 TraceCheckUtils]: 21: Hoare triple {1830#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1830#false} is VALID [2022-04-15 12:17:33,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {1830#false} ~cond := #in~cond; {1830#false} is VALID [2022-04-15 12:17:33,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {1830#false} assume 0 == ~cond; {1830#false} is VALID [2022-04-15 12:17:33,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {1830#false} assume !false; {1830#false} is VALID [2022-04-15 12:17:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 12:17:33,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:34,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {1830#false} assume !false; {1830#false} is VALID [2022-04-15 12:17:34,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {1830#false} assume 0 == ~cond; {1830#false} is VALID [2022-04-15 12:17:34,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {1830#false} ~cond := #in~cond; {1830#false} is VALID [2022-04-15 12:17:34,007 INFO L272 TraceCheckUtils]: 21: Hoare triple {1830#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1830#false} is VALID [2022-04-15 12:17:34,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {1931#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {1830#false} is VALID [2022-04-15 12:17:34,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {1935#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {1931#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {1939#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455); {1935#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1939#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 12:17:34,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:34,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1829#true} is VALID [2022-04-15 12:17:34,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:34,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1829#true} is VALID [2022-04-15 12:17:34,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:34,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1829#true} is VALID [2022-04-15 12:17:34,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:34,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1829#true} is VALID [2022-04-15 12:17:34,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:34,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1829#true} is VALID [2022-04-15 12:17:34,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:34,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {1829#true} ~x~0 := 0; {1829#true} is VALID [2022-04-15 12:17:34,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {1829#true} call #t~ret5 := main(); {1829#true} is VALID [2022-04-15 12:17:34,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1829#true} {1829#true} #40#return; {1829#true} is VALID [2022-04-15 12:17:34,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {1829#true} assume true; {1829#true} is VALID [2022-04-15 12:17:34,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {1829#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(13, 2);call #Ultimate.allocInit(12, 3); {1829#true} is VALID [2022-04-15 12:17:34,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {1829#true} call ULTIMATE.init(); {1829#true} is VALID [2022-04-15 12:17:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 12:17:34,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136699507] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:34,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:34,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 5] total 15 [2022-04-15 12:17:34,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:34,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [758203500] [2022-04-15 12:17:34,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [758203500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:34,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:34,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:17:34,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331012461] [2022-04-15 12:17:34,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:34,012 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:17:34,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:34,012 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:17:34,035 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:17:34,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:17:34,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:34,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:17:34,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:17:34,036 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:17:34,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:34,370 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-15 12:17:34,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:17:34,371 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:17:34,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:34,371 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:17:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-15 12:17:34,372 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:17:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-15 12:17:34,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 37 transitions. [2022-04-15 12:17:34,412 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:17:34,413 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:17:34,413 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:17:34,413 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:17:34,415 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:34,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 49 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:17:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:17:34,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 12:17:34,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:34,455 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:17:34,455 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:17:34,455 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:17:34,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:34,457 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 12:17:34,457 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:17:34,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:34,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:34,457 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:17:34,457 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:17:34,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:34,458 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 12:17:34,459 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:17:34,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:34,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:34,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:34,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:34,460 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:17:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-15 12:17:34,461 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2022-04-15 12:17:34,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:34,461 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-15 12:17:34,461 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:17:34,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-15 12:17:34,527 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:17:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:17:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:17:34,527 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:34,527 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:34,547 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:17:34,743 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:17:34,743 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:34,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:34,744 INFO L85 PathProgramCache]: Analyzing trace with hash 421425608, now seen corresponding path program 13 times [2022-04-15 12:17:34,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:34,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [691481410] [2022-04-15 12:17:34,961 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash -889438095, now seen corresponding path program 1 times [2022-04-15 12:17:34,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:34,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895161126] [2022-04-15 12:17:34,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:34,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:34,972 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:34,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:34,984 INFO L85 PathProgramCache]: Analyzing trace with hash 421425608, now seen corresponding path program 14 times [2022-04-15 12:17:34,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:34,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687537954] [2022-04-15 12:17:34,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:34,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:35,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:35,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {2211#(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(13, 2);call #Ultimate.allocInit(12, 3); {2198#true} is VALID [2022-04-15 12:17:35,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {2198#true} assume true; {2198#true} is VALID [2022-04-15 12:17:35,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2198#true} {2198#true} #40#return; {2198#true} is VALID [2022-04-15 12:17:35,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {2198#true} call ULTIMATE.init(); {2211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:35,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {2211#(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(13, 2);call #Ultimate.allocInit(12, 3); {2198#true} is VALID [2022-04-15 12:17:35,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {2198#true} assume true; {2198#true} is VALID [2022-04-15 12:17:35,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2198#true} {2198#true} #40#return; {2198#true} is VALID [2022-04-15 12:17:35,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {2198#true} call #t~ret5 := main(); {2198#true} is VALID [2022-04-15 12:17:35,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {2198#true} ~x~0 := 0; {2203#(= main_~x~0 0)} is VALID [2022-04-15 12:17:35,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {2203#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {2203#(= main_~x~0 0)} is VALID [2022-04-15 12:17:35,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {2203#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2204#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:35,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {2204#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {2204#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:35,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {2204#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2205#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:35,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {2205#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2205#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:35,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {2205#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2206#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:35,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {2206#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2206#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:35,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {2206#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2207#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:35,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {2207#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2207#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:35,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {2207#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2208#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:35,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {2208#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2208#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:35,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {2208#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2209#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:35,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {2209#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {2209#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:35,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {2209#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2210#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-15 12:17:35,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {2210#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !!(~x~0 % 4294967296 < 268435455); {2210#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-15 12:17:35,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {2210#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {2199#false} is VALID [2022-04-15 12:17:35,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {2199#false} assume !(~x~0 % 4294967296 < 268435455); {2199#false} is VALID [2022-04-15 12:17:35,144 INFO L272 TraceCheckUtils]: 23: Hoare triple {2199#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2199#false} is VALID [2022-04-15 12:17:35,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {2199#false} ~cond := #in~cond; {2199#false} is VALID [2022-04-15 12:17:35,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {2199#false} assume 0 == ~cond; {2199#false} is VALID [2022-04-15 12:17:35,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {2199#false} assume !false; {2199#false} is VALID [2022-04-15 12:17:35,144 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:17:35,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:35,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687537954] [2022-04-15 12:17:35,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687537954] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:35,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647221042] [2022-04-15 12:17:35,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:35,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:35,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:35,146 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:17:35,147 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:17:35,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:35,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:35,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 12:17:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:35,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:35,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {2198#true} call ULTIMATE.init(); {2198#true} is VALID [2022-04-15 12:17:35,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {2198#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(13, 2);call #Ultimate.allocInit(12, 3); {2198#true} is VALID [2022-04-15 12:17:35,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {2198#true} assume true; {2198#true} is VALID [2022-04-15 12:17:35,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2198#true} {2198#true} #40#return; {2198#true} is VALID [2022-04-15 12:17:35,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {2198#true} call #t~ret5 := main(); {2198#true} is VALID [2022-04-15 12:17:35,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {2198#true} ~x~0 := 0; {2203#(= main_~x~0 0)} is VALID [2022-04-15 12:17:35,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {2203#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {2203#(= main_~x~0 0)} is VALID [2022-04-15 12:17:35,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {2203#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2204#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:35,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {2204#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {2204#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:35,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {2204#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2205#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:35,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {2205#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2205#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:35,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {2205#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2206#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:35,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {2206#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2206#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:35,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {2206#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2207#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:35,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {2207#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2207#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:35,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {2207#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2208#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:35,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {2208#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2208#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:35,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {2208#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2209#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:35,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {2209#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {2209#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:35,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {2209#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2272#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:35,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {2272#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2272#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:35,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {2272#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {2279#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:35,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {2279#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2199#false} is VALID [2022-04-15 12:17:35,495 INFO L272 TraceCheckUtils]: 23: Hoare triple {2199#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2199#false} is VALID [2022-04-15 12:17:35,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {2199#false} ~cond := #in~cond; {2199#false} is VALID [2022-04-15 12:17:35,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {2199#false} assume 0 == ~cond; {2199#false} is VALID [2022-04-15 12:17:35,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {2199#false} assume !false; {2199#false} is VALID [2022-04-15 12:17:35,496 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:17:35,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:35,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {2199#false} assume !false; {2199#false} is VALID [2022-04-15 12:17:35,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {2199#false} assume 0 == ~cond; {2199#false} is VALID [2022-04-15 12:17:35,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {2199#false} ~cond := #in~cond; {2199#false} is VALID [2022-04-15 12:17:35,760 INFO L272 TraceCheckUtils]: 23: Hoare triple {2199#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2199#false} is VALID [2022-04-15 12:17:35,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {2307#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {2199#false} is VALID [2022-04-15 12:17:35,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {2311#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {2307#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {2311#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2311#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {2318#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2311#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {2318#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2318#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {2325#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2318#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {2325#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2325#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {2332#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2325#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {2332#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2332#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {2339#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2332#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {2339#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2339#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {2346#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2339#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {2346#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2346#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {2353#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2346#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {2353#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2353#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {2360#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2353#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {2360#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2360#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {2198#true} ~x~0 := 0; {2360#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:17:35,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {2198#true} call #t~ret5 := main(); {2198#true} is VALID [2022-04-15 12:17:35,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2198#true} {2198#true} #40#return; {2198#true} is VALID [2022-04-15 12:17:35,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {2198#true} assume true; {2198#true} is VALID [2022-04-15 12:17:35,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {2198#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(13, 2);call #Ultimate.allocInit(12, 3); {2198#true} is VALID [2022-04-15 12:17:35,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {2198#true} call ULTIMATE.init(); {2198#true} is VALID [2022-04-15 12:17:35,772 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:17:35,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647221042] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:35,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:35,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-04-15 12:17:35,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:35,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [691481410] [2022-04-15 12:17:35,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [691481410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:35,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:35,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:17:35,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954547762] [2022-04-15 12:17:35,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:35,774 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:17:35,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:35,774 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:17:35,797 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:17:35,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:17:35,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:35,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:17:35,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:17:35,798 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:17:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:36,171 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-15 12:17:36,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:17:36,172 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:17:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:36,172 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:17:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-15 12:17:36,174 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:17:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-15 12:17:36,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 39 transitions. [2022-04-15 12:17:36,215 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:17:36,216 INFO L225 Difference]: With dead ends: 38 [2022-04-15 12:17:36,216 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 12:17:36,216 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=613, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:17:36,217 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:36,217 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 39 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:17:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 12:17:36,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 12:17:36,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:36,267 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:17:36,268 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:17:36,269 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:17:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:36,270 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 12:17:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 12:17:36,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:36,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:36,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:17:36,272 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:17:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:36,272 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 12:17:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 12:17:36,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:36,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:36,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:36,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:36,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:17:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-15 12:17:36,273 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2022-04-15 12:17:36,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:36,273 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-15 12:17:36,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:17:36,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-15 12:17:36,319 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:17:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 12:17:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:17:36,319 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:36,319 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:36,337 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:17:36,520 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:17:36,520 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:36,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:36,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1089946779, now seen corresponding path program 15 times [2022-04-15 12:17:36,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:36,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1077077745] [2022-04-15 12:17:36,708 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:36,709 INFO L85 PathProgramCache]: Analyzing trace with hash -830332751, now seen corresponding path program 1 times [2022-04-15 12:17:36,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:36,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870531011] [2022-04-15 12:17:36,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:36,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:36,724 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:36,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:36,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1089946779, now seen corresponding path program 16 times [2022-04-15 12:17:36,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:36,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925771762] [2022-04-15 12:17:36,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:36,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:36,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:36,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {2614#(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(13, 2);call #Ultimate.allocInit(12, 3); {2600#true} is VALID [2022-04-15 12:17:36,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {2600#true} assume true; {2600#true} is VALID [2022-04-15 12:17:36,871 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2600#true} {2600#true} #40#return; {2600#true} is VALID [2022-04-15 12:17:36,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {2600#true} call ULTIMATE.init(); {2614#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:36,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {2614#(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(13, 2);call #Ultimate.allocInit(12, 3); {2600#true} is VALID [2022-04-15 12:17:36,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {2600#true} assume true; {2600#true} is VALID [2022-04-15 12:17:36,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2600#true} {2600#true} #40#return; {2600#true} is VALID [2022-04-15 12:17:36,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {2600#true} call #t~ret5 := main(); {2600#true} is VALID [2022-04-15 12:17:36,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {2600#true} ~x~0 := 0; {2605#(= main_~x~0 0)} is VALID [2022-04-15 12:17:36,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {2605#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {2605#(= main_~x~0 0)} is VALID [2022-04-15 12:17:36,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {2605#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2606#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:36,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {2606#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {2606#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:36,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {2606#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2607#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:36,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {2607#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2607#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:36,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {2607#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2608#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:36,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {2608#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2608#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:36,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {2608#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2609#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:36,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {2609#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2609#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:36,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {2609#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2610#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:36,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {2610#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2610#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:36,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {2610#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2611#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:36,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {2611#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {2611#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:36,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {2611#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2612#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:36,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {2612#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2612#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:36,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {2612#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:36,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {2613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {2613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:36,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {2613#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {2601#false} is VALID [2022-04-15 12:17:36,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {2601#false} assume !(~x~0 % 4294967296 < 268435455); {2601#false} is VALID [2022-04-15 12:17:36,880 INFO L272 TraceCheckUtils]: 25: Hoare triple {2601#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2601#false} is VALID [2022-04-15 12:17:36,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {2601#false} ~cond := #in~cond; {2601#false} is VALID [2022-04-15 12:17:36,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {2601#false} assume 0 == ~cond; {2601#false} is VALID [2022-04-15 12:17:36,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {2601#false} assume !false; {2601#false} is VALID [2022-04-15 12:17:36,881 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:17:36,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:36,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925771762] [2022-04-15 12:17:36,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925771762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:36,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129542021] [2022-04-15 12:17:36,881 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:36,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:36,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:36,882 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:17:36,883 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:17:36,914 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:36,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:36,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 12:17:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:36,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:37,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {2600#true} call ULTIMATE.init(); {2600#true} is VALID [2022-04-15 12:17:37,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {2600#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(13, 2);call #Ultimate.allocInit(12, 3); {2600#true} is VALID [2022-04-15 12:17:37,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {2600#true} assume true; {2600#true} is VALID [2022-04-15 12:17:37,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2600#true} {2600#true} #40#return; {2600#true} is VALID [2022-04-15 12:17:37,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {2600#true} call #t~ret5 := main(); {2600#true} is VALID [2022-04-15 12:17:37,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {2600#true} ~x~0 := 0; {2605#(= main_~x~0 0)} is VALID [2022-04-15 12:17:37,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {2605#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {2605#(= main_~x~0 0)} is VALID [2022-04-15 12:17:37,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {2605#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2606#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:37,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {2606#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {2606#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:37,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {2606#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2607#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:37,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {2607#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2607#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:37,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {2607#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2608#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:37,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {2608#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2608#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:37,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {2608#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2609#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:37,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {2609#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2609#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:37,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {2609#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2610#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:37,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {2610#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2610#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:37,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {2610#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2611#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:37,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {2611#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {2611#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:37,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {2611#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2612#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:37,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {2612#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2612#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:37,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {2612#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2681#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:37,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {2681#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2681#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:37,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {2681#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {2688#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:37,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {2688#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2688#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:37,262 INFO L272 TraceCheckUtils]: 25: Hoare triple {2688#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2695#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:37,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {2695#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2699#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:37,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {2699#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2601#false} is VALID [2022-04-15 12:17:37,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {2601#false} assume !false; {2601#false} is VALID [2022-04-15 12:17:37,263 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:17:37,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:37,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {2601#false} assume !false; {2601#false} is VALID [2022-04-15 12:17:37,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {2699#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2601#false} is VALID [2022-04-15 12:17:37,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {2695#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2699#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:37,405 INFO L272 TraceCheckUtils]: 25: Hoare triple {2715#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2695#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:37,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {2715#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {2715#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:37,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {2715#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {2715#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:37,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {2715#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2715#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:37,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {2728#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2715#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:37,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {2728#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2728#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:37,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {2715#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2728#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:37,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {2715#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2715#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:37,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {2728#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2715#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:37,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {2728#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2728#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:37,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {2715#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2728#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:37,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {2715#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2715#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:37,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {2728#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2715#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:37,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {2728#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2728#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:37,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {2715#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2728#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:37,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {2715#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2715#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:37,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {2728#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2715#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:37,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {2728#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2728#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:37,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {2715#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2728#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:37,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {2715#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2715#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:37,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {2600#true} ~x~0 := 0; {2715#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:37,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {2600#true} call #t~ret5 := main(); {2600#true} is VALID [2022-04-15 12:17:37,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2600#true} {2600#true} #40#return; {2600#true} is VALID [2022-04-15 12:17:37,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {2600#true} assume true; {2600#true} is VALID [2022-04-15 12:17:37,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {2600#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(13, 2);call #Ultimate.allocInit(12, 3); {2600#true} is VALID [2022-04-15 12:17:37,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {2600#true} call ULTIMATE.init(); {2600#true} is VALID [2022-04-15 12:17:37,414 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-15 12:17:37,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129542021] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:37,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:37,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 6] total 18 [2022-04-15 12:17:37,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:37,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1077077745] [2022-04-15 12:17:37,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1077077745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:37,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:37,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:17:37,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023079238] [2022-04-15 12:17:37,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:37,416 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:17:37,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:37,416 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:17:37,444 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:17:37,445 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:17:37,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:37,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:17:37,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:17:37,445 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:17:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:37,931 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-15 12:17:37,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:17:37,931 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:17:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:37,932 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:17:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2022-04-15 12:17:37,933 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:17:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2022-04-15 12:17:37,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2022-04-15 12:17:37,968 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:17:37,968 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:17:37,968 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:17:37,969 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:17:37,969 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:37,969 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 49 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:37,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:17:38,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 12:17:38,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:38,025 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:17:38,025 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:17:38,025 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:17:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:38,026 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 12:17:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:17:38,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:38,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:38,026 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:17:38,026 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:17:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:38,027 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 12:17:38,027 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:17:38,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:38,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:38,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:38,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:38,027 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:17:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-15 12:17:38,028 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-15 12:17:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:38,028 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-15 12:17:38,028 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:17:38,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-15 12:17:38,102 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:17:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:17:38,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:17:38,103 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:38,103 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:38,122 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:17:38,310 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:17:38,311 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:38,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:38,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1819864638, now seen corresponding path program 17 times [2022-04-15 12:17:38,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:38,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [540388770] [2022-04-15 12:17:38,466 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:38,468 INFO L85 PathProgramCache]: Analyzing trace with hash -771227407, now seen corresponding path program 1 times [2022-04-15 12:17:38,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:38,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629057714] [2022-04-15 12:17:38,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:38,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:38,479 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:38,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:38,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1819864638, now seen corresponding path program 18 times [2022-04-15 12:17:38,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:38,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820137652] [2022-04-15 12:17:38,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:38,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:38,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:38,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {3039#(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(13, 2);call #Ultimate.allocInit(12, 3); {3024#true} is VALID [2022-04-15 12:17:38,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {3024#true} assume true; {3024#true} is VALID [2022-04-15 12:17:38,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3024#true} {3024#true} #40#return; {3024#true} is VALID [2022-04-15 12:17:38,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {3024#true} call ULTIMATE.init(); {3039#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:38,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {3039#(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(13, 2);call #Ultimate.allocInit(12, 3); {3024#true} is VALID [2022-04-15 12:17:38,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {3024#true} assume true; {3024#true} is VALID [2022-04-15 12:17:38,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3024#true} {3024#true} #40#return; {3024#true} is VALID [2022-04-15 12:17:38,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {3024#true} call #t~ret5 := main(); {3024#true} is VALID [2022-04-15 12:17:38,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {3024#true} ~x~0 := 0; {3029#(= main_~x~0 0)} is VALID [2022-04-15 12:17:38,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {3029#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3029#(= main_~x~0 0)} is VALID [2022-04-15 12:17:38,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {3029#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3030#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:38,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {3030#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {3030#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:38,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {3030#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3031#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:38,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {3031#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3031#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:38,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {3031#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3032#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:38,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {3032#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3032#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:38,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {3032#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3033#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:38,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {3033#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3033#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:38,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {3033#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3034#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:38,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {3034#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3034#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:38,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {3034#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3035#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:38,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {3035#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3035#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:38,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {3035#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3036#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:38,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {3036#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3036#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:38,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {3036#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3037#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:38,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {3037#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3037#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:38,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {3037#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3038#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:38,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {3038#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {3038#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:38,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {3038#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3025#false} is VALID [2022-04-15 12:17:38,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {3025#false} assume !(~x~0 % 4294967296 < 268435455); {3025#false} is VALID [2022-04-15 12:17:38,708 INFO L272 TraceCheckUtils]: 27: Hoare triple {3025#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3025#false} is VALID [2022-04-15 12:17:38,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {3025#false} ~cond := #in~cond; {3025#false} is VALID [2022-04-15 12:17:38,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {3025#false} assume 0 == ~cond; {3025#false} is VALID [2022-04-15 12:17:38,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {3025#false} assume !false; {3025#false} is VALID [2022-04-15 12:17:38,709 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:17:38,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:38,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820137652] [2022-04-15 12:17:38,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820137652] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:38,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110488484] [2022-04-15 12:17:38,709 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:38,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:38,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:38,710 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:17:38,748 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:17:38,776 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:17:38,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:38,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:17:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:38,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:39,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {3024#true} call ULTIMATE.init(); {3024#true} is VALID [2022-04-15 12:17:39,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {3024#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(13, 2);call #Ultimate.allocInit(12, 3); {3024#true} is VALID [2022-04-15 12:17:39,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {3024#true} assume true; {3024#true} is VALID [2022-04-15 12:17:39,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3024#true} {3024#true} #40#return; {3024#true} is VALID [2022-04-15 12:17:39,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {3024#true} call #t~ret5 := main(); {3024#true} is VALID [2022-04-15 12:17:39,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {3024#true} ~x~0 := 0; {3024#true} is VALID [2022-04-15 12:17:39,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3024#true} is VALID [2022-04-15 12:17:39,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3024#true} is VALID [2022-04-15 12:17:39,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3024#true} is VALID [2022-04-15 12:17:39,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3024#true} is VALID [2022-04-15 12:17:39,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3024#true} is VALID [2022-04-15 12:17:39,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3024#true} is VALID [2022-04-15 12:17:39,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3024#true} is VALID [2022-04-15 12:17:39,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3024#true} is VALID [2022-04-15 12:17:39,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3112#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:17:39,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {3112#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {3112#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:17:39,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {3112#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3119#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} is VALID [2022-04-15 12:17:39,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {3119#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 268435455); {3025#false} is VALID [2022-04-15 12:17:39,074 INFO L272 TraceCheckUtils]: 27: Hoare triple {3025#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3025#false} is VALID [2022-04-15 12:17:39,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {3025#false} ~cond := #in~cond; {3025#false} is VALID [2022-04-15 12:17:39,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {3025#false} assume 0 == ~cond; {3025#false} is VALID [2022-04-15 12:17:39,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {3025#false} assume !false; {3025#false} is VALID [2022-04-15 12:17:39,074 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:17:39,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:39,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {3025#false} assume !false; {3025#false} is VALID [2022-04-15 12:17:39,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {3025#false} assume 0 == ~cond; {3025#false} is VALID [2022-04-15 12:17:39,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {3025#false} ~cond := #in~cond; {3025#false} is VALID [2022-04-15 12:17:39,318 INFO L272 TraceCheckUtils]: 27: Hoare triple {3025#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3025#false} is VALID [2022-04-15 12:17:39,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {3147#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {3025#false} is VALID [2022-04-15 12:17:39,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {3151#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3147#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:39,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {3151#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {3151#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3151#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3024#true} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3024#true} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3024#true} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3024#true} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3024#true} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3024#true} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3024#true} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {3024#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3024#true} is VALID [2022-04-15 12:17:39,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {3024#true} assume !!(~x~0 % 4294967296 < 268435455); {3024#true} is VALID [2022-04-15 12:17:39,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {3024#true} ~x~0 := 0; {3024#true} is VALID [2022-04-15 12:17:39,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {3024#true} call #t~ret5 := main(); {3024#true} is VALID [2022-04-15 12:17:39,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3024#true} {3024#true} #40#return; {3024#true} is VALID [2022-04-15 12:17:39,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {3024#true} assume true; {3024#true} is VALID [2022-04-15 12:17:39,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {3024#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(13, 2);call #Ultimate.allocInit(12, 3); {3024#true} is VALID [2022-04-15 12:17:39,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {3024#true} call ULTIMATE.init(); {3024#true} is VALID [2022-04-15 12:17:39,322 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:17:39,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110488484] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:39,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:39,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 17 [2022-04-15 12:17:39,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:39,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [540388770] [2022-04-15 12:17:39,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [540388770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:39,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:39,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:17:39,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251936694] [2022-04-15 12:17:39,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:39,323 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:17:39,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:39,324 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:17:39,348 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:17:39,348 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:17:39,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:39,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:17:39,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:17:39,349 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:17:39,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:39,888 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 12:17:39,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:17:39,889 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:17:39,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:39,889 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:17:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 43 transitions. [2022-04-15 12:17:39,890 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:17:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 43 transitions. [2022-04-15 12:17:39,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 43 transitions. [2022-04-15 12:17:39,943 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:17:39,944 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:17:39,944 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:17:39,945 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:17:39,946 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:39,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 44 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:39,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:17:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 12:17:40,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:40,006 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:17:40,006 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:17:40,006 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:17:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:40,007 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 12:17:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:17:40,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:40,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:40,007 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:17:40,007 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:17:40,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:40,008 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 12:17:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:17:40,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:40,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:40,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:40,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:40,008 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:17:40,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-15 12:17:40,009 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 31 [2022-04-15 12:17:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:40,009 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-15 12:17:40,009 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:17:40,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2022-04-15 12:17:40,064 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:17:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:17:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:17:40,065 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:40,065 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:40,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-15 12:17:40,279 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:17:40,279 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:40,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1103709407, now seen corresponding path program 19 times [2022-04-15 12:17:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:40,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1158026974] [2022-04-15 12:17:40,435 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:40,437 INFO L85 PathProgramCache]: Analyzing trace with hash -712122063, now seen corresponding path program 1 times [2022-04-15 12:17:40,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:40,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45640713] [2022-04-15 12:17:40,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:40,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:40,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:40,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:40,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1103709407, now seen corresponding path program 20 times [2022-04-15 12:17:40,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:40,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551784978] [2022-04-15 12:17:40,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:40,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:40,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:40,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {3489#(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(13, 2);call #Ultimate.allocInit(12, 3); {3473#true} is VALID [2022-04-15 12:17:40,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {3473#true} assume true; {3473#true} is VALID [2022-04-15 12:17:40,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3473#true} {3473#true} #40#return; {3473#true} is VALID [2022-04-15 12:17:40,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {3473#true} call ULTIMATE.init(); {3489#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:40,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {3489#(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(13, 2);call #Ultimate.allocInit(12, 3); {3473#true} is VALID [2022-04-15 12:17:40,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {3473#true} assume true; {3473#true} is VALID [2022-04-15 12:17:40,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3473#true} {3473#true} #40#return; {3473#true} is VALID [2022-04-15 12:17:40,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {3473#true} call #t~ret5 := main(); {3473#true} is VALID [2022-04-15 12:17:40,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {3473#true} ~x~0 := 0; {3478#(= main_~x~0 0)} is VALID [2022-04-15 12:17:40,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {3478#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3478#(= main_~x~0 0)} is VALID [2022-04-15 12:17:40,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {3478#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3479#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:40,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {3479#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {3479#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:40,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {3479#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3480#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:40,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {3480#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3480#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:40,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {3480#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3481#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:40,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {3481#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3481#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:40,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {3481#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3482#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:40,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {3482#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3482#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:40,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {3482#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3483#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:40,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {3483#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3483#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:40,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {3483#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3484#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:40,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {3484#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3484#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:40,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {3484#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3485#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:40,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {3485#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3485#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:40,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {3485#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3486#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:40,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {3486#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3486#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:40,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {3486#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3487#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:40,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {3487#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3487#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:40,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {3487#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3488#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:40,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {3488#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {3488#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:40,643 INFO L290 TraceCheckUtils]: 27: Hoare triple {3488#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3474#false} is VALID [2022-04-15 12:17:40,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {3474#false} assume !(~x~0 % 4294967296 < 268435455); {3474#false} is VALID [2022-04-15 12:17:40,643 INFO L272 TraceCheckUtils]: 29: Hoare triple {3474#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3474#false} is VALID [2022-04-15 12:17:40,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {3474#false} ~cond := #in~cond; {3474#false} is VALID [2022-04-15 12:17:40,643 INFO L290 TraceCheckUtils]: 31: Hoare triple {3474#false} assume 0 == ~cond; {3474#false} is VALID [2022-04-15 12:17:40,643 INFO L290 TraceCheckUtils]: 32: Hoare triple {3474#false} assume !false; {3474#false} is VALID [2022-04-15 12:17:40,643 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:17:40,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:40,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551784978] [2022-04-15 12:17:40,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551784978] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:40,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589747830] [2022-04-15 12:17:40,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:40,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:40,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:40,646 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:17:40,649 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:17:40,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:40,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:40,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:17:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:40,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:41,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {3473#true} call ULTIMATE.init(); {3473#true} is VALID [2022-04-15 12:17:41,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {3473#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(13, 2);call #Ultimate.allocInit(12, 3); {3473#true} is VALID [2022-04-15 12:17:41,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {3473#true} assume true; {3473#true} is VALID [2022-04-15 12:17:41,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3473#true} {3473#true} #40#return; {3473#true} is VALID [2022-04-15 12:17:41,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {3473#true} call #t~ret5 := main(); {3473#true} is VALID [2022-04-15 12:17:41,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {3473#true} ~x~0 := 0; {3478#(= main_~x~0 0)} is VALID [2022-04-15 12:17:41,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {3478#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3478#(= main_~x~0 0)} is VALID [2022-04-15 12:17:41,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {3478#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3479#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:41,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {3479#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {3479#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:41,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {3479#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3480#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:41,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {3480#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3480#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:41,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {3480#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3481#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:41,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {3481#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3481#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:41,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {3481#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3482#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:41,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {3482#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3482#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:41,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {3482#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3483#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:41,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {3483#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3483#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:41,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {3483#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3484#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:41,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {3484#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3484#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:41,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {3484#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3485#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:41,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {3485#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3485#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:41,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {3485#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3486#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:41,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {3486#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3486#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:41,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {3486#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3487#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:41,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {3487#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3487#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:41,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {3487#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3568#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:41,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {3568#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3568#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:41,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {3568#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3575#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:41,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {3575#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3575#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:41,052 INFO L272 TraceCheckUtils]: 29: Hoare triple {3575#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3582#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:41,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {3582#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3586#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:41,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {3586#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3474#false} is VALID [2022-04-15 12:17:41,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {3474#false} assume !false; {3474#false} is VALID [2022-04-15 12:17:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:41,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:41,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {3474#false} assume !false; {3474#false} is VALID [2022-04-15 12:17:41,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {3586#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3474#false} is VALID [2022-04-15 12:17:41,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {3582#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3586#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:41,216 INFO L272 TraceCheckUtils]: 29: Hoare triple {3602#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3582#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:41,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {3602#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {3602#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:41,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {3602#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3602#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:41,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {3602#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3602#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:41,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {3615#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3602#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:41,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {3615#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3615#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:41,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {3602#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3615#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:41,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {3602#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3602#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:41,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {3615#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3602#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:41,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {3615#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3615#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:41,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {3602#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3615#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:41,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {3602#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3602#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:41,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {3615#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3602#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:41,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {3615#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3615#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:41,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {3602#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3615#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:41,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {3602#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3602#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:41,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {3615#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3602#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:41,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {3615#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3615#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:41,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {3602#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3615#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:41,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {3602#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3602#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:41,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {3615#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3602#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:41,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {3615#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3615#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:41,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {3602#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3615#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:41,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {3602#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3602#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:41,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {3473#true} ~x~0 := 0; {3602#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:41,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {3473#true} call #t~ret5 := main(); {3473#true} is VALID [2022-04-15 12:17:41,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3473#true} {3473#true} #40#return; {3473#true} is VALID [2022-04-15 12:17:41,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {3473#true} assume true; {3473#true} is VALID [2022-04-15 12:17:41,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {3473#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(13, 2);call #Ultimate.allocInit(12, 3); {3473#true} is VALID [2022-04-15 12:17:41,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {3473#true} call ULTIMATE.init(); {3473#true} is VALID [2022-04-15 12:17:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-15 12:17:41,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589747830] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:41,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:41,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 6] total 20 [2022-04-15 12:17:41,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:41,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1158026974] [2022-04-15 12:17:41,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1158026974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:41,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:41,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:17:41,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429258243] [2022-04-15 12:17:41,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:41,235 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:17:41,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:41,235 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:17:41,272 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:17:41,272 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:17:41,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:41,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:17:41,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:17:41,273 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:17:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:41,890 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-15 12:17:41,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:17:41,891 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:17:41,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:41,891 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:17:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2022-04-15 12:17:41,892 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:17:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2022-04-15 12:17:41,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 45 transitions. [2022-04-15 12:17:41,935 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:17:41,936 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:17:41,936 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 12:17:41,937 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:17:41,937 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:41,937 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 12:17:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 12:17:42,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:42,013 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:17:42,013 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:17:42,014 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:17:42,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:42,014 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 12:17:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 12:17:42,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:42,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:42,015 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:17:42,015 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:17:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:42,019 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 12:17:42,019 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 12:17:42,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:42,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:42,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:42,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:42,019 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:17:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-15 12:17:42,020 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 33 [2022-04-15 12:17:42,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:42,020 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-15 12:17:42,020 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:17:42,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-15 12:17:42,080 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:17:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 12:17:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:17:42,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:42,081 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:42,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-15 12:17:42,281 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:17:42,282 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:42,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:42,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1749755068, now seen corresponding path program 21 times [2022-04-15 12:17:42,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:42,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1041321380] [2022-04-15 12:17:42,454 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:42,456 INFO L85 PathProgramCache]: Analyzing trace with hash -653016719, now seen corresponding path program 1 times [2022-04-15 12:17:42,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:42,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759699339] [2022-04-15 12:17:42,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:42,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:42,473 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:42,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:42,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1749755068, now seen corresponding path program 22 times [2022-04-15 12:17:42,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:42,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511617255] [2022-04-15 12:17:42,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:42,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:42,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:42,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {3968#(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(13, 2);call #Ultimate.allocInit(12, 3); {3951#true} is VALID [2022-04-15 12:17:42,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {3951#true} assume true; {3951#true} is VALID [2022-04-15 12:17:42,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3951#true} {3951#true} #40#return; {3951#true} is VALID [2022-04-15 12:17:42,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {3951#true} call ULTIMATE.init(); {3968#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:42,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {3968#(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(13, 2);call #Ultimate.allocInit(12, 3); {3951#true} is VALID [2022-04-15 12:17:42,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {3951#true} assume true; {3951#true} is VALID [2022-04-15 12:17:42,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3951#true} {3951#true} #40#return; {3951#true} is VALID [2022-04-15 12:17:42,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {3951#true} call #t~ret5 := main(); {3951#true} is VALID [2022-04-15 12:17:42,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {3951#true} ~x~0 := 0; {3956#(= main_~x~0 0)} is VALID [2022-04-15 12:17:42,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {3956#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3956#(= main_~x~0 0)} is VALID [2022-04-15 12:17:42,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {3956#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3957#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:42,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {3957#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {3957#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:42,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {3957#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:42,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {3958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:42,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {3958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3959#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:42,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {3959#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3959#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:42,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {3959#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3960#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:42,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {3960#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3960#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:42,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {3960#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3961#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:42,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {3961#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3961#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:42,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {3961#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:42,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {3962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:42,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {3962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3963#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:42,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {3963#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3963#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:42,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {3963#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3964#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:42,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {3964#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3964#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:42,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {3964#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3965#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:42,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {3965#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3965#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:42,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {3965#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3966#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:42,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {3966#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3966#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:42,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {3966#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3967#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:42,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {3967#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {3967#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:42,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {3967#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {3952#false} is VALID [2022-04-15 12:17:42,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {3952#false} assume !(~x~0 % 4294967296 < 268435455); {3952#false} is VALID [2022-04-15 12:17:42,711 INFO L272 TraceCheckUtils]: 31: Hoare triple {3952#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3952#false} is VALID [2022-04-15 12:17:42,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {3952#false} ~cond := #in~cond; {3952#false} is VALID [2022-04-15 12:17:42,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {3952#false} assume 0 == ~cond; {3952#false} is VALID [2022-04-15 12:17:42,712 INFO L290 TraceCheckUtils]: 34: Hoare triple {3952#false} assume !false; {3952#false} is VALID [2022-04-15 12:17:42,712 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:17:42,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:42,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511617255] [2022-04-15 12:17:42,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511617255] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:42,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868443919] [2022-04-15 12:17:42,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:42,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:42,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:42,728 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:17:42,729 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:17:42,770 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:42,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:42,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:17:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:42,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:43,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {3951#true} call ULTIMATE.init(); {3951#true} is VALID [2022-04-15 12:17:43,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {3951#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(13, 2);call #Ultimate.allocInit(12, 3); {3951#true} is VALID [2022-04-15 12:17:43,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {3951#true} assume true; {3951#true} is VALID [2022-04-15 12:17:43,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3951#true} {3951#true} #40#return; {3951#true} is VALID [2022-04-15 12:17:43,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {3951#true} call #t~ret5 := main(); {3951#true} is VALID [2022-04-15 12:17:43,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {3951#true} ~x~0 := 0; {3956#(= main_~x~0 0)} is VALID [2022-04-15 12:17:43,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {3956#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3956#(= main_~x~0 0)} is VALID [2022-04-15 12:17:43,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {3956#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3957#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:43,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {3957#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {3957#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:43,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {3957#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:43,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {3958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:43,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {3958#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3959#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:43,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {3959#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3959#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:43,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {3959#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3960#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:43,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {3960#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3960#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:43,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {3960#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3961#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:43,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {3961#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3961#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:43,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {3961#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:43,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {3962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:43,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {3962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3963#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:43,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {3963#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3963#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:43,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {3963#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3964#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:43,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {3964#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3964#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:43,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {3964#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3965#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:43,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {3965#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3965#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:43,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {3965#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3966#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:43,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {3966#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3966#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:43,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {3966#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4053#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:43,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {4053#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4053#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:43,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {4053#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4060#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:43,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {4060#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3952#false} is VALID [2022-04-15 12:17:43,137 INFO L272 TraceCheckUtils]: 31: Hoare triple {3952#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3952#false} is VALID [2022-04-15 12:17:43,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {3952#false} ~cond := #in~cond; {3952#false} is VALID [2022-04-15 12:17:43,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {3952#false} assume 0 == ~cond; {3952#false} is VALID [2022-04-15 12:17:43,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {3952#false} assume !false; {3952#false} is VALID [2022-04-15 12:17:43,138 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:17:43,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:43,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {3952#false} assume !false; {3952#false} is VALID [2022-04-15 12:17:43,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {3952#false} assume 0 == ~cond; {3952#false} is VALID [2022-04-15 12:17:43,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {3952#false} ~cond := #in~cond; {3952#false} is VALID [2022-04-15 12:17:43,608 INFO L272 TraceCheckUtils]: 31: Hoare triple {3952#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3952#false} is VALID [2022-04-15 12:17:43,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {4088#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {3952#false} is VALID [2022-04-15 12:17:43,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {4092#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4088#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {4092#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4092#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {4099#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4092#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {4099#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4099#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {4106#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4099#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {4106#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4106#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {4113#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4106#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {4113#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4113#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {4120#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4113#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {4120#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4120#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {4127#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4120#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {4127#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4127#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {4134#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4127#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {4134#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4134#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {4141#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4134#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {4141#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4141#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {4148#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4141#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {4148#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4148#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {4155#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4148#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {4155#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4155#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {4162#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4155#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {4162#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4162#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {4169#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4162#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {4169#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4169#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {3951#true} ~x~0 := 0; {4169#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:17:43,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {3951#true} call #t~ret5 := main(); {3951#true} is VALID [2022-04-15 12:17:43,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3951#true} {3951#true} #40#return; {3951#true} is VALID [2022-04-15 12:17:43,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {3951#true} assume true; {3951#true} is VALID [2022-04-15 12:17:43,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {3951#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(13, 2);call #Ultimate.allocInit(12, 3); {3951#true} is VALID [2022-04-15 12:17:43,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {3951#true} call ULTIMATE.init(); {3951#true} is VALID [2022-04-15 12:17:43,638 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:17:43,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868443919] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:43,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:43,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2022-04-15 12:17:43,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:43,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1041321380] [2022-04-15 12:17:43,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1041321380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:43,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:43,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:17:43,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403458308] [2022-04-15 12:17:43,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:43,639 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:17:43,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:43,640 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:17:43,670 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:17:43,670 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:17:43,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:43,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:17:43,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=619, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:17:43,671 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:17:44,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:44,441 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-15 12:17:44,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:17:44,441 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:17:44,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:44,441 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:17:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-15 12:17:44,442 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:17:44,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-15 12:17:44,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 47 transitions. [2022-04-15 12:17:44,487 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:17:44,488 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:17:44,488 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:17:44,488 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:17:44,489 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:17:44,489 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:17:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:17:44,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 12:17:44,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:44,551 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:17:44,551 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:17:44,551 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:17:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:44,552 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 12:17:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:17:44,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:44,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:44,552 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:17:44,552 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:17:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:44,553 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 12:17:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:17:44,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:44,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:44,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:44,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:44,553 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:17:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-15 12:17:44,554 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 35 [2022-04-15 12:17:44,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:44,554 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-15 12:17:44,554 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:17:44,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-15 12:17:44,624 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:17:44,624 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:17:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 12:17:44,624 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:44,624 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:44,644 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:17:44,825 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:17:44,825 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:44,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:44,825 INFO L85 PathProgramCache]: Analyzing trace with hash -170622631, now seen corresponding path program 23 times [2022-04-15 12:17:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:44,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1580968552] [2022-04-15 12:17:45,007 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:45,009 INFO L85 PathProgramCache]: Analyzing trace with hash -593911375, now seen corresponding path program 1 times [2022-04-15 12:17:45,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:45,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119538397] [2022-04-15 12:17:45,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:45,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:45,020 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:45,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:45,050 INFO L85 PathProgramCache]: Analyzing trace with hash -170622631, now seen corresponding path program 24 times [2022-04-15 12:17:45,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:45,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333181090] [2022-04-15 12:17:45,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:45,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:45,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:45,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {4483#(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(13, 2);call #Ultimate.allocInit(12, 3); {4465#true} is VALID [2022-04-15 12:17:45,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {4465#true} assume true; {4465#true} is VALID [2022-04-15 12:17:45,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4465#true} {4465#true} #40#return; {4465#true} is VALID [2022-04-15 12:17:45,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {4465#true} call ULTIMATE.init(); {4483#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:45,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {4483#(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(13, 2);call #Ultimate.allocInit(12, 3); {4465#true} is VALID [2022-04-15 12:17:45,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {4465#true} assume true; {4465#true} is VALID [2022-04-15 12:17:45,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4465#true} {4465#true} #40#return; {4465#true} is VALID [2022-04-15 12:17:45,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {4465#true} call #t~ret5 := main(); {4465#true} is VALID [2022-04-15 12:17:45,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {4465#true} ~x~0 := 0; {4470#(= main_~x~0 0)} is VALID [2022-04-15 12:17:45,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {4470#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {4470#(= main_~x~0 0)} is VALID [2022-04-15 12:17:45,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {4470#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4471#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:45,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {4471#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {4471#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:45,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {4471#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4472#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:45,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {4472#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4472#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:45,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {4472#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4473#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:45,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {4473#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4473#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:45,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {4473#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4474#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:45,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {4474#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4474#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:45,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {4474#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4475#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:45,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {4475#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {4475#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:45,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {4475#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4476#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:45,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {4476#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {4476#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:45,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {4476#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4477#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:45,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {4477#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4477#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:45,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {4477#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4478#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:45,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {4478#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4478#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:45,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {4478#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4479#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:45,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {4479#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4479#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:45,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {4479#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4480#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:45,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {4480#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4480#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:45,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {4480#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4481#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:45,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {4481#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4481#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:45,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {4481#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4482#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:45,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {4482#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {4482#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:45,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {4482#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4466#false} is VALID [2022-04-15 12:17:45,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {4466#false} assume !(~x~0 % 4294967296 < 268435455); {4466#false} is VALID [2022-04-15 12:17:45,302 INFO L272 TraceCheckUtils]: 33: Hoare triple {4466#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4466#false} is VALID [2022-04-15 12:17:45,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {4466#false} ~cond := #in~cond; {4466#false} is VALID [2022-04-15 12:17:45,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {4466#false} assume 0 == ~cond; {4466#false} is VALID [2022-04-15 12:17:45,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {4466#false} assume !false; {4466#false} is VALID [2022-04-15 12:17:45,302 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:17:45,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:45,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333181090] [2022-04-15 12:17:45,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333181090] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:45,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936888581] [2022-04-15 12:17:45,303 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:45,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:45,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:45,304 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:17:45,304 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:17:45,346 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:17:45,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:45,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:17:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:45,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:45,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {4465#true} call ULTIMATE.init(); {4465#true} is VALID [2022-04-15 12:17:45,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {4465#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(13, 2);call #Ultimate.allocInit(12, 3); {4465#true} is VALID [2022-04-15 12:17:45,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {4465#true} assume true; {4465#true} is VALID [2022-04-15 12:17:45,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4465#true} {4465#true} #40#return; {4465#true} is VALID [2022-04-15 12:17:45,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {4465#true} call #t~ret5 := main(); {4465#true} is VALID [2022-04-15 12:17:45,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {4465#true} ~x~0 := 0; {4465#true} is VALID [2022-04-15 12:17:45,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4574#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:17:45,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {4574#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {4574#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:17:45,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {4574#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4581#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} is VALID [2022-04-15 12:17:45,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {4581#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 268435455); {4466#false} is VALID [2022-04-15 12:17:45,637 INFO L272 TraceCheckUtils]: 33: Hoare triple {4466#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4466#false} is VALID [2022-04-15 12:17:45,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {4466#false} ~cond := #in~cond; {4466#false} is VALID [2022-04-15 12:17:45,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {4466#false} assume 0 == ~cond; {4466#false} is VALID [2022-04-15 12:17:45,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {4466#false} assume !false; {4466#false} is VALID [2022-04-15 12:17:45,637 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:17:45,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:45,880 INFO L290 TraceCheckUtils]: 36: Hoare triple {4466#false} assume !false; {4466#false} is VALID [2022-04-15 12:17:45,880 INFO L290 TraceCheckUtils]: 35: Hoare triple {4466#false} assume 0 == ~cond; {4466#false} is VALID [2022-04-15 12:17:45,880 INFO L290 TraceCheckUtils]: 34: Hoare triple {4466#false} ~cond := #in~cond; {4466#false} is VALID [2022-04-15 12:17:45,880 INFO L272 TraceCheckUtils]: 33: Hoare triple {4466#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4466#false} is VALID [2022-04-15 12:17:45,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {4609#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {4466#false} is VALID [2022-04-15 12:17:45,882 INFO L290 TraceCheckUtils]: 31: Hoare triple {4613#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4609#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:45,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {4613#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4613#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:45,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4613#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:45,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {4465#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4465#true} is VALID [2022-04-15 12:17:45,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {4465#true} assume !!(~x~0 % 4294967296 < 268435455); {4465#true} is VALID [2022-04-15 12:17:45,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {4465#true} ~x~0 := 0; {4465#true} is VALID [2022-04-15 12:17:45,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {4465#true} call #t~ret5 := main(); {4465#true} is VALID [2022-04-15 12:17:45,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4465#true} {4465#true} #40#return; {4465#true} is VALID [2022-04-15 12:17:45,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {4465#true} assume true; {4465#true} is VALID [2022-04-15 12:17:45,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {4465#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(13, 2);call #Ultimate.allocInit(12, 3); {4465#true} is VALID [2022-04-15 12:17:45,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {4465#true} call ULTIMATE.init(); {4465#true} is VALID [2022-04-15 12:17:45,886 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:17:45,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936888581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:45,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:45,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4, 4] total 20 [2022-04-15 12:17:45,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:45,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1580968552] [2022-04-15 12:17:45,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1580968552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:45,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:45,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:17:45,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089250068] [2022-04-15 12:17:45,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:45,887 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:17:45,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:45,887 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:17:45,918 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:17:45,918 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:17:45,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:45,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:17:45,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:17:45,919 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:17:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:46,770 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-15 12:17:46,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:17:46,770 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:17:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:46,770 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:17:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-15 12:17:46,773 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:17:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-15 12:17:46,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 49 transitions. [2022-04-15 12:17:46,836 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:17:46,836 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:17:46,837 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 12:17:46,837 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:17:46,837 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:46,838 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 34 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:46,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 12:17:46,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 12:17:46,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:46,913 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:17:46,913 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:17:46,913 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:17:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:46,914 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 12:17:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 12:17:46,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:46,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:46,914 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:17:46,915 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:17:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:46,915 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 12:17:46,915 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 12:17:46,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:46,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:46,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:46,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:46,916 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:17:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-04-15 12:17:46,916 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 37 [2022-04-15 12:17:46,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:46,916 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-04-15 12:17:46,928 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:17:46,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 43 transitions. [2022-04-15 12:17:47,014 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:17:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 12:17:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 12:17:47,014 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:47,014 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:47,032 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:17:47,223 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:17:47,224 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:47,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:47,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1182345910, now seen corresponding path program 25 times [2022-04-15 12:17:47,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:47,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2109302623] [2022-04-15 12:17:47,418 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:47,420 INFO L85 PathProgramCache]: Analyzing trace with hash -534806031, now seen corresponding path program 1 times [2022-04-15 12:17:47,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:47,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042355372] [2022-04-15 12:17:47,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:47,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:47,432 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:47,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:47,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1182345910, now seen corresponding path program 26 times [2022-04-15 12:17:47,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:47,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098479441] [2022-04-15 12:17:47,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:47,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:47,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:47,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {5014#(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(13, 2);call #Ultimate.allocInit(12, 3); {4995#true} is VALID [2022-04-15 12:17:47,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-15 12:17:47,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4995#true} {4995#true} #40#return; {4995#true} is VALID [2022-04-15 12:17:47,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {4995#true} call ULTIMATE.init(); {5014#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:47,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {5014#(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(13, 2);call #Ultimate.allocInit(12, 3); {4995#true} is VALID [2022-04-15 12:17:47,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-15 12:17:47,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4995#true} {4995#true} #40#return; {4995#true} is VALID [2022-04-15 12:17:47,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {4995#true} call #t~ret5 := main(); {4995#true} is VALID [2022-04-15 12:17:47,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {4995#true} ~x~0 := 0; {5000#(= main_~x~0 0)} is VALID [2022-04-15 12:17:47,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {5000#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {5000#(= main_~x~0 0)} is VALID [2022-04-15 12:17:47,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {5000#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5001#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:47,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {5001#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {5001#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:47,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {5001#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5002#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:47,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {5002#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {5002#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:47,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {5002#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5003#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:47,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {5003#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5003#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:47,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {5003#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5004#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:47,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {5004#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5004#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:47,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {5004#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5005#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:47,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {5005#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {5005#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:47,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {5005#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5006#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:47,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {5006#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {5006#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:47,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {5006#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5007#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:47,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {5007#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5007#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:47,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {5007#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5008#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:47,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {5008#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5008#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:47,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {5008#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5009#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:47,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {5009#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5009#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:47,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {5009#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5010#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:47,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {5010#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5010#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:47,706 INFO L290 TraceCheckUtils]: 27: Hoare triple {5010#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5011#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:47,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {5011#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5011#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:47,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {5011#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:47,707 INFO L290 TraceCheckUtils]: 30: Hoare triple {5012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:47,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {5012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5013#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:47,708 INFO L290 TraceCheckUtils]: 32: Hoare triple {5013#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {5013#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:47,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {5013#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {4996#false} is VALID [2022-04-15 12:17:47,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {4996#false} assume !(~x~0 % 4294967296 < 268435455); {4996#false} is VALID [2022-04-15 12:17:47,709 INFO L272 TraceCheckUtils]: 35: Hoare triple {4996#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4996#false} is VALID [2022-04-15 12:17:47,709 INFO L290 TraceCheckUtils]: 36: Hoare triple {4996#false} ~cond := #in~cond; {4996#false} is VALID [2022-04-15 12:17:47,709 INFO L290 TraceCheckUtils]: 37: Hoare triple {4996#false} assume 0 == ~cond; {4996#false} is VALID [2022-04-15 12:17:47,709 INFO L290 TraceCheckUtils]: 38: Hoare triple {4996#false} assume !false; {4996#false} is VALID [2022-04-15 12:17:47,710 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:17:47,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:47,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098479441] [2022-04-15 12:17:47,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098479441] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:47,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192339019] [2022-04-15 12:17:47,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:47,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:47,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:47,711 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:17:47,712 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:17:47,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:47,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:47,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 12:17:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:47,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:48,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {4995#true} call ULTIMATE.init(); {4995#true} is VALID [2022-04-15 12:17:48,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {4995#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(13, 2);call #Ultimate.allocInit(12, 3); {4995#true} is VALID [2022-04-15 12:17:48,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-15 12:17:48,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4995#true} {4995#true} #40#return; {4995#true} is VALID [2022-04-15 12:17:48,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {4995#true} call #t~ret5 := main(); {4995#true} is VALID [2022-04-15 12:17:48,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {4995#true} ~x~0 := 0; {5000#(= main_~x~0 0)} is VALID [2022-04-15 12:17:48,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {5000#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {5000#(= main_~x~0 0)} is VALID [2022-04-15 12:17:48,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {5000#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5001#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:48,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {5001#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {5001#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:48,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {5001#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5002#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:48,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {5002#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {5002#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:48,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {5002#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5003#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:48,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {5003#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5003#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:48,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {5003#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5004#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:48,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {5004#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5004#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:48,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {5004#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5005#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:48,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {5005#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {5005#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:48,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {5005#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5006#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:48,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {5006#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {5006#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:48,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {5006#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5007#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:48,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {5007#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5007#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:48,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {5007#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5008#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:48,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {5008#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5008#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:48,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {5008#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5009#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:48,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {5009#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5009#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:48,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {5009#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5010#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:48,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {5010#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5010#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:48,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {5010#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5011#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:48,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {5011#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5011#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:48,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {5011#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:48,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {5012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:48,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {5012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5111#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:48,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {5111#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5111#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:48,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {5111#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {5118#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:48,136 INFO L290 TraceCheckUtils]: 34: Hoare triple {5118#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 < 268435455); {4996#false} is VALID [2022-04-15 12:17:48,136 INFO L272 TraceCheckUtils]: 35: Hoare triple {4996#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4996#false} is VALID [2022-04-15 12:17:48,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {4996#false} ~cond := #in~cond; {4996#false} is VALID [2022-04-15 12:17:48,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {4996#false} assume 0 == ~cond; {4996#false} is VALID [2022-04-15 12:17:48,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {4996#false} assume !false; {4996#false} is VALID [2022-04-15 12:17:48,137 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:17:48,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:48,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {4996#false} assume !false; {4996#false} is VALID [2022-04-15 12:17:48,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {4996#false} assume 0 == ~cond; {4996#false} is VALID [2022-04-15 12:17:48,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {4996#false} ~cond := #in~cond; {4996#false} is VALID [2022-04-15 12:17:48,741 INFO L272 TraceCheckUtils]: 35: Hoare triple {4996#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4996#false} is VALID [2022-04-15 12:17:48,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {5146#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {4996#false} is VALID [2022-04-15 12:17:48,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {5150#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {5146#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {5150#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5150#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,745 INFO L290 TraceCheckUtils]: 31: Hoare triple {5157#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5150#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,745 INFO L290 TraceCheckUtils]: 30: Hoare triple {5157#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5157#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {5164#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5157#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {5164#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5164#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {5171#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5164#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {5171#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5171#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {5178#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5171#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {5178#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5178#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {5185#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5178#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {5185#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5185#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {5192#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5185#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {5192#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5192#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {5199#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5192#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {5199#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5199#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {5206#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5199#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {5206#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5206#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {5213#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5206#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {5213#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5213#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {5220#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5213#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {5220#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5220#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {5227#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5220#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {5227#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5227#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {5234#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5227#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {5234#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5234#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {5241#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5234#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {5241#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5241#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {4995#true} ~x~0 := 0; {5241#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:17:48,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {4995#true} call #t~ret5 := main(); {4995#true} is VALID [2022-04-15 12:17:48,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4995#true} {4995#true} #40#return; {4995#true} is VALID [2022-04-15 12:17:48,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-15 12:17:48,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {4995#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(13, 2);call #Ultimate.allocInit(12, 3); {4995#true} is VALID [2022-04-15 12:17:48,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {4995#true} call ULTIMATE.init(); {4995#true} is VALID [2022-04-15 12:17:48,764 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:17:48,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192339019] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:48,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:48,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-04-15 12:17:48,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:48,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2109302623] [2022-04-15 12:17:48,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2109302623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:48,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:48,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:17:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981829050] [2022-04-15 12:17:48,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:48,765 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:17:48,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:48,766 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:17:48,811 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:17:48,811 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:17:48,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:48,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:17:48,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=803, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:17:48,812 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:17:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:49,792 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-15 12:17:49,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:17:49,792 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:17:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:49,792 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:17:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2022-04-15 12:17:49,793 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:17:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2022-04-15 12:17:49,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 51 transitions. [2022-04-15 12:17:49,845 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:17:49,846 INFO L225 Difference]: With dead ends: 50 [2022-04-15 12:17:49,846 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 12:17:49,847 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=611, Invalid=1645, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:17:49,847 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:49,848 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 34 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:17:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 12:17:49,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 12:17:49,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:49,919 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:17:49,919 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:17:49,919 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:17:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:49,920 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-04-15 12:17:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-15 12:17:49,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:49,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:49,920 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:17:49,920 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:17:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:49,921 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-04-15 12:17:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-15 12:17:49,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:49,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:49,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:49,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:49,921 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:17:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-04-15 12:17:49,922 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 39 [2022-04-15 12:17:49,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:49,922 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-04-15 12:17:49,922 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:17:49,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 45 transitions. [2022-04-15 12:17:49,990 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:17:49,990 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-15 12:17:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 12:17:49,990 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:49,991 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:50,008 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:17:50,191 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:17:50,191 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:50,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:50,192 INFO L85 PathProgramCache]: Analyzing trace with hash 10023123, now seen corresponding path program 27 times [2022-04-15 12:17:50,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:50,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [374744941] [2022-04-15 12:17:50,359 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash -475700687, now seen corresponding path program 1 times [2022-04-15 12:17:50,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:50,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148845983] [2022-04-15 12:17:50,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:50,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:50,389 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:50,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:50,395 INFO L85 PathProgramCache]: Analyzing trace with hash 10023123, now seen corresponding path program 28 times [2022-04-15 12:17:50,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:50,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081952154] [2022-04-15 12:17:50,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:50,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:50,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:50,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {5585#(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(13, 2);call #Ultimate.allocInit(12, 3); {5565#true} is VALID [2022-04-15 12:17:50,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {5565#true} assume true; {5565#true} is VALID [2022-04-15 12:17:50,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5565#true} {5565#true} #40#return; {5565#true} is VALID [2022-04-15 12:17:50,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {5565#true} call ULTIMATE.init(); {5585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:50,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {5585#(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(13, 2);call #Ultimate.allocInit(12, 3); {5565#true} is VALID [2022-04-15 12:17:50,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {5565#true} assume true; {5565#true} is VALID [2022-04-15 12:17:50,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5565#true} {5565#true} #40#return; {5565#true} is VALID [2022-04-15 12:17:50,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {5565#true} call #t~ret5 := main(); {5565#true} is VALID [2022-04-15 12:17:50,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {5565#true} ~x~0 := 0; {5570#(= main_~x~0 0)} is VALID [2022-04-15 12:17:50,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {5570#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {5570#(= main_~x~0 0)} is VALID [2022-04-15 12:17:50,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {5570#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5571#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:50,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {5571#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {5571#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:50,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {5571#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5572#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:50,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {5572#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {5572#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:50,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {5572#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5573#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:50,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {5573#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5573#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:50,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {5573#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5574#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:50,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {5574#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5574#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:50,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {5574#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5575#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:50,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {5575#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {5575#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:50,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {5575#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5576#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:50,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {5576#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {5576#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:50,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {5576#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5577#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:50,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {5577#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5577#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:50,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {5577#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5578#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:50,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {5578#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5578#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:50,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {5578#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5579#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:50,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {5579#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5579#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:50,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {5579#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5580#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:50,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {5580#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5580#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:50,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {5580#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5581#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:50,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {5581#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5581#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:50,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {5581#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:50,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {5582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:50,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {5582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5583#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:50,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {5583#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5583#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:50,664 INFO L290 TraceCheckUtils]: 33: Hoare triple {5583#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5584#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:50,664 INFO L290 TraceCheckUtils]: 34: Hoare triple {5584#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {5584#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:50,665 INFO L290 TraceCheckUtils]: 35: Hoare triple {5584#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {5566#false} is VALID [2022-04-15 12:17:50,665 INFO L290 TraceCheckUtils]: 36: Hoare triple {5566#false} assume !(~x~0 % 4294967296 < 268435455); {5566#false} is VALID [2022-04-15 12:17:50,665 INFO L272 TraceCheckUtils]: 37: Hoare triple {5566#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5566#false} is VALID [2022-04-15 12:17:50,665 INFO L290 TraceCheckUtils]: 38: Hoare triple {5566#false} ~cond := #in~cond; {5566#false} is VALID [2022-04-15 12:17:50,665 INFO L290 TraceCheckUtils]: 39: Hoare triple {5566#false} assume 0 == ~cond; {5566#false} is VALID [2022-04-15 12:17:50,666 INFO L290 TraceCheckUtils]: 40: Hoare triple {5566#false} assume !false; {5566#false} is VALID [2022-04-15 12:17:50,666 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:17:50,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:50,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081952154] [2022-04-15 12:17:50,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081952154] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:50,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403103805] [2022-04-15 12:17:50,666 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:50,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:50,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:50,667 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:17:50,679 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:17:50,718 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:50,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:50,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 12:17:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:50,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:51,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {5565#true} call ULTIMATE.init(); {5565#true} is VALID [2022-04-15 12:17:51,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {5565#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(13, 2);call #Ultimate.allocInit(12, 3); {5565#true} is VALID [2022-04-15 12:17:51,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {5565#true} assume true; {5565#true} is VALID [2022-04-15 12:17:51,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5565#true} {5565#true} #40#return; {5565#true} is VALID [2022-04-15 12:17:51,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {5565#true} call #t~ret5 := main(); {5565#true} is VALID [2022-04-15 12:17:51,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {5565#true} ~x~0 := 0; {5570#(= main_~x~0 0)} is VALID [2022-04-15 12:17:51,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {5570#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {5570#(= main_~x~0 0)} is VALID [2022-04-15 12:17:51,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {5570#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5571#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:51,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {5571#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {5571#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:51,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {5571#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5572#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:51,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {5572#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {5572#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:51,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {5572#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5573#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:51,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {5573#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5573#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:51,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {5573#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5574#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:51,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {5574#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5574#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:51,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {5574#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5575#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:51,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {5575#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {5575#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:51,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {5575#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5576#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:51,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {5576#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {5576#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:51,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {5576#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5577#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:51,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {5577#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5577#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:51,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {5577#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5578#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:51,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {5578#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5578#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:51,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {5578#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5579#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:51,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {5579#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5579#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:51,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {5579#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5580#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:51,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {5580#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5580#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:51,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {5580#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5581#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:51,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {5581#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5581#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:51,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {5581#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:51,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {5582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:51,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {5582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5583#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:51,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {5583#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5583#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:51,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {5583#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5688#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:51,128 INFO L290 TraceCheckUtils]: 34: Hoare triple {5688#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {5688#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:51,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {5688#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {5695#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:51,129 INFO L290 TraceCheckUtils]: 36: Hoare triple {5695#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {5695#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:51,129 INFO L272 TraceCheckUtils]: 37: Hoare triple {5695#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5702#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:51,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {5702#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5706#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:51,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {5706#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5566#false} is VALID [2022-04-15 12:17:51,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {5566#false} assume !false; {5566#false} is VALID [2022-04-15 12:17:51,130 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:17:51,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:51,318 INFO L290 TraceCheckUtils]: 40: Hoare triple {5566#false} assume !false; {5566#false} is VALID [2022-04-15 12:17:51,318 INFO L290 TraceCheckUtils]: 39: Hoare triple {5706#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5566#false} is VALID [2022-04-15 12:17:51,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {5702#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5706#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:51,319 INFO L272 TraceCheckUtils]: 37: Hoare triple {5722#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5702#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:51,320 INFO L290 TraceCheckUtils]: 36: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {5735#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {5735#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5735#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:51,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5735#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:51,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {5735#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {5735#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5735#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:51,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5735#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:51,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {5735#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {5735#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5735#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:51,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5735#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:51,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {5735#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {5735#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5735#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:51,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5735#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:51,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {5735#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {5735#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5735#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:51,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5735#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:51,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {5735#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {5735#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5735#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:51,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5735#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:51,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {5735#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {5735#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5735#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:51,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5735#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:51,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {5722#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {5565#true} ~x~0 := 0; {5722#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:51,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {5565#true} call #t~ret5 := main(); {5565#true} is VALID [2022-04-15 12:17:51,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5565#true} {5565#true} #40#return; {5565#true} is VALID [2022-04-15 12:17:51,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {5565#true} assume true; {5565#true} is VALID [2022-04-15 12:17:51,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {5565#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(13, 2);call #Ultimate.allocInit(12, 3); {5565#true} is VALID [2022-04-15 12:17:51,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {5565#true} call ULTIMATE.init(); {5565#true} is VALID [2022-04-15 12:17:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-04-15 12:17:51,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403103805] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:51,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:51,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 6] total 24 [2022-04-15 12:17:51,338 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:51,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [374744941] [2022-04-15 12:17:51,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [374744941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:51,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:51,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:17:51,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204281447] [2022-04-15 12:17:51,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:51,339 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:17:51,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:51,339 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:17:51,377 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:17:51,377 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:17:51,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:51,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:17:51,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:17:51,378 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:17:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:52,575 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-15 12:17:52,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:17:52,575 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:17:52,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:52,576 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:17:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2022-04-15 12:17:52,576 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:17:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2022-04-15 12:17:52,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 53 transitions. [2022-04-15 12:17:52,633 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:17:52,634 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:17:52,634 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 12:17:52,635 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:17:52,635 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:52,635 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 24 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:17:52,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 12:17:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 12:17:52,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:52,728 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:17:52,728 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:17:52,728 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:17:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:52,729 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-15 12:17:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 12:17:52,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:52,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:52,730 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:17:52,730 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:17:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:52,730 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-15 12:17:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 12:17:52,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:52,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:52,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:52,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:52,731 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:17:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-15 12:17:52,731 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 41 [2022-04-15 12:17:52,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:52,732 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-15 12:17:52,732 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:17:52,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 47 transitions. [2022-04-15 12:17:52,805 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:17:52,805 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 12:17:52,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 12:17:52,805 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:52,806 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:52,822 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:17:53,006 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:17:53,006 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:53,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:53,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1310743632, now seen corresponding path program 29 times [2022-04-15 12:17:53,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:53,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1601524215] [2022-04-15 12:17:53,165 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:53,167 INFO L85 PathProgramCache]: Analyzing trace with hash -416595343, now seen corresponding path program 1 times [2022-04-15 12:17:53,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:53,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310444788] [2022-04-15 12:17:53,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:53,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:53,178 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:53,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:53,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1310743632, now seen corresponding path program 30 times [2022-04-15 12:17:53,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:53,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986396983] [2022-04-15 12:17:53,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:53,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:53,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:53,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {6172#(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(13, 2);call #Ultimate.allocInit(12, 3); {6151#true} is VALID [2022-04-15 12:17:53,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {6151#true} assume true; {6151#true} is VALID [2022-04-15 12:17:53,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6151#true} {6151#true} #40#return; {6151#true} is VALID [2022-04-15 12:17:53,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {6151#true} call ULTIMATE.init(); {6172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:53,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {6172#(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(13, 2);call #Ultimate.allocInit(12, 3); {6151#true} is VALID [2022-04-15 12:17:53,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {6151#true} assume true; {6151#true} is VALID [2022-04-15 12:17:53,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6151#true} {6151#true} #40#return; {6151#true} is VALID [2022-04-15 12:17:53,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {6151#true} call #t~ret5 := main(); {6151#true} is VALID [2022-04-15 12:17:53,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {6151#true} ~x~0 := 0; {6156#(= main_~x~0 0)} is VALID [2022-04-15 12:17:53,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {6156#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {6156#(= main_~x~0 0)} is VALID [2022-04-15 12:17:53,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {6156#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6157#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:53,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {6157#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {6157#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:53,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {6157#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6158#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:53,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {6158#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {6158#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:53,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {6158#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6159#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:53,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {6159#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6159#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:53,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {6159#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6160#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:53,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {6160#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6160#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:53,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {6160#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6161#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:53,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {6161#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {6161#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:53,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {6161#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6162#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:53,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {6162#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {6162#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:53,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {6162#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6163#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:53,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {6163#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6163#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:53,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {6163#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6164#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:53,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {6164#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6164#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:53,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {6164#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6165#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:53,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {6165#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6165#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:53,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {6165#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6166#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:53,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {6166#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6166#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:53,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {6166#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6167#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:53,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {6167#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6167#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:53,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {6167#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6168#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:53,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {6168#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6168#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:53,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {6168#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6169#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:53,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {6169#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6169#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:53,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {6169#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6170#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:53,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {6170#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {6170#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:53,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {6170#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6171#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:53,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {6171#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {6171#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:53,522 INFO L290 TraceCheckUtils]: 37: Hoare triple {6171#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {6152#false} is VALID [2022-04-15 12:17:53,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {6152#false} assume !(~x~0 % 4294967296 < 268435455); {6152#false} is VALID [2022-04-15 12:17:53,522 INFO L272 TraceCheckUtils]: 39: Hoare triple {6152#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6152#false} is VALID [2022-04-15 12:17:53,522 INFO L290 TraceCheckUtils]: 40: Hoare triple {6152#false} ~cond := #in~cond; {6152#false} is VALID [2022-04-15 12:17:53,522 INFO L290 TraceCheckUtils]: 41: Hoare triple {6152#false} assume 0 == ~cond; {6152#false} is VALID [2022-04-15 12:17:53,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {6152#false} assume !false; {6152#false} is VALID [2022-04-15 12:17:53,522 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:17:53,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:53,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986396983] [2022-04-15 12:17:53,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986396983] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:53,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657631924] [2022-04-15 12:17:53,523 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:53,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:53,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:53,524 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:17:53,525 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:17:53,590 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:17:53,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:53,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:17:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:53,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:53,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {6151#true} call ULTIMATE.init(); {6151#true} is VALID [2022-04-15 12:17:53,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {6151#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(13, 2);call #Ultimate.allocInit(12, 3); {6151#true} is VALID [2022-04-15 12:17:53,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {6151#true} assume true; {6151#true} is VALID [2022-04-15 12:17:53,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6151#true} {6151#true} #40#return; {6151#true} is VALID [2022-04-15 12:17:53,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {6151#true} call #t~ret5 := main(); {6151#true} is VALID [2022-04-15 12:17:53,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {6151#true} ~x~0 := 0; {6151#true} is VALID [2022-04-15 12:17:53,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:53,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:53,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:53,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:53,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:53,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:53,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:53,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:53,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:53,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:53,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:53,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:53,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:53,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:53,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:53,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:53,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:53,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:53,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:53,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:53,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:53,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:53,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:53,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:53,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:53,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:53,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:53,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:53,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:53,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6281#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:17:53,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {6281#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {6281#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:17:53,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {6281#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {6288#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} is VALID [2022-04-15 12:17:53,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {6288#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 268435455); {6152#false} is VALID [2022-04-15 12:17:53,903 INFO L272 TraceCheckUtils]: 39: Hoare triple {6152#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6152#false} is VALID [2022-04-15 12:17:53,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {6152#false} ~cond := #in~cond; {6152#false} is VALID [2022-04-15 12:17:53,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {6152#false} assume 0 == ~cond; {6152#false} is VALID [2022-04-15 12:17:53,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {6152#false} assume !false; {6152#false} is VALID [2022-04-15 12:17:53,904 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:17:53,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:54,193 INFO L290 TraceCheckUtils]: 42: Hoare triple {6152#false} assume !false; {6152#false} is VALID [2022-04-15 12:17:54,193 INFO L290 TraceCheckUtils]: 41: Hoare triple {6152#false} assume 0 == ~cond; {6152#false} is VALID [2022-04-15 12:17:54,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {6152#false} ~cond := #in~cond; {6152#false} is VALID [2022-04-15 12:17:54,193 INFO L272 TraceCheckUtils]: 39: Hoare triple {6152#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6152#false} is VALID [2022-04-15 12:17:54,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {6316#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {6152#false} is VALID [2022-04-15 12:17:54,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {6320#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {6316#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:54,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {6320#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {6320#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:54,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6320#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:54,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:54,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:54,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:54,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:54,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:54,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:54,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:54,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:54,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:54,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:54,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:54,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:54,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:54,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:54,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:54,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:54,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:54,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:54,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:54,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:54,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:54,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:54,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:54,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:54,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:54,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:54,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:54,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {6151#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6151#true} is VALID [2022-04-15 12:17:54,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {6151#true} assume !!(~x~0 % 4294967296 < 268435455); {6151#true} is VALID [2022-04-15 12:17:54,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {6151#true} ~x~0 := 0; {6151#true} is VALID [2022-04-15 12:17:54,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {6151#true} call #t~ret5 := main(); {6151#true} is VALID [2022-04-15 12:17:54,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6151#true} {6151#true} #40#return; {6151#true} is VALID [2022-04-15 12:17:54,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {6151#true} assume true; {6151#true} is VALID [2022-04-15 12:17:54,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {6151#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(13, 2);call #Ultimate.allocInit(12, 3); {6151#true} is VALID [2022-04-15 12:17:54,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {6151#true} call ULTIMATE.init(); {6151#true} is VALID [2022-04-15 12:17:54,202 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:17:54,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657631924] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:54,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:54,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 4, 4] total 23 [2022-04-15 12:17:54,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:54,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1601524215] [2022-04-15 12:17:54,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1601524215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:54,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:54,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:17:54,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088185644] [2022-04-15 12:17:54,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:54,203 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:17:54,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:54,204 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:17:54,270 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:17:54,270 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:17:54,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:54,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:17:54,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:17:54,271 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:17:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:55,725 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-15 12:17:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:17:55,726 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:17:55,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:55,726 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:17:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2022-04-15 12:17:55,727 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:17:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2022-04-15 12:17:55,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 55 transitions. [2022-04-15 12:17:55,785 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:17:55,786 INFO L225 Difference]: With dead ends: 54 [2022-04-15 12:17:55,786 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 12:17:55,786 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=272, Invalid=1210, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:17:55,787 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:55,787 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 69 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:17:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 12:17:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 12:17:55,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:55,875 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:17:55,875 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:17:55,875 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:17:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:55,876 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 12:17:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 12:17:55,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:55,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:55,876 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:17:55,877 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:17:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:55,877 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 12:17:55,877 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 12:17:55,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:55,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:55,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:55,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:55,877 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:17:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-15 12:17:55,878 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 43 [2022-04-15 12:17:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:55,878 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-15 12:17:55,878 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:17:55,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2022-04-15 12:17:55,964 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:17:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 12:17:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 12:17:55,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:55,965 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:55,971 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:17:56,165 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:17:56,165 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:56,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:56,166 INFO L85 PathProgramCache]: Analyzing trace with hash 742724429, now seen corresponding path program 31 times [2022-04-15 12:17:56,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:56,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1514308794] [2022-04-15 12:17:56,307 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:56,309 INFO L85 PathProgramCache]: Analyzing trace with hash -357489999, now seen corresponding path program 1 times [2022-04-15 12:17:56,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:56,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949925961] [2022-04-15 12:17:56,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:56,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:56,320 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:56,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:56,333 INFO L85 PathProgramCache]: Analyzing trace with hash 742724429, now seen corresponding path program 32 times [2022-04-15 12:17:56,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:56,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016577314] [2022-04-15 12:17:56,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:56,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:56,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:56,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {6784#(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(13, 2);call #Ultimate.allocInit(12, 3); {6762#true} is VALID [2022-04-15 12:17:56,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {6762#true} assume true; {6762#true} is VALID [2022-04-15 12:17:56,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6762#true} {6762#true} #40#return; {6762#true} is VALID [2022-04-15 12:17:56,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {6762#true} call ULTIMATE.init(); {6784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:56,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {6784#(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(13, 2);call #Ultimate.allocInit(12, 3); {6762#true} is VALID [2022-04-15 12:17:56,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {6762#true} assume true; {6762#true} is VALID [2022-04-15 12:17:56,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6762#true} {6762#true} #40#return; {6762#true} is VALID [2022-04-15 12:17:56,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {6762#true} call #t~ret5 := main(); {6762#true} is VALID [2022-04-15 12:17:56,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {6762#true} ~x~0 := 0; {6767#(= main_~x~0 0)} is VALID [2022-04-15 12:17:56,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {6767#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {6767#(= main_~x~0 0)} is VALID [2022-04-15 12:17:56,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {6767#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6768#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:56,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {6768#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {6768#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:56,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {6768#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6769#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:56,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {6769#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {6769#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:56,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {6769#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6770#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:56,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {6770#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6770#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:56,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {6770#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6771#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:56,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {6771#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6771#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:56,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {6771#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6772#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:56,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {6772#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {6772#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:56,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {6772#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6773#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:56,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {6773#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {6773#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:56,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {6773#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6774#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:56,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {6774#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6774#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:56,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {6774#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6775#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:56,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {6775#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6775#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:56,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {6775#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6776#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:56,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {6776#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6776#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:56,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {6776#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6777#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:56,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {6777#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6777#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:56,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {6777#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6778#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:56,627 INFO L290 TraceCheckUtils]: 28: Hoare triple {6778#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6778#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:56,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {6778#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6779#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:56,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {6779#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6779#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:56,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {6779#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6780#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:56,629 INFO L290 TraceCheckUtils]: 32: Hoare triple {6780#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6780#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:56,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {6780#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6781#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:56,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {6781#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {6781#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:56,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {6781#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6782#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:56,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {6782#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {6782#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:56,633 INFO L290 TraceCheckUtils]: 37: Hoare triple {6782#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6783#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:56,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {6783#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {6783#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:56,634 INFO L290 TraceCheckUtils]: 39: Hoare triple {6783#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {6763#false} is VALID [2022-04-15 12:17:56,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {6763#false} assume !(~x~0 % 4294967296 < 268435455); {6763#false} is VALID [2022-04-15 12:17:56,634 INFO L272 TraceCheckUtils]: 41: Hoare triple {6763#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6763#false} is VALID [2022-04-15 12:17:56,634 INFO L290 TraceCheckUtils]: 42: Hoare triple {6763#false} ~cond := #in~cond; {6763#false} is VALID [2022-04-15 12:17:56,634 INFO L290 TraceCheckUtils]: 43: Hoare triple {6763#false} assume 0 == ~cond; {6763#false} is VALID [2022-04-15 12:17:56,634 INFO L290 TraceCheckUtils]: 44: Hoare triple {6763#false} assume !false; {6763#false} is VALID [2022-04-15 12:17:56,635 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:17:56,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:56,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016577314] [2022-04-15 12:17:56,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016577314] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:56,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056298962] [2022-04-15 12:17:56,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:56,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:56,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:56,636 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:17:56,636 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:17:56,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:56,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:56,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 12:17:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:56,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:57,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {6762#true} call ULTIMATE.init(); {6762#true} is VALID [2022-04-15 12:17:57,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {6762#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(13, 2);call #Ultimate.allocInit(12, 3); {6762#true} is VALID [2022-04-15 12:17:57,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {6762#true} assume true; {6762#true} is VALID [2022-04-15 12:17:57,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6762#true} {6762#true} #40#return; {6762#true} is VALID [2022-04-15 12:17:57,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {6762#true} call #t~ret5 := main(); {6762#true} is VALID [2022-04-15 12:17:57,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {6762#true} ~x~0 := 0; {6767#(= main_~x~0 0)} is VALID [2022-04-15 12:17:57,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {6767#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {6767#(= main_~x~0 0)} is VALID [2022-04-15 12:17:57,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {6767#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6768#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:57,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {6768#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {6768#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:57,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {6768#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6769#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:57,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {6769#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {6769#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:57,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {6769#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6770#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:57,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {6770#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6770#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:57,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {6770#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6771#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:57,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {6771#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6771#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:57,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {6771#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6772#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:57,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {6772#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {6772#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:57,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {6772#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6773#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:57,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {6773#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {6773#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:57,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {6773#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6774#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:57,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {6774#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6774#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:57,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {6774#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6775#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:57,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {6775#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6775#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:57,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {6775#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6776#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:57,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {6776#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6776#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:57,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {6776#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6777#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:57,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {6777#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6777#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:57,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {6777#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6778#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:57,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {6778#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6778#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:57,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {6778#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6779#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:57,115 INFO L290 TraceCheckUtils]: 30: Hoare triple {6779#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6779#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:57,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {6779#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6780#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:57,116 INFO L290 TraceCheckUtils]: 32: Hoare triple {6780#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6780#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:57,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {6780#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6781#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:57,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {6781#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {6781#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:57,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {6781#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6782#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:57,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {6782#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {6782#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:57,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {6782#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6899#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:57,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {6899#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6899#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:57,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {6899#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {6906#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:17:57,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {6906#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {6906#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:17:57,122 INFO L272 TraceCheckUtils]: 41: Hoare triple {6906#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6913#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:57,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {6913#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6917#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:57,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {6917#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6763#false} is VALID [2022-04-15 12:17:57,123 INFO L290 TraceCheckUtils]: 44: Hoare triple {6763#false} assume !false; {6763#false} is VALID [2022-04-15 12:17:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:57,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:57,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {6763#false} assume !false; {6763#false} is VALID [2022-04-15 12:17:57,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {6917#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6763#false} is VALID [2022-04-15 12:17:57,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {6913#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6917#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:57,316 INFO L272 TraceCheckUtils]: 41: Hoare triple {6933#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6913#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:57,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {6946#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {6946#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6946#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:57,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6946#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:57,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {6946#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {6946#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6946#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:57,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6946#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:57,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {6946#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {6946#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6946#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:57,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6946#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:57,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {6946#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {6946#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6946#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:57,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6946#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:57,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {6946#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {6946#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6946#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:57,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6946#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:57,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {6946#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {6946#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6946#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:57,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6946#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:57,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {6946#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {6946#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6946#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:57,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6946#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:57,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {6946#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {6946#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6946#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:57,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6946#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:57,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {6933#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {6762#true} ~x~0 := 0; {6933#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:57,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {6762#true} call #t~ret5 := main(); {6762#true} is VALID [2022-04-15 12:17:57,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6762#true} {6762#true} #40#return; {6762#true} is VALID [2022-04-15 12:17:57,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {6762#true} assume true; {6762#true} is VALID [2022-04-15 12:17:57,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {6762#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(13, 2);call #Ultimate.allocInit(12, 3); {6762#true} is VALID [2022-04-15 12:17:57,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {6762#true} call ULTIMATE.init(); {6762#true} is VALID [2022-04-15 12:17:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-04-15 12:17:57,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056298962] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:57,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:57,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 6] total 26 [2022-04-15 12:17:57,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:57,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1514308794] [2022-04-15 12:17:57,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1514308794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:57,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:57,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:17:57,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495723514] [2022-04-15 12:17:57,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:57,338 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:17:57,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:57,338 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:17:57,383 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:17:57,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:17:57,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:57,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:17:57,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:17:57,384 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:17:59,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:59,060 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-04-15 12:17:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:17:59,061 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:17:59,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:59,061 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:17:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2022-04-15 12:17:59,066 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:17:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2022-04-15 12:17:59,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 57 transitions. [2022-04-15 12:17:59,134 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:17:59,135 INFO L225 Difference]: With dead ends: 56 [2022-04-15 12:17:59,135 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 12:17:59,136 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=1606, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:17:59,136 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:59,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 64 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:17:59,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 12:17:59,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-15 12:17:59,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:59,232 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:17:59,232 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:17:59,232 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:17:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:59,233 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-04-15 12:17:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-04-15 12:17:59,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:59,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:59,233 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:17:59,233 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:17:59,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:59,234 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-04-15 12:17:59,234 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-04-15 12:17:59,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:59,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:59,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:59,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:59,234 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:17:59,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2022-04-15 12:17:59,235 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 45 [2022-04-15 12:17:59,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:59,235 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2022-04-15 12:17:59,235 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:17:59,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 51 transitions. [2022-04-15 12:17:59,340 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:17:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-04-15 12:17:59,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 12:17:59,340 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:59,341 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:59,357 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:17:59,541 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:17:59,541 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:59,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:59,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1559425110, now seen corresponding path program 33 times [2022-04-15 12:17:59,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:59,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [978415163] [2022-04-15 12:17:59,686 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:59,688 INFO L85 PathProgramCache]: Analyzing trace with hash -298384655, now seen corresponding path program 1 times [2022-04-15 12:17:59,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:59,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255797127] [2022-04-15 12:17:59,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:59,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:59,694 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:59,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:59,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1559425110, now seen corresponding path program 34 times [2022-04-15 12:17:59,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:59,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042054480] [2022-04-15 12:17:59,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:59,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:00,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:00,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {7425#(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(13, 2);call #Ultimate.allocInit(12, 3); {7402#true} is VALID [2022-04-15 12:18:00,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {7402#true} assume true; {7402#true} is VALID [2022-04-15 12:18:00,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7402#true} {7402#true} #40#return; {7402#true} is VALID [2022-04-15 12:18:00,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {7402#true} call ULTIMATE.init(); {7425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:00,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {7425#(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(13, 2);call #Ultimate.allocInit(12, 3); {7402#true} is VALID [2022-04-15 12:18:00,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {7402#true} assume true; {7402#true} is VALID [2022-04-15 12:18:00,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7402#true} {7402#true} #40#return; {7402#true} is VALID [2022-04-15 12:18:00,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {7402#true} call #t~ret5 := main(); {7402#true} is VALID [2022-04-15 12:18:00,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {7402#true} ~x~0 := 0; {7407#(= main_~x~0 0)} is VALID [2022-04-15 12:18:00,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {7407#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {7407#(= main_~x~0 0)} is VALID [2022-04-15 12:18:00,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {7407#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7408#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:00,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {7408#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {7408#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:00,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {7408#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7409#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:00,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {7409#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {7409#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:00,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {7409#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7410#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:00,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {7410#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7410#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:00,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {7410#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7411#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:00,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {7411#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7411#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:00,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {7411#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7412#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:00,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {7412#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {7412#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:00,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {7412#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:00,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {7413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {7413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:00,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {7413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7414#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:00,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {7414#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7414#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:00,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {7414#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7415#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:00,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {7415#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7415#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:00,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {7415#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7416#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:00,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {7416#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7416#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:00,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {7416#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7417#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:00,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {7417#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7417#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:00,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {7417#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7418#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:00,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {7418#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7418#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:00,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {7418#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7419#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:00,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {7419#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7419#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:00,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {7419#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7420#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:00,072 INFO L290 TraceCheckUtils]: 32: Hoare triple {7420#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7420#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:00,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {7420#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7421#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:00,073 INFO L290 TraceCheckUtils]: 34: Hoare triple {7421#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {7421#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:00,076 INFO L290 TraceCheckUtils]: 35: Hoare triple {7421#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7422#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:00,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {7422#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {7422#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:00,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {7422#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7423#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:00,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {7423#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7423#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:00,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {7423#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7424#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:00,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {7424#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {7424#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:00,080 INFO L290 TraceCheckUtils]: 41: Hoare triple {7424#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {7403#false} is VALID [2022-04-15 12:18:00,080 INFO L290 TraceCheckUtils]: 42: Hoare triple {7403#false} assume !(~x~0 % 4294967296 < 268435455); {7403#false} is VALID [2022-04-15 12:18:00,080 INFO L272 TraceCheckUtils]: 43: Hoare triple {7403#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7403#false} is VALID [2022-04-15 12:18:00,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {7403#false} ~cond := #in~cond; {7403#false} is VALID [2022-04-15 12:18:00,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {7403#false} assume 0 == ~cond; {7403#false} is VALID [2022-04-15 12:18:00,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {7403#false} assume !false; {7403#false} is VALID [2022-04-15 12:18:00,080 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:18:00,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:00,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042054480] [2022-04-15 12:18:00,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042054480] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:00,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881045680] [2022-04-15 12:18:00,081 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:00,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:00,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:00,082 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:18:00,082 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:18:00,125 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:00,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:00,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 12:18:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:00,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:00,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {7402#true} call ULTIMATE.init(); {7402#true} is VALID [2022-04-15 12:18:00,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {7402#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(13, 2);call #Ultimate.allocInit(12, 3); {7402#true} is VALID [2022-04-15 12:18:00,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {7402#true} assume true; {7402#true} is VALID [2022-04-15 12:18:00,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7402#true} {7402#true} #40#return; {7402#true} is VALID [2022-04-15 12:18:00,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {7402#true} call #t~ret5 := main(); {7402#true} is VALID [2022-04-15 12:18:00,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {7402#true} ~x~0 := 0; {7407#(= main_~x~0 0)} is VALID [2022-04-15 12:18:00,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {7407#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {7407#(= main_~x~0 0)} is VALID [2022-04-15 12:18:00,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {7407#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7408#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:00,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {7408#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {7408#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:00,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {7408#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7409#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:00,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {7409#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {7409#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:00,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {7409#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7410#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:00,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {7410#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7410#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:00,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {7410#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7411#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:00,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {7411#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7411#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:00,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {7411#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7412#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:00,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {7412#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {7412#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:00,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {7412#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:00,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {7413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {7413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:00,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {7413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7414#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:00,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {7414#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7414#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:00,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {7414#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7415#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:00,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {7415#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7415#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:00,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {7415#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7416#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:00,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {7416#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7416#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:00,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {7416#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7417#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:00,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {7417#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7417#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:00,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {7417#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7418#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:00,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {7418#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7418#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:00,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {7418#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7419#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:00,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {7419#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7419#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:00,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {7419#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7420#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:00,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {7420#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7420#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:00,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {7420#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7421#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:00,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {7421#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {7421#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:00,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {7421#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7422#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:00,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {7422#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {7422#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:00,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {7422#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7423#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:00,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {7423#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7423#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:00,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {7423#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7546#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:00,534 INFO L290 TraceCheckUtils]: 40: Hoare triple {7546#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {7546#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:00,535 INFO L290 TraceCheckUtils]: 41: Hoare triple {7546#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {7403#false} is VALID [2022-04-15 12:18:00,535 INFO L290 TraceCheckUtils]: 42: Hoare triple {7403#false} assume !(~x~0 % 4294967296 < 268435455); {7403#false} is VALID [2022-04-15 12:18:00,535 INFO L272 TraceCheckUtils]: 43: Hoare triple {7403#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7403#false} is VALID [2022-04-15 12:18:00,535 INFO L290 TraceCheckUtils]: 44: Hoare triple {7403#false} ~cond := #in~cond; {7403#false} is VALID [2022-04-15 12:18:00,535 INFO L290 TraceCheckUtils]: 45: Hoare triple {7403#false} assume 0 == ~cond; {7403#false} is VALID [2022-04-15 12:18:00,535 INFO L290 TraceCheckUtils]: 46: Hoare triple {7403#false} assume !false; {7403#false} is VALID [2022-04-15 12:18:00,535 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:18:00,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:01,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {7403#false} assume !false; {7403#false} is VALID [2022-04-15 12:18:01,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {7403#false} assume 0 == ~cond; {7403#false} is VALID [2022-04-15 12:18:01,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {7403#false} ~cond := #in~cond; {7403#false} is VALID [2022-04-15 12:18:01,689 INFO L272 TraceCheckUtils]: 43: Hoare triple {7403#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7403#false} is VALID [2022-04-15 12:18:01,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {7403#false} assume !(~x~0 % 4294967296 < 268435455); {7403#false} is VALID [2022-04-15 12:18:01,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {7583#(< (mod main_~x~0 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {7403#false} is VALID [2022-04-15 12:18:01,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {7587#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod main_~x~0 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {7583#(< (mod main_~x~0 4294967296) 65521)} is VALID [2022-04-15 12:18:01,693 INFO L290 TraceCheckUtils]: 39: Hoare triple {7591#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7587#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod main_~x~0 4294967296) 65521))} is VALID [2022-04-15 12:18:01,693 INFO L290 TraceCheckUtils]: 38: Hoare triple {7591#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {7591#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {7598#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7591#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {7598#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {7598#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {7605#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7598#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {7605#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {7605#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {7612#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7605#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {7612#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {7612#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {7619#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7612#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {7619#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {7619#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {7626#(or (< (mod (+ main_~x~0 6) 4294967296) 65521) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7619#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,699 INFO L290 TraceCheckUtils]: 28: Hoare triple {7626#(or (< (mod (+ main_~x~0 6) 4294967296) 65521) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {7626#(or (< (mod (+ main_~x~0 6) 4294967296) 65521) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {7633#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 268435455)) (< (mod (+ 7 main_~x~0) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7626#(or (< (mod (+ main_~x~0 6) 4294967296) 65521) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {7633#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 268435455)) (< (mod (+ 7 main_~x~0) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {7633#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 268435455)) (< (mod (+ 7 main_~x~0) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {7640#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7633#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 268435455)) (< (mod (+ 7 main_~x~0) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {7640#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {7640#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {7647#(or (not (< (mod (+ main_~x~0 9) 4294967296) 268435455)) (< (mod (+ main_~x~0 9) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7640#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {7647#(or (not (< (mod (+ main_~x~0 9) 4294967296) 268435455)) (< (mod (+ main_~x~0 9) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {7647#(or (not (< (mod (+ main_~x~0 9) 4294967296) 268435455)) (< (mod (+ main_~x~0 9) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {7654#(or (< (mod (+ main_~x~0 10) 4294967296) 65521) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7647#(or (not (< (mod (+ main_~x~0 9) 4294967296) 268435455)) (< (mod (+ main_~x~0 9) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {7654#(or (< (mod (+ main_~x~0 10) 4294967296) 65521) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {7654#(or (< (mod (+ main_~x~0 10) 4294967296) 65521) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {7661#(or (< (mod (+ main_~x~0 11) 4294967296) 65521) (not (< (mod (+ main_~x~0 11) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7654#(or (< (mod (+ main_~x~0 10) 4294967296) 65521) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {7661#(or (< (mod (+ main_~x~0 11) 4294967296) 65521) (not (< (mod (+ main_~x~0 11) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {7661#(or (< (mod (+ main_~x~0 11) 4294967296) 65521) (not (< (mod (+ main_~x~0 11) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {7668#(or (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7661#(or (< (mod (+ main_~x~0 11) 4294967296) 65521) (not (< (mod (+ main_~x~0 11) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {7668#(or (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {7668#(or (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {7675#(or (< (mod (+ main_~x~0 13) 4294967296) 65521) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7668#(or (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {7675#(or (< (mod (+ main_~x~0 13) 4294967296) 65521) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {7675#(or (< (mod (+ main_~x~0 13) 4294967296) 65521) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {7682#(or (< (mod (+ main_~x~0 14) 4294967296) 65521) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7675#(or (< (mod (+ main_~x~0 13) 4294967296) 65521) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {7682#(or (< (mod (+ main_~x~0 14) 4294967296) 65521) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {7682#(or (< (mod (+ main_~x~0 14) 4294967296) 65521) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {7689#(or (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)) (< (mod (+ main_~x~0 15) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7682#(or (< (mod (+ main_~x~0 14) 4294967296) 65521) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {7689#(or (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)) (< (mod (+ main_~x~0 15) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {7689#(or (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)) (< (mod (+ main_~x~0 15) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {7696#(or (< (mod (+ main_~x~0 16) 4294967296) 65521) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7689#(or (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)) (< (mod (+ main_~x~0 15) 4294967296) 65521))} is VALID [2022-04-15 12:18:01,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {7696#(or (< (mod (+ main_~x~0 16) 4294967296) 65521) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {7696#(or (< (mod (+ main_~x~0 16) 4294967296) 65521) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {7703#(or (< (mod (+ main_~x~0 17) 4294967296) 65521) (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7696#(or (< (mod (+ main_~x~0 16) 4294967296) 65521) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {7703#(or (< (mod (+ main_~x~0 17) 4294967296) 65521) (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {7703#(or (< (mod (+ main_~x~0 17) 4294967296) 65521) (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {7402#true} ~x~0 := 0; {7703#(or (< (mod (+ main_~x~0 17) 4294967296) 65521) (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {7402#true} call #t~ret5 := main(); {7402#true} is VALID [2022-04-15 12:18:01,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7402#true} {7402#true} #40#return; {7402#true} is VALID [2022-04-15 12:18:01,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {7402#true} assume true; {7402#true} is VALID [2022-04-15 12:18:01,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {7402#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(13, 2);call #Ultimate.allocInit(12, 3); {7402#true} is VALID [2022-04-15 12:18:01,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {7402#true} call ULTIMATE.init(); {7402#true} is VALID [2022-04-15 12:18:01,716 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:18:01,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881045680] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:01,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:01,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 41 [2022-04-15 12:18:01,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:01,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [978415163] [2022-04-15 12:18:01,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [978415163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:01,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:01,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:18:01,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912685243] [2022-04-15 12:18:01,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:01,717 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:18:01,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:01,718 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:18:01,768 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:18:01,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:18:01,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:01,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:18:01,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=1181, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:18:01,769 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:18:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:03,636 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-15 12:18:03,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:18:03,636 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:18:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:03,636 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:18:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2022-04-15 12:18:03,637 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:18:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2022-04-15 12:18:03,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 59 transitions. [2022-04-15 12:18:03,733 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:18:03,734 INFO L225 Difference]: With dead ends: 58 [2022-04-15 12:18:03,734 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 12:18:03,735 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=907, Invalid=2515, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 12:18:03,735 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:03,736 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 104 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 12:18:03,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 12:18:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 12:18:03,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:03,833 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:18:03,833 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:18:03,834 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:18:03,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:03,834 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-04-15 12:18:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-04-15 12:18:03,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:03,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:03,835 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:18:03,835 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:18:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:03,835 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-04-15 12:18:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-04-15 12:18:03,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:03,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:03,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:03,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:03,836 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:18:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-04-15 12:18:03,836 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 47 [2022-04-15 12:18:03,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:03,836 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-04-15 12:18:03,837 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:18:03,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 53 transitions. [2022-04-15 12:18:03,922 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:18:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-04-15 12:18:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 12:18:03,923 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:03,923 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:03,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-15 12:18:04,123 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:18:04,124 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:04,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:04,125 INFO L85 PathProgramCache]: Analyzing trace with hash -2016974649, now seen corresponding path program 35 times [2022-04-15 12:18:04,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:04,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1550212054] [2022-04-15 12:18:04,304 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:18:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash -239279311, now seen corresponding path program 1 times [2022-04-15 12:18:04,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:04,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743394799] [2022-04-15 12:18:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:04,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:04,312 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:04,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:04,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2016974649, now seen corresponding path program 36 times [2022-04-15 12:18:04,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:04,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877610768] [2022-04-15 12:18:04,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:04,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:04,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:04,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {8107#(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(13, 2);call #Ultimate.allocInit(12, 3); {8083#true} is VALID [2022-04-15 12:18:04,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {8083#true} assume true; {8083#true} is VALID [2022-04-15 12:18:04,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8083#true} {8083#true} #40#return; {8083#true} is VALID [2022-04-15 12:18:04,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {8083#true} call ULTIMATE.init(); {8107#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:04,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {8107#(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(13, 2);call #Ultimate.allocInit(12, 3); {8083#true} is VALID [2022-04-15 12:18:04,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {8083#true} assume true; {8083#true} is VALID [2022-04-15 12:18:04,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8083#true} {8083#true} #40#return; {8083#true} is VALID [2022-04-15 12:18:04,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {8083#true} call #t~ret5 := main(); {8083#true} is VALID [2022-04-15 12:18:04,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {8083#true} ~x~0 := 0; {8088#(= main_~x~0 0)} is VALID [2022-04-15 12:18:04,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {8088#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {8088#(= main_~x~0 0)} is VALID [2022-04-15 12:18:04,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {8088#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:04,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {8089#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {8089#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:04,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {8089#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8090#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:04,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {8090#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {8090#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:04,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {8090#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8091#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:04,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {8091#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8091#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:04,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {8091#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8092#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:04,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {8092#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8092#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:04,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {8092#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8093#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:04,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {8093#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {8093#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:04,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {8093#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8094#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:04,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {8094#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {8094#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:04,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {8094#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8095#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:04,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {8095#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8095#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:04,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {8095#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8096#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:04,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {8096#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8096#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:04,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {8096#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8097#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:04,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {8097#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8097#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:04,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {8097#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8098#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:04,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {8098#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8098#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:04,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {8098#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8099#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:04,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {8099#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8099#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:04,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {8099#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8100#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:04,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {8100#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8100#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:04,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {8100#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8101#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:04,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {8101#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8101#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:04,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {8101#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8102#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:04,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {8102#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {8102#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:04,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {8102#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8103#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:04,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {8103#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {8103#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:04,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {8103#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8104#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:04,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {8104#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8104#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:04,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {8104#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8105#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:04,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {8105#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {8105#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:04,699 INFO L290 TraceCheckUtils]: 41: Hoare triple {8105#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8106#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:04,700 INFO L290 TraceCheckUtils]: 42: Hoare triple {8106#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {8106#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:04,701 INFO L290 TraceCheckUtils]: 43: Hoare triple {8106#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {8084#false} is VALID [2022-04-15 12:18:04,701 INFO L290 TraceCheckUtils]: 44: Hoare triple {8084#false} assume !(~x~0 % 4294967296 < 268435455); {8084#false} is VALID [2022-04-15 12:18:04,701 INFO L272 TraceCheckUtils]: 45: Hoare triple {8084#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8084#false} is VALID [2022-04-15 12:18:04,701 INFO L290 TraceCheckUtils]: 46: Hoare triple {8084#false} ~cond := #in~cond; {8084#false} is VALID [2022-04-15 12:18:04,701 INFO L290 TraceCheckUtils]: 47: Hoare triple {8084#false} assume 0 == ~cond; {8084#false} is VALID [2022-04-15 12:18:04,701 INFO L290 TraceCheckUtils]: 48: Hoare triple {8084#false} assume !false; {8084#false} is VALID [2022-04-15 12:18:04,701 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:18:04,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:04,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877610768] [2022-04-15 12:18:04,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877610768] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:04,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140611829] [2022-04-15 12:18:04,702 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:04,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:04,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:04,703 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:18:04,703 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:18:04,748 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:18:04,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:04,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:18:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:04,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:05,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {8083#true} call ULTIMATE.init(); {8083#true} is VALID [2022-04-15 12:18:05,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {8083#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(13, 2);call #Ultimate.allocInit(12, 3); {8083#true} is VALID [2022-04-15 12:18:05,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {8083#true} assume true; {8083#true} is VALID [2022-04-15 12:18:05,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8083#true} {8083#true} #40#return; {8083#true} is VALID [2022-04-15 12:18:05,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {8083#true} call #t~ret5 := main(); {8083#true} is VALID [2022-04-15 12:18:05,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {8083#true} ~x~0 := 0; {8083#true} is VALID [2022-04-15 12:18:05,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,043 INFO L290 TraceCheckUtils]: 28: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,043 INFO L290 TraceCheckUtils]: 34: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,043 INFO L290 TraceCheckUtils]: 35: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,044 INFO L290 TraceCheckUtils]: 36: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,044 INFO L290 TraceCheckUtils]: 38: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,044 INFO L290 TraceCheckUtils]: 39: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8234#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:18:05,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {8234#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {8234#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:18:05,064 INFO L290 TraceCheckUtils]: 43: Hoare triple {8234#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {8241#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} is VALID [2022-04-15 12:18:05,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {8241#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 268435455); {8084#false} is VALID [2022-04-15 12:18:05,067 INFO L272 TraceCheckUtils]: 45: Hoare triple {8084#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8084#false} is VALID [2022-04-15 12:18:05,067 INFO L290 TraceCheckUtils]: 46: Hoare triple {8084#false} ~cond := #in~cond; {8084#false} is VALID [2022-04-15 12:18:05,067 INFO L290 TraceCheckUtils]: 47: Hoare triple {8084#false} assume 0 == ~cond; {8084#false} is VALID [2022-04-15 12:18:05,067 INFO L290 TraceCheckUtils]: 48: Hoare triple {8084#false} assume !false; {8084#false} is VALID [2022-04-15 12:18:05,067 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:18:05,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:05,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {8084#false} assume !false; {8084#false} is VALID [2022-04-15 12:18:05,367 INFO L290 TraceCheckUtils]: 47: Hoare triple {8084#false} assume 0 == ~cond; {8084#false} is VALID [2022-04-15 12:18:05,367 INFO L290 TraceCheckUtils]: 46: Hoare triple {8084#false} ~cond := #in~cond; {8084#false} is VALID [2022-04-15 12:18:05,367 INFO L272 TraceCheckUtils]: 45: Hoare triple {8084#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8084#false} is VALID [2022-04-15 12:18:05,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {8269#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {8084#false} is VALID [2022-04-15 12:18:05,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {8273#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {8269#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:05,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {8273#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {8273#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:05,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8273#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:05,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {8083#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8083#true} is VALID [2022-04-15 12:18:05,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {8083#true} assume !!(~x~0 % 4294967296 < 268435455); {8083#true} is VALID [2022-04-15 12:18:05,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {8083#true} ~x~0 := 0; {8083#true} is VALID [2022-04-15 12:18:05,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {8083#true} call #t~ret5 := main(); {8083#true} is VALID [2022-04-15 12:18:05,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8083#true} {8083#true} #40#return; {8083#true} is VALID [2022-04-15 12:18:05,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {8083#true} assume true; {8083#true} is VALID [2022-04-15 12:18:05,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {8083#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(13, 2);call #Ultimate.allocInit(12, 3); {8083#true} is VALID [2022-04-15 12:18:05,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {8083#true} call ULTIMATE.init(); {8083#true} is VALID [2022-04-15 12:18:05,374 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:18:05,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140611829] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:05,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:05,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 4, 4] total 26 [2022-04-15 12:18:05,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:05,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1550212054] [2022-04-15 12:18:05,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1550212054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:05,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:05,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:18:05,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802530992] [2022-04-15 12:18:05,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:05,375 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:18:05,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:05,375 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:18:05,430 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:18:05,431 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:18:05,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:05,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:18:05,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:18:05,431 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:18:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:07,459 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 12:18:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:18:07,464 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:18:07,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:07,464 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:18:07,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 61 transitions. [2022-04-15 12:18:07,465 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:18:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 61 transitions. [2022-04-15 12:18:07,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 61 transitions. [2022-04-15 12:18:07,554 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:18:07,555 INFO L225 Difference]: With dead ends: 60 [2022-04-15 12:18:07,555 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 12:18:07,555 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=323, Invalid=1657, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:18:07,556 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:07,556 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 29 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 12:18:07,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 12:18:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-15 12:18:07,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:07,652 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:18:07,652 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:18:07,653 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:18:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:07,654 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2022-04-15 12:18:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-04-15 12:18:07,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:07,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:07,654 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:18:07,654 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:18:07,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:07,655 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2022-04-15 12:18:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-04-15 12:18:07,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:07,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:07,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:07,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:07,655 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:18:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-04-15 12:18:07,656 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 49 [2022-04-15 12:18:07,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:07,656 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-04-15 12:18:07,656 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:18:07,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 55 transitions. [2022-04-15 12:18:07,771 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:18:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-04-15 12:18:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 12:18:07,771 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:07,771 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:07,791 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:18:07,972 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:18:07,972 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash 659549860, now seen corresponding path program 37 times [2022-04-15 12:18:07,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:07,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2110068793] [2022-04-15 12:18:08,137 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:18:08,138 INFO L85 PathProgramCache]: Analyzing trace with hash -180173967, now seen corresponding path program 1 times [2022-04-15 12:18:08,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:08,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665533795] [2022-04-15 12:18:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:08,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:08,146 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:08,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:08,150 INFO L85 PathProgramCache]: Analyzing trace with hash 659549860, now seen corresponding path program 38 times [2022-04-15 12:18:08,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:08,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868490506] [2022-04-15 12:18:08,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:08,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:08,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:08,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {8800#(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(13, 2);call #Ultimate.allocInit(12, 3); {8775#true} is VALID [2022-04-15 12:18:08,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-15 12:18:08,500 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8775#true} {8775#true} #40#return; {8775#true} is VALID [2022-04-15 12:18:08,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {8775#true} call ULTIMATE.init(); {8800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:08,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {8800#(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(13, 2);call #Ultimate.allocInit(12, 3); {8775#true} is VALID [2022-04-15 12:18:08,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-15 12:18:08,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8775#true} {8775#true} #40#return; {8775#true} is VALID [2022-04-15 12:18:08,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {8775#true} call #t~ret5 := main(); {8775#true} is VALID [2022-04-15 12:18:08,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {8775#true} ~x~0 := 0; {8780#(= main_~x~0 0)} is VALID [2022-04-15 12:18:08,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {8780#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {8780#(= main_~x~0 0)} is VALID [2022-04-15 12:18:08,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {8780#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8781#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:08,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {8781#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {8781#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:08,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {8781#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8782#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:08,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {8782#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {8782#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:08,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {8782#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8783#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:08,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {8783#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8783#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:08,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {8783#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8784#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:08,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {8784#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8784#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:08,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {8784#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8785#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:08,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {8785#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {8785#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:08,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {8785#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8786#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:08,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {8786#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {8786#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:08,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {8786#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8787#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:08,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {8787#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8787#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:08,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {8787#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8788#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:08,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {8788#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8788#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:08,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {8788#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8789#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:08,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {8789#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8789#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:08,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {8789#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8790#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:08,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {8790#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8790#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:08,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {8790#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8791#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:08,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {8791#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8791#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:08,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {8791#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8792#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:08,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {8792#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8792#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:08,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {8792#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8793#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:08,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {8793#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8793#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:08,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {8793#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8794#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:08,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {8794#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {8794#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:08,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {8794#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8795#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:08,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {8795#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {8795#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:08,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {8795#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8796#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:08,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {8796#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8796#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:08,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {8796#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8797#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:08,531 INFO L290 TraceCheckUtils]: 40: Hoare triple {8797#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {8797#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:08,531 INFO L290 TraceCheckUtils]: 41: Hoare triple {8797#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8798#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:08,532 INFO L290 TraceCheckUtils]: 42: Hoare triple {8798#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8798#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:08,533 INFO L290 TraceCheckUtils]: 43: Hoare triple {8798#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8799#(and (<= main_~x~0 19) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:08,533 INFO L290 TraceCheckUtils]: 44: Hoare triple {8799#(and (<= main_~x~0 19) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {8799#(and (<= main_~x~0 19) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:08,549 INFO L290 TraceCheckUtils]: 45: Hoare triple {8799#(and (<= main_~x~0 19) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {8776#false} is VALID [2022-04-15 12:18:08,549 INFO L290 TraceCheckUtils]: 46: Hoare triple {8776#false} assume !(~x~0 % 4294967296 < 268435455); {8776#false} is VALID [2022-04-15 12:18:08,549 INFO L272 TraceCheckUtils]: 47: Hoare triple {8776#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8776#false} is VALID [2022-04-15 12:18:08,549 INFO L290 TraceCheckUtils]: 48: Hoare triple {8776#false} ~cond := #in~cond; {8776#false} is VALID [2022-04-15 12:18:08,549 INFO L290 TraceCheckUtils]: 49: Hoare triple {8776#false} assume 0 == ~cond; {8776#false} is VALID [2022-04-15 12:18:08,550 INFO L290 TraceCheckUtils]: 50: Hoare triple {8776#false} assume !false; {8776#false} is VALID [2022-04-15 12:18:08,550 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:18:08,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:08,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868490506] [2022-04-15 12:18:08,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868490506] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:08,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738134137] [2022-04-15 12:18:08,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:08,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:08,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:08,552 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:18:08,577 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:18:08,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:08,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:08,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 12:18:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:08,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:09,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {8775#true} call ULTIMATE.init(); {8775#true} is VALID [2022-04-15 12:18:09,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {8775#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(13, 2);call #Ultimate.allocInit(12, 3); {8775#true} is VALID [2022-04-15 12:18:09,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-15 12:18:09,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8775#true} {8775#true} #40#return; {8775#true} is VALID [2022-04-15 12:18:09,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {8775#true} call #t~ret5 := main(); {8775#true} is VALID [2022-04-15 12:18:09,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {8775#true} ~x~0 := 0; {8780#(= main_~x~0 0)} is VALID [2022-04-15 12:18:09,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {8780#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {8780#(= main_~x~0 0)} is VALID [2022-04-15 12:18:09,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {8780#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8781#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:09,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {8781#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {8781#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:09,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {8781#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8782#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:09,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {8782#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {8782#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:09,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {8782#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8783#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:09,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {8783#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8783#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:09,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {8783#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8784#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:09,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {8784#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8784#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:09,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {8784#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8785#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:09,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {8785#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {8785#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:09,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {8785#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8786#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:09,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {8786#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {8786#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:09,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {8786#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8787#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:09,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {8787#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8787#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:09,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {8787#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8788#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:09,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {8788#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8788#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:09,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {8788#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8789#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:09,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {8789#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8789#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:09,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {8789#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8790#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:09,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {8790#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8790#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:09,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {8790#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8791#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:09,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {8791#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8791#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:09,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {8791#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8792#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:09,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {8792#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8792#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:09,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {8792#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8793#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:09,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {8793#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8793#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:09,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {8793#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8794#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:09,135 INFO L290 TraceCheckUtils]: 34: Hoare triple {8794#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {8794#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:09,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {8794#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8795#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:09,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {8795#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {8795#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:09,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {8795#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8796#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:09,141 INFO L290 TraceCheckUtils]: 38: Hoare triple {8796#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8796#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:09,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {8796#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8797#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:09,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {8797#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {8797#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:09,143 INFO L290 TraceCheckUtils]: 41: Hoare triple {8797#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8798#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:09,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {8798#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8798#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:09,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {8798#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8933#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:09,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {8933#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {8933#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:09,146 INFO L290 TraceCheckUtils]: 45: Hoare triple {8933#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {8940#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:09,146 INFO L290 TraceCheckUtils]: 46: Hoare triple {8940#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !(~x~0 % 4294967296 < 268435455); {8776#false} is VALID [2022-04-15 12:18:09,146 INFO L272 TraceCheckUtils]: 47: Hoare triple {8776#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8776#false} is VALID [2022-04-15 12:18:09,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {8776#false} ~cond := #in~cond; {8776#false} is VALID [2022-04-15 12:18:09,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {8776#false} assume 0 == ~cond; {8776#false} is VALID [2022-04-15 12:18:09,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {8776#false} assume !false; {8776#false} is VALID [2022-04-15 12:18:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:09,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:10,398 INFO L290 TraceCheckUtils]: 50: Hoare triple {8776#false} assume !false; {8776#false} is VALID [2022-04-15 12:18:10,398 INFO L290 TraceCheckUtils]: 49: Hoare triple {8776#false} assume 0 == ~cond; {8776#false} is VALID [2022-04-15 12:18:10,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {8776#false} ~cond := #in~cond; {8776#false} is VALID [2022-04-15 12:18:10,399 INFO L272 TraceCheckUtils]: 47: Hoare triple {8776#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8776#false} is VALID [2022-04-15 12:18:10,399 INFO L290 TraceCheckUtils]: 46: Hoare triple {8968#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {8776#false} is VALID [2022-04-15 12:18:10,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {8972#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {8968#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {8972#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {8972#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {8979#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8972#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {8979#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {8979#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {8986#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8979#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {8986#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {8986#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,407 INFO L290 TraceCheckUtils]: 39: Hoare triple {8993#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8986#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,407 INFO L290 TraceCheckUtils]: 38: Hoare triple {8993#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {8993#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {9000#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8993#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {9000#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9000#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,410 INFO L290 TraceCheckUtils]: 35: Hoare triple {9007#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9000#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,410 INFO L290 TraceCheckUtils]: 34: Hoare triple {9007#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9007#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {9014#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9007#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {9014#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9014#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {9021#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9014#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {9021#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9021#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {9028#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9021#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {9028#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9028#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {9035#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9028#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {9035#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9035#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {9042#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9035#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {9042#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9042#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {9049#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9042#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {9049#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9049#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {9056#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9049#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {9056#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9056#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {9063#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9056#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {9063#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9063#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {9070#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9063#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {9070#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9070#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {9077#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9070#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {9077#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9077#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {9084#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9077#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {9084#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9084#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {9091#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9084#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {9091#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9091#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {9098#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9091#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {9098#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9098#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {9105#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9098#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {9105#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9105#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {8775#true} ~x~0 := 0; {9105#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:18:10,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {8775#true} call #t~ret5 := main(); {8775#true} is VALID [2022-04-15 12:18:10,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8775#true} {8775#true} #40#return; {8775#true} is VALID [2022-04-15 12:18:10,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {8775#true} assume true; {8775#true} is VALID [2022-04-15 12:18:10,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {8775#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(13, 2);call #Ultimate.allocInit(12, 3); {8775#true} is VALID [2022-04-15 12:18:10,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {8775#true} call ULTIMATE.init(); {8775#true} is VALID [2022-04-15 12:18:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:10,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738134137] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:10,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:10,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2022-04-15 12:18:10,437 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:10,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2110068793] [2022-04-15 12:18:10,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2110068793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:10,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:10,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:18:10,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293211516] [2022-04-15 12:18:10,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:10,437 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:18:10,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:10,438 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:18:10,500 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:18:10,500 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:18:10,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:10,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:18:10,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=1499, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 12:18:10,501 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:18:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:12,994 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-04-15 12:18:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:18:12,994 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:18:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:12,994 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:18:12,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 63 transitions. [2022-04-15 12:18:12,996 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:18:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 63 transitions. [2022-04-15 12:18:12,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 63 transitions. [2022-04-15 12:18:13,089 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:18:13,089 INFO L225 Difference]: With dead ends: 62 [2022-04-15 12:18:13,089 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 12:18:13,090 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1109, Invalid=3181, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 12:18:13,091 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:13,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 99 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 12:18:13,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 12:18:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-15 12:18:13,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:13,209 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:18:13,209 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:18:13,209 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:18:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:13,210 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-15 12:18:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-15 12:18:13,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:13,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:13,210 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:18:13,210 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:18:13,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:13,211 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-15 12:18:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-15 12:18:13,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:13,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:13,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:13,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:13,211 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:18:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-15 12:18:13,212 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 51 [2022-04-15 12:18:13,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:13,212 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-15 12:18:13,213 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:18:13,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2022-04-15 12:18:13,345 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:18:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-15 12:18:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 12:18:13,346 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:13,346 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:13,362 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:18:13,546 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:18:13,547 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:13,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:13,547 INFO L85 PathProgramCache]: Analyzing trace with hash 114192705, now seen corresponding path program 39 times [2022-04-15 12:18:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:13,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1485072389] [2022-04-15 12:18:13,706 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:18:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash -121068623, now seen corresponding path program 1 times [2022-04-15 12:18:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:13,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853287251] [2022-04-15 12:18:13,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:13,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:13,716 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:13,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:13,722 INFO L85 PathProgramCache]: Analyzing trace with hash 114192705, now seen corresponding path program 40 times [2022-04-15 12:18:13,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:13,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382465305] [2022-04-15 12:18:13,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:13,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:14,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:14,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {9539#(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(13, 2);call #Ultimate.allocInit(12, 3); {9513#true} is VALID [2022-04-15 12:18:14,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {9513#true} assume true; {9513#true} is VALID [2022-04-15 12:18:14,108 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9513#true} {9513#true} #40#return; {9513#true} is VALID [2022-04-15 12:18:14,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {9513#true} call ULTIMATE.init(); {9539#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:14,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {9539#(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(13, 2);call #Ultimate.allocInit(12, 3); {9513#true} is VALID [2022-04-15 12:18:14,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {9513#true} assume true; {9513#true} is VALID [2022-04-15 12:18:14,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9513#true} {9513#true} #40#return; {9513#true} is VALID [2022-04-15 12:18:14,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {9513#true} call #t~ret5 := main(); {9513#true} is VALID [2022-04-15 12:18:14,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {9513#true} ~x~0 := 0; {9518#(= main_~x~0 0)} is VALID [2022-04-15 12:18:14,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {9518#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {9518#(= main_~x~0 0)} is VALID [2022-04-15 12:18:14,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {9518#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9519#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:14,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {9519#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {9519#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:14,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {9519#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9520#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:14,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {9520#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {9520#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:14,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {9520#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9521#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:14,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {9521#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9521#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:14,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {9521#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9522#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:14,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {9522#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9522#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:14,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {9522#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9523#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:14,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {9523#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {9523#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:14,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {9523#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9524#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:14,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {9524#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {9524#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:14,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {9524#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9525#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:14,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {9525#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9525#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:14,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {9525#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9526#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:14,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {9526#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9526#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:14,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {9526#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9527#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:14,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {9527#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9527#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:14,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {9527#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9528#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:14,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {9528#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9528#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:14,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {9528#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9529#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:14,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {9529#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9529#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:14,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {9529#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9530#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:14,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {9530#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9530#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:14,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {9530#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9531#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:14,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {9531#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9531#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:14,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {9531#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9532#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:14,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {9532#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {9532#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:14,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {9532#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9533#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:14,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {9533#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {9533#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:14,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {9533#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9534#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:14,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {9534#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9534#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:14,147 INFO L290 TraceCheckUtils]: 39: Hoare triple {9534#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9535#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:14,148 INFO L290 TraceCheckUtils]: 40: Hoare triple {9535#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {9535#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:14,149 INFO L290 TraceCheckUtils]: 41: Hoare triple {9535#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9536#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:14,149 INFO L290 TraceCheckUtils]: 42: Hoare triple {9536#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9536#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:14,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {9536#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9537#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:14,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {9537#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {9537#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:14,154 INFO L290 TraceCheckUtils]: 45: Hoare triple {9537#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9538#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:14,154 INFO L290 TraceCheckUtils]: 46: Hoare triple {9538#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {9538#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:14,155 INFO L290 TraceCheckUtils]: 47: Hoare triple {9538#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {9514#false} is VALID [2022-04-15 12:18:14,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {9514#false} assume !(~x~0 % 4294967296 < 268435455); {9514#false} is VALID [2022-04-15 12:18:14,155 INFO L272 TraceCheckUtils]: 49: Hoare triple {9514#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9514#false} is VALID [2022-04-15 12:18:14,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {9514#false} ~cond := #in~cond; {9514#false} is VALID [2022-04-15 12:18:14,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {9514#false} assume 0 == ~cond; {9514#false} is VALID [2022-04-15 12:18:14,155 INFO L290 TraceCheckUtils]: 52: Hoare triple {9514#false} assume !false; {9514#false} is VALID [2022-04-15 12:18:14,156 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:18:14,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:14,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382465305] [2022-04-15 12:18:14,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382465305] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:14,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189294586] [2022-04-15 12:18:14,156 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:14,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:14,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:14,157 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:18:14,159 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:18:14,201 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:14,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:14,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 12:18:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:14,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:14,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {9513#true} call ULTIMATE.init(); {9513#true} is VALID [2022-04-15 12:18:14,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {9513#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(13, 2);call #Ultimate.allocInit(12, 3); {9513#true} is VALID [2022-04-15 12:18:14,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {9513#true} assume true; {9513#true} is VALID [2022-04-15 12:18:14,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9513#true} {9513#true} #40#return; {9513#true} is VALID [2022-04-15 12:18:14,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {9513#true} call #t~ret5 := main(); {9513#true} is VALID [2022-04-15 12:18:14,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {9513#true} ~x~0 := 0; {9518#(= main_~x~0 0)} is VALID [2022-04-15 12:18:14,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {9518#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {9518#(= main_~x~0 0)} is VALID [2022-04-15 12:18:14,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {9518#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9519#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:14,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {9519#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {9519#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:14,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {9519#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9520#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:14,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {9520#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {9520#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:14,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {9520#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9521#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:14,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {9521#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9521#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:14,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {9521#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9522#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:14,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {9522#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9522#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:14,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {9522#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9523#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:14,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {9523#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {9523#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:14,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {9523#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9524#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:14,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {9524#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {9524#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:14,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {9524#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9525#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:14,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {9525#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9525#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:14,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {9525#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9526#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:14,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {9526#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9526#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:14,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {9526#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9527#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:14,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {9527#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9527#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:14,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {9527#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9528#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:14,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {9528#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9528#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:14,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {9528#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9529#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:14,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {9529#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9529#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:14,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {9529#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9530#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:14,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {9530#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9530#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:14,715 INFO L290 TraceCheckUtils]: 31: Hoare triple {9530#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9531#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:14,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {9531#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9531#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:14,717 INFO L290 TraceCheckUtils]: 33: Hoare triple {9531#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9532#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:14,717 INFO L290 TraceCheckUtils]: 34: Hoare triple {9532#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {9532#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:14,719 INFO L290 TraceCheckUtils]: 35: Hoare triple {9532#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9533#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:14,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {9533#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {9533#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:14,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {9533#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9534#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:14,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {9534#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9534#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:14,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {9534#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9535#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:14,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {9535#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {9535#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:14,729 INFO L290 TraceCheckUtils]: 41: Hoare triple {9535#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9536#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:14,729 INFO L290 TraceCheckUtils]: 42: Hoare triple {9536#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9536#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:14,730 INFO L290 TraceCheckUtils]: 43: Hoare triple {9536#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9537#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:14,730 INFO L290 TraceCheckUtils]: 44: Hoare triple {9537#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {9537#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:14,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {9537#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9678#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:14,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {9678#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9678#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:14,733 INFO L290 TraceCheckUtils]: 47: Hoare triple {9678#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {9685#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:14,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {9685#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 268435455); {9685#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:14,734 INFO L272 TraceCheckUtils]: 49: Hoare triple {9685#(and (<= 22 main_~x~0) (<= main_~x~0 22))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9692#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:14,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {9692#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9696#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:14,735 INFO L290 TraceCheckUtils]: 51: Hoare triple {9696#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9514#false} is VALID [2022-04-15 12:18:14,735 INFO L290 TraceCheckUtils]: 52: Hoare triple {9514#false} assume !false; {9514#false} is VALID [2022-04-15 12:18:14,735 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:18:14,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:14,976 INFO L290 TraceCheckUtils]: 52: Hoare triple {9514#false} assume !false; {9514#false} is VALID [2022-04-15 12:18:14,976 INFO L290 TraceCheckUtils]: 51: Hoare triple {9696#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9514#false} is VALID [2022-04-15 12:18:14,976 INFO L290 TraceCheckUtils]: 50: Hoare triple {9692#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9696#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:14,977 INFO L272 TraceCheckUtils]: 49: Hoare triple {9712#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9692#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:14,977 INFO L290 TraceCheckUtils]: 48: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,978 INFO L290 TraceCheckUtils]: 47: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,978 INFO L290 TraceCheckUtils]: 46: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,982 INFO L290 TraceCheckUtils]: 44: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,983 INFO L290 TraceCheckUtils]: 43: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,983 INFO L290 TraceCheckUtils]: 42: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,990 INFO L290 TraceCheckUtils]: 32: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,990 INFO L290 TraceCheckUtils]: 31: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:15,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:15,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:15,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:15,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:15,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:15,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:15,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:15,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:15,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:15,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {9725#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:15,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9725#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:15,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {9712#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:15,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {9513#true} ~x~0 := 0; {9712#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:15,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {9513#true} call #t~ret5 := main(); {9513#true} is VALID [2022-04-15 12:18:15,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9513#true} {9513#true} #40#return; {9513#true} is VALID [2022-04-15 12:18:15,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {9513#true} assume true; {9513#true} is VALID [2022-04-15 12:18:15,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {9513#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(13, 2);call #Ultimate.allocInit(12, 3); {9513#true} is VALID [2022-04-15 12:18:15,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {9513#true} call ULTIMATE.init(); {9513#true} is VALID [2022-04-15 12:18:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-04-15 12:18:15,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189294586] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:15,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:15,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 6] total 30 [2022-04-15 12:18:15,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:15,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1485072389] [2022-04-15 12:18:15,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1485072389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:15,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:15,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:18:15,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568512896] [2022-04-15 12:18:15,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:15,009 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:18:15,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:15,009 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:18:15,079 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:18:15,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:18:15,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:15,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:18:15,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:18:15,080 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:18:18,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:18,003 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2022-04-15 12:18:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:18:18,003 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:18:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:18,003 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:18:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2022-04-15 12:18:18,004 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:18:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2022-04-15 12:18:18,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 65 transitions. [2022-04-15 12:18:18,117 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:18:18,117 INFO L225 Difference]: With dead ends: 64 [2022-04-15 12:18:18,117 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 12:18:18,118 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=244, Invalid=2306, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:18:18,118 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:18,119 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 54 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 12:18:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 12:18:18,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-15 12:18:18,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:18,229 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:18:18,230 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:18:18,230 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:18:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:18,230 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-15 12:18:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-15 12:18:18,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:18,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:18,231 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:18:18,231 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:18:18,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:18,231 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-15 12:18:18,231 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-15 12:18:18,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:18,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:18,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:18,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:18,232 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:18:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-04-15 12:18:18,232 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 53 [2022-04-15 12:18:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:18,233 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-04-15 12:18:18,233 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:18:18,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 59 transitions. [2022-04-15 12:18:18,369 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:18:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-15 12:18:18,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 12:18:18,369 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:18,369 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:18,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-15 12:18:18,583 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:18:18,583 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:18,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash 11976862, now seen corresponding path program 41 times [2022-04-15 12:18:18,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:18,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1724339101] [2022-04-15 12:18:18,738 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:18:18,740 INFO L85 PathProgramCache]: Analyzing trace with hash -61963279, now seen corresponding path program 1 times [2022-04-15 12:18:18,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:18,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263596503] [2022-04-15 12:18:18,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:18,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:18,747 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:18,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash 11976862, now seen corresponding path program 42 times [2022-04-15 12:18:18,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:18,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721304487] [2022-04-15 12:18:18,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:18,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:19,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:19,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {10288#(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(13, 2);call #Ultimate.allocInit(12, 3); {10261#true} is VALID [2022-04-15 12:18:19,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {10261#true} assume true; {10261#true} is VALID [2022-04-15 12:18:19,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10261#true} {10261#true} #40#return; {10261#true} is VALID [2022-04-15 12:18:19,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {10261#true} call ULTIMATE.init(); {10288#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:19,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {10288#(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(13, 2);call #Ultimate.allocInit(12, 3); {10261#true} is VALID [2022-04-15 12:18:19,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {10261#true} assume true; {10261#true} is VALID [2022-04-15 12:18:19,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10261#true} {10261#true} #40#return; {10261#true} is VALID [2022-04-15 12:18:19,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {10261#true} call #t~ret5 := main(); {10261#true} is VALID [2022-04-15 12:18:19,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {10261#true} ~x~0 := 0; {10266#(= main_~x~0 0)} is VALID [2022-04-15 12:18:19,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {10266#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {10266#(= main_~x~0 0)} is VALID [2022-04-15 12:18:19,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {10266#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:19,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {10267#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {10267#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:19,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {10267#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:19,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {10268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {10268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:19,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {10268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:19,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {10269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:19,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {10269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10270#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:19,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {10270#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10270#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:19,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {10270#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10271#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:19,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {10271#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {10271#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:19,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {10271#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10272#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:19,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {10272#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {10272#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:19,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {10272#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10273#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:19,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {10273#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10273#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:19,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {10273#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10274#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:19,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {10274#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10274#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:19,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {10274#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10275#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:19,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {10275#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10275#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:19,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {10275#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10276#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:19,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {10276#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10276#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:19,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {10276#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10277#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:19,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {10277#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10277#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:19,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {10277#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10278#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:19,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {10278#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10278#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:19,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {10278#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10279#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:19,173 INFO L290 TraceCheckUtils]: 32: Hoare triple {10279#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10279#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:19,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {10279#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10280#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:19,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {10280#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {10280#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:19,176 INFO L290 TraceCheckUtils]: 35: Hoare triple {10280#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10281#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:19,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {10281#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {10281#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:19,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {10281#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10282#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:19,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {10282#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10282#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:19,180 INFO L290 TraceCheckUtils]: 39: Hoare triple {10282#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10283#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:19,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {10283#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {10283#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:19,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {10283#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:19,181 INFO L290 TraceCheckUtils]: 42: Hoare triple {10284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:19,182 INFO L290 TraceCheckUtils]: 43: Hoare triple {10284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10285#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:19,183 INFO L290 TraceCheckUtils]: 44: Hoare triple {10285#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {10285#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:19,185 INFO L290 TraceCheckUtils]: 45: Hoare triple {10285#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10286#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:19,185 INFO L290 TraceCheckUtils]: 46: Hoare triple {10286#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10286#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:19,187 INFO L290 TraceCheckUtils]: 47: Hoare triple {10286#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10287#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:19,187 INFO L290 TraceCheckUtils]: 48: Hoare triple {10287#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {10287#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:19,189 INFO L290 TraceCheckUtils]: 49: Hoare triple {10287#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 21))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {10262#false} is VALID [2022-04-15 12:18:19,189 INFO L290 TraceCheckUtils]: 50: Hoare triple {10262#false} assume !(~x~0 % 4294967296 < 268435455); {10262#false} is VALID [2022-04-15 12:18:19,189 INFO L272 TraceCheckUtils]: 51: Hoare triple {10262#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10262#false} is VALID [2022-04-15 12:18:19,189 INFO L290 TraceCheckUtils]: 52: Hoare triple {10262#false} ~cond := #in~cond; {10262#false} is VALID [2022-04-15 12:18:19,189 INFO L290 TraceCheckUtils]: 53: Hoare triple {10262#false} assume 0 == ~cond; {10262#false} is VALID [2022-04-15 12:18:19,189 INFO L290 TraceCheckUtils]: 54: Hoare triple {10262#false} assume !false; {10262#false} is VALID [2022-04-15 12:18:19,190 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:18:19,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:19,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721304487] [2022-04-15 12:18:19,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721304487] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:19,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693727997] [2022-04-15 12:18:19,190 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:19,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:19,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:19,191 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:18:19,192 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:18:19,253 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:18:19,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:19,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:18:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:19,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:19,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {10261#true} call ULTIMATE.init(); {10261#true} is VALID [2022-04-15 12:18:19,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {10261#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(13, 2);call #Ultimate.allocInit(12, 3); {10261#true} is VALID [2022-04-15 12:18:19,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {10261#true} assume true; {10261#true} is VALID [2022-04-15 12:18:19,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10261#true} {10261#true} #40#return; {10261#true} is VALID [2022-04-15 12:18:19,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {10261#true} call #t~ret5 := main(); {10261#true} is VALID [2022-04-15 12:18:19,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {10261#true} ~x~0 := 0; {10261#true} is VALID [2022-04-15 12:18:19,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 24: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 29: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 39: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 41: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 42: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 43: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 44: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:19,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:19,474 INFO L290 TraceCheckUtils]: 47: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10433#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:18:19,474 INFO L290 TraceCheckUtils]: 48: Hoare triple {10433#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {10433#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:18:19,476 INFO L290 TraceCheckUtils]: 49: Hoare triple {10433#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {10440#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65521)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65521))} is VALID [2022-04-15 12:18:19,477 INFO L290 TraceCheckUtils]: 50: Hoare triple {10440#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65521)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65521))} assume !(~x~0 % 4294967296 < 268435455); {10262#false} is VALID [2022-04-15 12:18:19,477 INFO L272 TraceCheckUtils]: 51: Hoare triple {10262#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10262#false} is VALID [2022-04-15 12:18:19,477 INFO L290 TraceCheckUtils]: 52: Hoare triple {10262#false} ~cond := #in~cond; {10262#false} is VALID [2022-04-15 12:18:19,478 INFO L290 TraceCheckUtils]: 53: Hoare triple {10262#false} assume 0 == ~cond; {10262#false} is VALID [2022-04-15 12:18:19,478 INFO L290 TraceCheckUtils]: 54: Hoare triple {10262#false} assume !false; {10262#false} is VALID [2022-04-15 12:18:19,478 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:18:19,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:20,372 INFO L290 TraceCheckUtils]: 54: Hoare triple {10262#false} assume !false; {10262#false} is VALID [2022-04-15 12:18:20,373 INFO L290 TraceCheckUtils]: 53: Hoare triple {10459#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10262#false} is VALID [2022-04-15 12:18:20,373 INFO L290 TraceCheckUtils]: 52: Hoare triple {10463#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10459#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:20,373 INFO L272 TraceCheckUtils]: 51: Hoare triple {10467#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10463#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:20,374 INFO L290 TraceCheckUtils]: 50: Hoare triple {10471#(or (< (mod main_~x~0 4294967296) 268435455) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 268435455); {10467#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:20,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {10475#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {10471#(or (< (mod main_~x~0 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:20,378 INFO L290 TraceCheckUtils]: 48: Hoare triple {10479#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 268435455); {10475#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:20,380 INFO L290 TraceCheckUtils]: 47: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10479#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:18:20,380 INFO L290 TraceCheckUtils]: 46: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,380 INFO L290 TraceCheckUtils]: 45: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,380 INFO L290 TraceCheckUtils]: 44: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,380 INFO L290 TraceCheckUtils]: 39: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {10261#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10261#true} is VALID [2022-04-15 12:18:20,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {10261#true} assume !!(~x~0 % 4294967296 < 268435455); {10261#true} is VALID [2022-04-15 12:18:20,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {10261#true} ~x~0 := 0; {10261#true} is VALID [2022-04-15 12:18:20,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {10261#true} call #t~ret5 := main(); {10261#true} is VALID [2022-04-15 12:18:20,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10261#true} {10261#true} #40#return; {10261#true} is VALID [2022-04-15 12:18:20,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {10261#true} assume true; {10261#true} is VALID [2022-04-15 12:18:20,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {10261#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(13, 2);call #Ultimate.allocInit(12, 3); {10261#true} is VALID [2022-04-15 12:18:20,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {10261#true} call ULTIMATE.init(); {10261#true} is VALID [2022-04-15 12:18:20,382 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:18:20,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693727997] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:20,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:20,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 4, 8] total 33 [2022-04-15 12:18:20,383 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:20,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1724339101] [2022-04-15 12:18:20,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1724339101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:20,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:20,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 12:18:20,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966874797] [2022-04-15 12:18:20,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:20,384 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:18:20,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:20,384 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:18:20,470 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:18:20,470 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 12:18:20,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:20,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 12:18:20,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:18:20,471 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:18:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:24,262 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-04-15 12:18:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:18:24,262 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:18:24,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:24,262 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:18:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 67 transitions. [2022-04-15 12:18:24,263 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:18:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 67 transitions. [2022-04-15 12:18:24,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 67 transitions. [2022-04-15 12:18:24,468 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:18:24,469 INFO L225 Difference]: With dead ends: 66 [2022-04-15 12:18:24,469 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 12:18:24,470 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=418, Invalid=2552, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 12:18:24,471 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:24,471 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 124 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 12:18:24,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 12:18:24,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-15 12:18:24,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:24,602 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:18:24,602 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:18:24,602 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:18:24,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:24,603 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-15 12:18:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-15 12:18:24,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:24,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:24,603 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:18:24,603 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:18:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:24,604 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-15 12:18:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-15 12:18:24,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:24,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:24,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:24,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:24,604 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:18:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-04-15 12:18:24,605 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2022-04-15 12:18:24,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:24,605 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-04-15 12:18:24,605 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:18:24,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 61 transitions. [2022-04-15 12:18:24,755 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:18:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-15 12:18:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 12:18:24,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:24,756 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:24,761 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:18:24,961 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:18:24,961 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:24,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:24,961 INFO L85 PathProgramCache]: Analyzing trace with hash 566799547, now seen corresponding path program 43 times [2022-04-15 12:18:24,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:24,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [566365674] [2022-04-15 12:18:25,128 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:18:25,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2857935, now seen corresponding path program 1 times [2022-04-15 12:18:25,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:25,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057322072] [2022-04-15 12:18:25,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:25,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:25,135 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:25,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash 566799547, now seen corresponding path program 44 times [2022-04-15 12:18:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:25,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305434948] [2022-04-15 12:18:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:25,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:25,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:25,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {11066#(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(13, 2);call #Ultimate.allocInit(12, 3); {11038#true} is VALID [2022-04-15 12:18:25,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {11038#true} assume true; {11038#true} is VALID [2022-04-15 12:18:25,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11038#true} {11038#true} #40#return; {11038#true} is VALID [2022-04-15 12:18:25,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {11038#true} call ULTIMATE.init(); {11066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:25,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {11066#(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(13, 2);call #Ultimate.allocInit(12, 3); {11038#true} is VALID [2022-04-15 12:18:25,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {11038#true} assume true; {11038#true} is VALID [2022-04-15 12:18:25,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11038#true} {11038#true} #40#return; {11038#true} is VALID [2022-04-15 12:18:25,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {11038#true} call #t~ret5 := main(); {11038#true} is VALID [2022-04-15 12:18:25,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {11038#true} ~x~0 := 0; {11043#(= main_~x~0 0)} is VALID [2022-04-15 12:18:25,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {11043#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {11043#(= main_~x~0 0)} is VALID [2022-04-15 12:18:25,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {11043#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11044#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:25,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {11044#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {11044#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:25,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {11044#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11045#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:25,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {11045#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {11045#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:25,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {11045#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11046#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:25,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {11046#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11046#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:25,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {11046#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11047#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:25,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {11047#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11047#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:25,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {11047#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11048#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:25,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {11048#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {11048#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:25,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {11048#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11049#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:25,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {11049#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {11049#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:25,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {11049#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11050#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:25,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {11050#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11050#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:25,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {11050#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11051#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:25,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {11051#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11051#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:25,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {11051#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11052#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:25,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {11052#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11052#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:25,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {11052#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11053#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:25,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {11053#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11053#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:25,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {11053#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11054#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:25,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {11054#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11054#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:25,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {11054#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11055#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:25,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {11055#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11055#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:25,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {11055#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11056#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:25,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {11056#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11056#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:25,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {11056#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11057#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:25,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {11057#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {11057#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:25,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {11057#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11058#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:25,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {11058#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {11058#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:25,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {11058#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:25,607 INFO L290 TraceCheckUtils]: 38: Hoare triple {11059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:25,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {11059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11060#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:25,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {11060#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {11060#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:25,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {11060#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11061#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:25,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {11061#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11061#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:25,612 INFO L290 TraceCheckUtils]: 43: Hoare triple {11061#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11062#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:25,613 INFO L290 TraceCheckUtils]: 44: Hoare triple {11062#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {11062#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:25,617 INFO L290 TraceCheckUtils]: 45: Hoare triple {11062#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11063#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:25,617 INFO L290 TraceCheckUtils]: 46: Hoare triple {11063#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11063#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:25,619 INFO L290 TraceCheckUtils]: 47: Hoare triple {11063#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11064#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:25,619 INFO L290 TraceCheckUtils]: 48: Hoare triple {11064#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {11064#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:25,621 INFO L290 TraceCheckUtils]: 49: Hoare triple {11064#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11065#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:25,622 INFO L290 TraceCheckUtils]: 50: Hoare triple {11065#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {11065#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:25,623 INFO L290 TraceCheckUtils]: 51: Hoare triple {11065#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {11039#false} is VALID [2022-04-15 12:18:25,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {11039#false} assume !(~x~0 % 4294967296 < 268435455); {11039#false} is VALID [2022-04-15 12:18:25,623 INFO L272 TraceCheckUtils]: 53: Hoare triple {11039#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11039#false} is VALID [2022-04-15 12:18:25,623 INFO L290 TraceCheckUtils]: 54: Hoare triple {11039#false} ~cond := #in~cond; {11039#false} is VALID [2022-04-15 12:18:25,623 INFO L290 TraceCheckUtils]: 55: Hoare triple {11039#false} assume 0 == ~cond; {11039#false} is VALID [2022-04-15 12:18:25,623 INFO L290 TraceCheckUtils]: 56: Hoare triple {11039#false} assume !false; {11039#false} is VALID [2022-04-15 12:18:25,624 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:18:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:25,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305434948] [2022-04-15 12:18:25,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305434948] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:25,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763331746] [2022-04-15 12:18:25,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:25,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:25,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:25,625 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:18:25,626 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:18:25,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:25,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:25,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-15 12:18:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:25,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:26,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {11038#true} call ULTIMATE.init(); {11038#true} is VALID [2022-04-15 12:18:26,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {11038#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(13, 2);call #Ultimate.allocInit(12, 3); {11038#true} is VALID [2022-04-15 12:18:26,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {11038#true} assume true; {11038#true} is VALID [2022-04-15 12:18:26,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11038#true} {11038#true} #40#return; {11038#true} is VALID [2022-04-15 12:18:26,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {11038#true} call #t~ret5 := main(); {11038#true} is VALID [2022-04-15 12:18:26,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {11038#true} ~x~0 := 0; {11043#(= main_~x~0 0)} is VALID [2022-04-15 12:18:26,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {11043#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {11043#(= main_~x~0 0)} is VALID [2022-04-15 12:18:26,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {11043#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11044#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:26,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {11044#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {11044#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:26,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {11044#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11045#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:26,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {11045#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {11045#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:26,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {11045#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11046#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:26,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {11046#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11046#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:26,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {11046#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11047#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:26,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {11047#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11047#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:26,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {11047#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11048#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:26,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {11048#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {11048#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:26,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {11048#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11049#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:26,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {11049#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {11049#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:26,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {11049#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11050#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:26,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {11050#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11050#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:26,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {11050#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11051#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:26,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {11051#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11051#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:26,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {11051#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11052#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:26,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {11052#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11052#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:26,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {11052#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11053#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:26,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {11053#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11053#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:26,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {11053#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11054#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:26,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {11054#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11054#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:26,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {11054#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11055#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:26,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {11055#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11055#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:26,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {11055#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11056#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:26,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {11056#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11056#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:26,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {11056#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11057#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:26,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {11057#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {11057#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:26,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {11057#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11058#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:26,231 INFO L290 TraceCheckUtils]: 36: Hoare triple {11058#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {11058#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:26,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {11058#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:26,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {11059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:26,235 INFO L290 TraceCheckUtils]: 39: Hoare triple {11059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11060#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:26,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {11060#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {11060#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:26,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {11060#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11061#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:26,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {11061#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11061#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:26,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {11061#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11062#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:26,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {11062#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {11062#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:26,242 INFO L290 TraceCheckUtils]: 45: Hoare triple {11062#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11063#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:26,242 INFO L290 TraceCheckUtils]: 46: Hoare triple {11063#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11063#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:26,244 INFO L290 TraceCheckUtils]: 47: Hoare triple {11063#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11064#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:26,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {11064#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {11064#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:26,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {11064#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11217#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:26,247 INFO L290 TraceCheckUtils]: 50: Hoare triple {11217#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {11217#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:26,248 INFO L290 TraceCheckUtils]: 51: Hoare triple {11217#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {11224#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:26,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {11224#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {11224#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:26,249 INFO L272 TraceCheckUtils]: 53: Hoare triple {11224#(and (<= main_~x~0 24) (<= 24 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:26,249 INFO L290 TraceCheckUtils]: 54: Hoare triple {11231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:26,249 INFO L290 TraceCheckUtils]: 55: Hoare triple {11235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11039#false} is VALID [2022-04-15 12:18:26,249 INFO L290 TraceCheckUtils]: 56: Hoare triple {11039#false} assume !false; {11039#false} is VALID [2022-04-15 12:18:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:26,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:26,483 INFO L290 TraceCheckUtils]: 56: Hoare triple {11039#false} assume !false; {11039#false} is VALID [2022-04-15 12:18:26,484 INFO L290 TraceCheckUtils]: 55: Hoare triple {11235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11039#false} is VALID [2022-04-15 12:18:26,484 INFO L290 TraceCheckUtils]: 54: Hoare triple {11231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:26,484 INFO L272 TraceCheckUtils]: 53: Hoare triple {11251#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:26,485 INFO L290 TraceCheckUtils]: 52: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,485 INFO L290 TraceCheckUtils]: 51: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,490 INFO L290 TraceCheckUtils]: 49: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,492 INFO L290 TraceCheckUtils]: 46: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,495 INFO L290 TraceCheckUtils]: 45: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,496 INFO L290 TraceCheckUtils]: 43: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,496 INFO L290 TraceCheckUtils]: 42: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,502 INFO L290 TraceCheckUtils]: 37: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,502 INFO L290 TraceCheckUtils]: 36: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,503 INFO L290 TraceCheckUtils]: 34: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {11264#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11264#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:26,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {11251#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {11038#true} ~x~0 := 0; {11251#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:26,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {11038#true} call #t~ret5 := main(); {11038#true} is VALID [2022-04-15 12:18:26,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11038#true} {11038#true} #40#return; {11038#true} is VALID [2022-04-15 12:18:26,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {11038#true} assume true; {11038#true} is VALID [2022-04-15 12:18:26,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {11038#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(13, 2);call #Ultimate.allocInit(12, 3); {11038#true} is VALID [2022-04-15 12:18:26,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {11038#true} call ULTIMATE.init(); {11038#true} is VALID [2022-04-15 12:18:26,531 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2022-04-15 12:18:26,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763331746] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:26,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:26,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28, 6] total 32 [2022-04-15 12:18:26,531 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:26,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [566365674] [2022-04-15 12:18:26,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [566365674] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:26,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:26,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:18:26,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008052320] [2022-04-15 12:18:26,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:26,532 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:18:26,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:26,532 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:18:26,629 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:18:26,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:18:26,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:26,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:18:26,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:18:26,630 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:18:30,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:30,861 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-15 12:18:30,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:18:30,861 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:18:30,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:30,861 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:18:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 69 transitions. [2022-04-15 12:18:30,862 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:18:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 69 transitions. [2022-04-15 12:18:30,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 69 transitions. [2022-04-15 12:18:31,010 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:18:31,011 INFO L225 Difference]: With dead ends: 68 [2022-04-15 12:18:31,011 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 12:18:31,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=2704, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 12:18:31,012 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:31,012 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 54 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 12:18:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 12:18:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-15 12:18:31,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:31,127 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:18:31,127 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:18:31,127 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:18:31,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:31,128 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-15 12:18:31,128 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-15 12:18:31,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:31,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:31,128 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:18:31,128 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:18:31,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:31,129 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-15 12:18:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-15 12:18:31,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:31,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:31,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:31,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:31,129 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:18:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-04-15 12:18:31,130 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 57 [2022-04-15 12:18:31,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:31,130 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-04-15 12:18:31,130 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:18:31,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 63 transitions. [2022-04-15 12:18:31,308 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:18:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-15 12:18:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 12:18:31,309 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:31,309 INFO L499 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:31,325 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:18:31,509 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:18:31,510 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:31,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:31,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1175455128, now seen corresponding path program 45 times [2022-04-15 12:18:31,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:31,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [722695639] [2022-04-15 12:18:31,668 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:18:31,670 INFO L85 PathProgramCache]: Analyzing trace with hash 56247409, now seen corresponding path program 1 times [2022-04-15 12:18:31,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:31,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236054108] [2022-04-15 12:18:31,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:31,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:31,675 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:31,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:31,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1175455128, now seen corresponding path program 46 times [2022-04-15 12:18:31,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:31,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438797810] [2022-04-15 12:18:31,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:31,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:32,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:32,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {11869#(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(13, 2);call #Ultimate.allocInit(12, 3); {11840#true} is VALID [2022-04-15 12:18:32,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {11840#true} assume true; {11840#true} is VALID [2022-04-15 12:18:32,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11840#true} {11840#true} #40#return; {11840#true} is VALID [2022-04-15 12:18:32,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {11840#true} call ULTIMATE.init(); {11869#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:32,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {11869#(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(13, 2);call #Ultimate.allocInit(12, 3); {11840#true} is VALID [2022-04-15 12:18:32,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {11840#true} assume true; {11840#true} is VALID [2022-04-15 12:18:32,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11840#true} {11840#true} #40#return; {11840#true} is VALID [2022-04-15 12:18:32,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {11840#true} call #t~ret5 := main(); {11840#true} is VALID [2022-04-15 12:18:32,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {11840#true} ~x~0 := 0; {11845#(= main_~x~0 0)} is VALID [2022-04-15 12:18:32,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {11845#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {11845#(= main_~x~0 0)} is VALID [2022-04-15 12:18:32,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {11845#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11846#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:32,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {11846#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {11846#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:32,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {11846#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11847#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:32,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {11847#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {11847#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:32,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {11847#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11848#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:32,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {11848#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11848#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:32,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {11848#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11849#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:32,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {11849#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11849#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:32,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {11849#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11850#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:32,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {11850#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {11850#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:32,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {11850#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11851#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:32,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {11851#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {11851#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:32,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {11851#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11852#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:32,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {11852#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11852#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:32,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {11852#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11853#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:32,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {11853#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11853#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:32,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {11853#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11854#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:32,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {11854#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11854#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:32,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {11854#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11855#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:32,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {11855#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11855#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:32,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {11855#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11856#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:32,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {11856#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11856#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:32,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {11856#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11857#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:32,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {11857#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11857#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:32,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {11857#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11858#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:32,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {11858#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11858#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:32,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {11858#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11859#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:32,167 INFO L290 TraceCheckUtils]: 34: Hoare triple {11859#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {11859#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:32,173 INFO L290 TraceCheckUtils]: 35: Hoare triple {11859#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11860#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:32,173 INFO L290 TraceCheckUtils]: 36: Hoare triple {11860#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {11860#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:32,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {11860#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11861#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:32,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {11861#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11861#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:32,180 INFO L290 TraceCheckUtils]: 39: Hoare triple {11861#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11862#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:32,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {11862#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {11862#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:32,182 INFO L290 TraceCheckUtils]: 41: Hoare triple {11862#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11863#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:32,182 INFO L290 TraceCheckUtils]: 42: Hoare triple {11863#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11863#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:32,184 INFO L290 TraceCheckUtils]: 43: Hoare triple {11863#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11864#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:32,184 INFO L290 TraceCheckUtils]: 44: Hoare triple {11864#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {11864#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:32,188 INFO L290 TraceCheckUtils]: 45: Hoare triple {11864#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11865#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:32,189 INFO L290 TraceCheckUtils]: 46: Hoare triple {11865#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11865#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:32,191 INFO L290 TraceCheckUtils]: 47: Hoare triple {11865#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11866#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:32,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {11866#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {11866#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:32,194 INFO L290 TraceCheckUtils]: 49: Hoare triple {11866#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11867#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:32,194 INFO L290 TraceCheckUtils]: 50: Hoare triple {11867#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {11867#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:32,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {11867#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11868#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 23))} is VALID [2022-04-15 12:18:32,197 INFO L290 TraceCheckUtils]: 52: Hoare triple {11868#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {11868#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 23))} is VALID [2022-04-15 12:18:32,198 INFO L290 TraceCheckUtils]: 53: Hoare triple {11868#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 23))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {11841#false} is VALID [2022-04-15 12:18:32,198 INFO L290 TraceCheckUtils]: 54: Hoare triple {11841#false} assume !(~x~0 % 4294967296 < 268435455); {11841#false} is VALID [2022-04-15 12:18:32,198 INFO L272 TraceCheckUtils]: 55: Hoare triple {11841#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11841#false} is VALID [2022-04-15 12:18:32,198 INFO L290 TraceCheckUtils]: 56: Hoare triple {11841#false} ~cond := #in~cond; {11841#false} is VALID [2022-04-15 12:18:32,198 INFO L290 TraceCheckUtils]: 57: Hoare triple {11841#false} assume 0 == ~cond; {11841#false} is VALID [2022-04-15 12:18:32,198 INFO L290 TraceCheckUtils]: 58: Hoare triple {11841#false} assume !false; {11841#false} is VALID [2022-04-15 12:18:32,199 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:18:32,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:32,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438797810] [2022-04-15 12:18:32,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438797810] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:32,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700967890] [2022-04-15 12:18:32,199 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:32,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:32,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:32,200 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:18:32,200 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:18:32,260 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:32,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:32,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-15 12:18:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:32,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:32,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {11840#true} call ULTIMATE.init(); {11840#true} is VALID [2022-04-15 12:18:32,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {11840#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(13, 2);call #Ultimate.allocInit(12, 3); {11840#true} is VALID [2022-04-15 12:18:32,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {11840#true} assume true; {11840#true} is VALID [2022-04-15 12:18:32,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11840#true} {11840#true} #40#return; {11840#true} is VALID [2022-04-15 12:18:32,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {11840#true} call #t~ret5 := main(); {11840#true} is VALID [2022-04-15 12:18:32,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {11840#true} ~x~0 := 0; {11845#(= main_~x~0 0)} is VALID [2022-04-15 12:18:32,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {11845#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {11845#(= main_~x~0 0)} is VALID [2022-04-15 12:18:32,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {11845#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11846#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:32,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {11846#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {11846#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:32,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {11846#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11847#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:32,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {11847#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {11847#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:32,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {11847#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11848#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:32,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {11848#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11848#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:32,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {11848#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11849#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:32,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {11849#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11849#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:32,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {11849#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11850#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:32,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {11850#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {11850#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:32,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {11850#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11851#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:32,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {11851#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {11851#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:32,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {11851#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11852#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:32,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {11852#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11852#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:32,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {11852#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11853#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:32,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {11853#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11853#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:32,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {11853#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11854#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:32,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {11854#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11854#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:32,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {11854#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11855#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:32,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {11855#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11855#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:32,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {11855#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11856#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:32,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {11856#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11856#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:32,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {11856#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11857#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:32,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {11857#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11857#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:32,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {11857#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11858#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:32,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {11858#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11858#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:32,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {11858#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11859#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:32,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {11859#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {11859#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:32,784 INFO L290 TraceCheckUtils]: 35: Hoare triple {11859#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11860#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:32,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {11860#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {11860#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:32,788 INFO L290 TraceCheckUtils]: 37: Hoare triple {11860#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11861#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:32,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {11861#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11861#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:32,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {11861#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11862#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:32,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {11862#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {11862#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:32,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {11862#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11863#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:32,793 INFO L290 TraceCheckUtils]: 42: Hoare triple {11863#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11863#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:32,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {11863#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11864#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:32,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {11864#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {11864#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:32,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {11864#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11865#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:32,799 INFO L290 TraceCheckUtils]: 46: Hoare triple {11865#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11865#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:32,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {11865#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11866#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:32,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {11866#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {11866#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:32,805 INFO L290 TraceCheckUtils]: 49: Hoare triple {11866#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11867#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:32,805 INFO L290 TraceCheckUtils]: 50: Hoare triple {11867#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {11867#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:32,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {11867#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12026#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:18:32,809 INFO L290 TraceCheckUtils]: 52: Hoare triple {12026#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {12026#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:18:32,809 INFO L290 TraceCheckUtils]: 53: Hoare triple {12026#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {12033#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:18:32,811 INFO L290 TraceCheckUtils]: 54: Hoare triple {12033#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {11841#false} is VALID [2022-04-15 12:18:32,811 INFO L272 TraceCheckUtils]: 55: Hoare triple {11841#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11841#false} is VALID [2022-04-15 12:18:32,811 INFO L290 TraceCheckUtils]: 56: Hoare triple {11841#false} ~cond := #in~cond; {11841#false} is VALID [2022-04-15 12:18:32,811 INFO L290 TraceCheckUtils]: 57: Hoare triple {11841#false} assume 0 == ~cond; {11841#false} is VALID [2022-04-15 12:18:32,811 INFO L290 TraceCheckUtils]: 58: Hoare triple {11841#false} assume !false; {11841#false} is VALID [2022-04-15 12:18:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:32,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:34,712 INFO L290 TraceCheckUtils]: 58: Hoare triple {11841#false} assume !false; {11841#false} is VALID [2022-04-15 12:18:34,713 INFO L290 TraceCheckUtils]: 57: Hoare triple {11841#false} assume 0 == ~cond; {11841#false} is VALID [2022-04-15 12:18:34,713 INFO L290 TraceCheckUtils]: 56: Hoare triple {11841#false} ~cond := #in~cond; {11841#false} is VALID [2022-04-15 12:18:34,713 INFO L272 TraceCheckUtils]: 55: Hoare triple {11841#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11841#false} is VALID [2022-04-15 12:18:34,713 INFO L290 TraceCheckUtils]: 54: Hoare triple {12061#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {11841#false} is VALID [2022-04-15 12:18:34,715 INFO L290 TraceCheckUtils]: 53: Hoare triple {12065#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {12061#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,716 INFO L290 TraceCheckUtils]: 52: Hoare triple {12065#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12065#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,721 INFO L290 TraceCheckUtils]: 51: Hoare triple {12072#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12065#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,721 INFO L290 TraceCheckUtils]: 50: Hoare triple {12072#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12072#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {12079#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12072#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {12079#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12079#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,726 INFO L290 TraceCheckUtils]: 47: Hoare triple {12086#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12079#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,726 INFO L290 TraceCheckUtils]: 46: Hoare triple {12086#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12086#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {12093#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12086#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,728 INFO L290 TraceCheckUtils]: 44: Hoare triple {12093#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12093#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {12100#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12093#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {12100#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12100#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,735 INFO L290 TraceCheckUtils]: 41: Hoare triple {12107#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12100#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,735 INFO L290 TraceCheckUtils]: 40: Hoare triple {12107#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12107#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {12114#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12107#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {12114#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12114#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {12121#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12114#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {12121#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12121#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {12128#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12121#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {12128#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12128#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {12135#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12128#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,745 INFO L290 TraceCheckUtils]: 32: Hoare triple {12135#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12135#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {12142#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12135#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {12142#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12142#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {12149#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12142#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,749 INFO L290 TraceCheckUtils]: 28: Hoare triple {12149#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12149#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {12156#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12149#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {12156#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12156#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {12163#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12156#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {12163#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12163#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {12170#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12163#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {12170#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12170#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {12177#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12170#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {12177#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12177#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {12184#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12177#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {12184#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12184#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {12191#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12184#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {12191#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12191#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {12198#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12191#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {12198#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12198#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {12205#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12198#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {12205#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12205#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {12212#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12205#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {12212#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12212#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {12219#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12212#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {12219#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12219#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {12226#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12219#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {12226#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12226#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {11840#true} ~x~0 := 0; {12226#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} is VALID [2022-04-15 12:18:34,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {11840#true} call #t~ret5 := main(); {11840#true} is VALID [2022-04-15 12:18:34,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11840#true} {11840#true} #40#return; {11840#true} is VALID [2022-04-15 12:18:34,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {11840#true} assume true; {11840#true} is VALID [2022-04-15 12:18:34,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {11840#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(13, 2);call #Ultimate.allocInit(12, 3); {11840#true} is VALID [2022-04-15 12:18:34,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {11840#true} call ULTIMATE.init(); {11840#true} is VALID [2022-04-15 12:18:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:34,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700967890] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:34,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:34,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2022-04-15 12:18:34,774 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:34,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [722695639] [2022-04-15 12:18:34,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [722695639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:34,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:34,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 12:18:34,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733662953] [2022-04-15 12:18:34,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:34,774 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:18:34,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:34,774 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:18:34,913 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:18:34,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 12:18:34,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:34,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 12:18:34,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=779, Invalid=2083, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 12:18:34,915 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:18:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:40,234 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2022-04-15 12:18:40,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:18:40,234 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:18:40,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:40,234 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:18:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 71 transitions. [2022-04-15 12:18:40,235 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:18:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 71 transitions. [2022-04-15 12:18:40,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 71 transitions. [2022-04-15 12:18:40,397 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:18:40,398 INFO L225 Difference]: With dead ends: 70 [2022-04-15 12:18:40,398 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 12:18:40,399 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1521, Invalid=4485, Unknown=0, NotChecked=0, Total=6006 [2022-04-15 12:18:40,399 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:40,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 134 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 12:18:40,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 12:18:40,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-15 12:18:40,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:40,516 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:18:40,516 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:18:40,516 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:18:40,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:40,517 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-15 12:18:40,517 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-15 12:18:40,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:40,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:40,517 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:18:40,517 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:18:40,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:40,518 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-15 12:18:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-15 12:18:40,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:40,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:40,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:40,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:40,518 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:18:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-04-15 12:18:40,519 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 59 [2022-04-15 12:18:40,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:40,519 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-04-15 12:18:40,519 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:18:40,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 65 transitions. [2022-04-15 12:18:40,740 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:18:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-15 12:18:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 12:18:40,744 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:40,744 INFO L499 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:40,760 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:18:40,955 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:18:40,955 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:40,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1977916213, now seen corresponding path program 47 times [2022-04-15 12:18:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:40,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [438664355] [2022-04-15 12:18:41,135 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:18:41,137 INFO L85 PathProgramCache]: Analyzing trace with hash 115352753, now seen corresponding path program 1 times [2022-04-15 12:18:41,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:41,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253062207] [2022-04-15 12:18:41,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:41,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:41,143 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:41,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1977916213, now seen corresponding path program 48 times [2022-04-15 12:18:41,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:41,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723719669] [2022-04-15 12:18:41,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:41,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:41,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:41,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {12720#(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(13, 2);call #Ultimate.allocInit(12, 3); {12690#true} is VALID [2022-04-15 12:18:41,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {12690#true} assume true; {12690#true} is VALID [2022-04-15 12:18:41,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12690#true} {12690#true} #40#return; {12690#true} is VALID [2022-04-15 12:18:41,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {12690#true} call ULTIMATE.init(); {12720#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:41,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {12720#(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(13, 2);call #Ultimate.allocInit(12, 3); {12690#true} is VALID [2022-04-15 12:18:41,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {12690#true} assume true; {12690#true} is VALID [2022-04-15 12:18:41,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12690#true} {12690#true} #40#return; {12690#true} is VALID [2022-04-15 12:18:41,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {12690#true} call #t~ret5 := main(); {12690#true} is VALID [2022-04-15 12:18:41,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {12690#true} ~x~0 := 0; {12695#(= main_~x~0 0)} is VALID [2022-04-15 12:18:41,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {12695#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {12695#(= main_~x~0 0)} is VALID [2022-04-15 12:18:41,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {12695#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12696#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:41,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {12696#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {12696#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:41,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {12696#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12697#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:41,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {12697#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {12697#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:41,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {12697#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12698#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:41,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {12698#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12698#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:41,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {12698#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12699#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:41,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {12699#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12699#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:41,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {12699#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12700#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:41,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {12700#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {12700#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:41,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {12700#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12701#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:41,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {12701#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {12701#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:41,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {12701#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12702#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:41,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {12702#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12702#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:41,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {12702#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12703#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:41,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {12703#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12703#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:41,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {12703#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12704#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:41,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {12704#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12704#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:41,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {12704#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12705#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:41,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {12705#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12705#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:41,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {12705#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12706#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:41,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {12706#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12706#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:41,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {12706#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12707#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:41,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {12707#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12707#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:41,664 INFO L290 TraceCheckUtils]: 31: Hoare triple {12707#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12708#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:41,664 INFO L290 TraceCheckUtils]: 32: Hoare triple {12708#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12708#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:41,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {12708#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12709#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:41,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {12709#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {12709#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:41,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {12709#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12710#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:41,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {12710#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {12710#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:41,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {12710#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12711#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:41,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {12711#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12711#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:41,677 INFO L290 TraceCheckUtils]: 39: Hoare triple {12711#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12712#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:41,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {12712#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {12712#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:41,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {12712#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12713#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:41,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {12713#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12713#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:41,680 INFO L290 TraceCheckUtils]: 43: Hoare triple {12713#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12714#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:41,680 INFO L290 TraceCheckUtils]: 44: Hoare triple {12714#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {12714#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:41,684 INFO L290 TraceCheckUtils]: 45: Hoare triple {12714#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12715#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:41,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {12715#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12715#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:41,687 INFO L290 TraceCheckUtils]: 47: Hoare triple {12715#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12716#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:41,687 INFO L290 TraceCheckUtils]: 48: Hoare triple {12716#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {12716#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:41,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {12716#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12717#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:41,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {12717#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {12717#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:41,693 INFO L290 TraceCheckUtils]: 51: Hoare triple {12717#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12718#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:18:41,694 INFO L290 TraceCheckUtils]: 52: Hoare triple {12718#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {12718#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:18:41,697 INFO L290 TraceCheckUtils]: 53: Hoare triple {12718#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12719#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:41,697 INFO L290 TraceCheckUtils]: 54: Hoare triple {12719#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {12719#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:41,698 INFO L290 TraceCheckUtils]: 55: Hoare triple {12719#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {12691#false} is VALID [2022-04-15 12:18:41,698 INFO L290 TraceCheckUtils]: 56: Hoare triple {12691#false} assume !(~x~0 % 4294967296 < 268435455); {12691#false} is VALID [2022-04-15 12:18:41,698 INFO L272 TraceCheckUtils]: 57: Hoare triple {12691#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12691#false} is VALID [2022-04-15 12:18:41,698 INFO L290 TraceCheckUtils]: 58: Hoare triple {12691#false} ~cond := #in~cond; {12691#false} is VALID [2022-04-15 12:18:41,699 INFO L290 TraceCheckUtils]: 59: Hoare triple {12691#false} assume 0 == ~cond; {12691#false} is VALID [2022-04-15 12:18:41,699 INFO L290 TraceCheckUtils]: 60: Hoare triple {12691#false} assume !false; {12691#false} is VALID [2022-04-15 12:18:41,699 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:18:41,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:41,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723719669] [2022-04-15 12:18:41,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723719669] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:41,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614373233] [2022-04-15 12:18:41,699 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:41,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:41,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:41,700 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:18:41,701 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:18:41,767 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:18:41,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:41,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:18:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:41,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:42,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {12690#true} call ULTIMATE.init(); {12690#true} is VALID [2022-04-15 12:18:42,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {12690#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(13, 2);call #Ultimate.allocInit(12, 3); {12690#true} is VALID [2022-04-15 12:18:42,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {12690#true} assume true; {12690#true} is VALID [2022-04-15 12:18:42,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12690#true} {12690#true} #40#return; {12690#true} is VALID [2022-04-15 12:18:42,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {12690#true} call #t~ret5 := main(); {12690#true} is VALID [2022-04-15 12:18:42,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {12690#true} ~x~0 := 0; {12690#true} is VALID [2022-04-15 12:18:42,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 37: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,266 INFO L290 TraceCheckUtils]: 46: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,266 INFO L290 TraceCheckUtils]: 47: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,266 INFO L290 TraceCheckUtils]: 48: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,266 INFO L290 TraceCheckUtils]: 49: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,266 INFO L290 TraceCheckUtils]: 50: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,266 INFO L290 TraceCheckUtils]: 51: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,266 INFO L290 TraceCheckUtils]: 52: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,273 INFO L290 TraceCheckUtils]: 53: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12883#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:18:42,273 INFO L290 TraceCheckUtils]: 54: Hoare triple {12883#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {12883#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:18:42,281 INFO L290 TraceCheckUtils]: 55: Hoare triple {12883#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {12890#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65521)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65521))} is VALID [2022-04-15 12:18:42,283 INFO L290 TraceCheckUtils]: 56: Hoare triple {12890#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65521)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65521))} assume !(~x~0 % 4294967296 < 268435455); {12691#false} is VALID [2022-04-15 12:18:42,283 INFO L272 TraceCheckUtils]: 57: Hoare triple {12691#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12691#false} is VALID [2022-04-15 12:18:42,283 INFO L290 TraceCheckUtils]: 58: Hoare triple {12691#false} ~cond := #in~cond; {12691#false} is VALID [2022-04-15 12:18:42,283 INFO L290 TraceCheckUtils]: 59: Hoare triple {12691#false} assume 0 == ~cond; {12691#false} is VALID [2022-04-15 12:18:42,283 INFO L290 TraceCheckUtils]: 60: Hoare triple {12691#false} assume !false; {12691#false} is VALID [2022-04-15 12:18:42,284 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:18:42,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:42,865 INFO L290 TraceCheckUtils]: 60: Hoare triple {12691#false} assume !false; {12691#false} is VALID [2022-04-15 12:18:42,866 INFO L290 TraceCheckUtils]: 59: Hoare triple {12691#false} assume 0 == ~cond; {12691#false} is VALID [2022-04-15 12:18:42,866 INFO L290 TraceCheckUtils]: 58: Hoare triple {12691#false} ~cond := #in~cond; {12691#false} is VALID [2022-04-15 12:18:42,866 INFO L272 TraceCheckUtils]: 57: Hoare triple {12691#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12691#false} is VALID [2022-04-15 12:18:42,866 INFO L290 TraceCheckUtils]: 56: Hoare triple {12918#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {12691#false} is VALID [2022-04-15 12:18:42,868 INFO L290 TraceCheckUtils]: 55: Hoare triple {12922#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {12918#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:42,869 INFO L290 TraceCheckUtils]: 54: Hoare triple {12926#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455); {12922#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:42,871 INFO L290 TraceCheckUtils]: 53: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12926#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 12:18:42,871 INFO L290 TraceCheckUtils]: 52: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,871 INFO L290 TraceCheckUtils]: 51: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,871 INFO L290 TraceCheckUtils]: 50: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,871 INFO L290 TraceCheckUtils]: 49: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,871 INFO L290 TraceCheckUtils]: 47: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,871 INFO L290 TraceCheckUtils]: 45: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 36: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 32: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {12690#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {12690#true} assume !!(~x~0 % 4294967296 < 268435455); {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {12690#true} ~x~0 := 0; {12690#true} is VALID [2022-04-15 12:18:42,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {12690#true} call #t~ret5 := main(); {12690#true} is VALID [2022-04-15 12:18:42,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12690#true} {12690#true} #40#return; {12690#true} is VALID [2022-04-15 12:18:42,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {12690#true} assume true; {12690#true} is VALID [2022-04-15 12:18:42,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {12690#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(13, 2);call #Ultimate.allocInit(12, 3); {12690#true} is VALID [2022-04-15 12:18:42,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {12690#true} call ULTIMATE.init(); {12690#true} is VALID [2022-04-15 12:18:42,874 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:18:42,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614373233] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:42,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:42,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 4, 5] total 33 [2022-04-15 12:18:42,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:42,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [438664355] [2022-04-15 12:18:42,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [438664355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:42,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:42,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:18:42,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449346173] [2022-04-15 12:18:42,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:42,875 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:18:42,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:42,875 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:18:43,057 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:18:43,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:18:43,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:43,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:18:43,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:18:43,058 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:18:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:49,038 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-04-15 12:18:49,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:18:49,038 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:18:49,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:49,038 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:18:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 73 transitions. [2022-04-15 12:18:49,039 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:18:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 73 transitions. [2022-04-15 12:18:49,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 73 transitions. [2022-04-15 12:18:49,254 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:18:49,254 INFO L225 Difference]: With dead ends: 72 [2022-04-15 12:18:49,254 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 12:18:49,255 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=438, Invalid=2868, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 12:18:49,256 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:49,256 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 99 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 12:18:49,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 12:18:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 12:18:49,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:49,377 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:18:49,377 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:18:49,377 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:18:49,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:49,378 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2022-04-15 12:18:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-15 12:18:49,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:49,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:49,378 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:18:49,378 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:18:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:49,379 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2022-04-15 12:18:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-15 12:18:49,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:49,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:49,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:49,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:49,379 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:18:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2022-04-15 12:18:49,380 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 61 [2022-04-15 12:18:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:49,380 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2022-04-15 12:18:49,380 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:18:49,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 67 transitions. [2022-04-15 12:18:49,606 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:18:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-15 12:18:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 12:18:49,607 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:49,607 INFO L499 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:49,615 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:18:49,811 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:18:49,811 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:49,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:49,811 INFO L85 PathProgramCache]: Analyzing trace with hash 48905618, now seen corresponding path program 49 times [2022-04-15 12:18:49,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:49,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1119417646] [2022-04-15 12:18:49,955 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:18:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash 174458097, now seen corresponding path program 1 times [2022-04-15 12:18:49,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:49,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166232367] [2022-04-15 12:18:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:49,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:49,961 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:49,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:49,965 INFO L85 PathProgramCache]: Analyzing trace with hash 48905618, now seen corresponding path program 50 times [2022-04-15 12:18:49,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:49,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204758468] [2022-04-15 12:18:49,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:49,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:50,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:50,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {13576#(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(13, 2);call #Ultimate.allocInit(12, 3); {13545#true} is VALID [2022-04-15 12:18:50,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {13545#true} assume true; {13545#true} is VALID [2022-04-15 12:18:50,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13545#true} {13545#true} #40#return; {13545#true} is VALID [2022-04-15 12:18:50,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {13545#true} call ULTIMATE.init(); {13576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:50,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {13576#(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(13, 2);call #Ultimate.allocInit(12, 3); {13545#true} is VALID [2022-04-15 12:18:50,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {13545#true} assume true; {13545#true} is VALID [2022-04-15 12:18:50,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13545#true} {13545#true} #40#return; {13545#true} is VALID [2022-04-15 12:18:50,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {13545#true} call #t~ret5 := main(); {13545#true} is VALID [2022-04-15 12:18:50,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {13545#true} ~x~0 := 0; {13550#(= main_~x~0 0)} is VALID [2022-04-15 12:18:50,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {13550#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {13550#(= main_~x~0 0)} is VALID [2022-04-15 12:18:50,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {13550#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13551#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:50,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {13551#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {13551#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:50,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {13551#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13552#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:50,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {13552#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {13552#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:50,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {13552#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13553#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:50,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {13553#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13553#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:50,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {13553#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13554#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:50,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {13554#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13554#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:50,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {13554#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13555#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:50,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {13555#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {13555#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:50,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {13555#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13556#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:50,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {13556#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {13556#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:50,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {13556#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13557#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:50,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {13557#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13557#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:50,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {13557#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13558#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:50,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {13558#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13558#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:50,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {13558#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13559#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:50,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {13559#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13559#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:50,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {13559#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13560#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:50,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {13560#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13560#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:50,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {13560#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13561#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:50,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {13561#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13561#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:50,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {13561#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13562#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:50,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {13562#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13562#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:50,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {13562#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13563#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:50,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {13563#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13563#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:50,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {13563#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13564#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:50,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {13564#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {13564#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:50,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {13564#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13565#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:50,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {13565#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {13565#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:50,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {13565#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13566#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:50,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {13566#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13566#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:50,558 INFO L290 TraceCheckUtils]: 39: Hoare triple {13566#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13567#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:50,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {13567#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {13567#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:50,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {13567#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13568#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:50,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {13568#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13568#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:50,561 INFO L290 TraceCheckUtils]: 43: Hoare triple {13568#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13569#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:50,561 INFO L290 TraceCheckUtils]: 44: Hoare triple {13569#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {13569#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:50,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {13569#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:50,565 INFO L290 TraceCheckUtils]: 46: Hoare triple {13570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:50,568 INFO L290 TraceCheckUtils]: 47: Hoare triple {13570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13571#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:50,568 INFO L290 TraceCheckUtils]: 48: Hoare triple {13571#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {13571#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:50,570 INFO L290 TraceCheckUtils]: 49: Hoare triple {13571#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13572#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:50,571 INFO L290 TraceCheckUtils]: 50: Hoare triple {13572#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {13572#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:50,573 INFO L290 TraceCheckUtils]: 51: Hoare triple {13572#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13573#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:18:50,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {13573#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {13573#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:18:50,576 INFO L290 TraceCheckUtils]: 53: Hoare triple {13573#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13574#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:50,576 INFO L290 TraceCheckUtils]: 54: Hoare triple {13574#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13574#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:50,579 INFO L290 TraceCheckUtils]: 55: Hoare triple {13574#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13575#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} is VALID [2022-04-15 12:18:50,579 INFO L290 TraceCheckUtils]: 56: Hoare triple {13575#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} assume !!(~x~0 % 4294967296 < 268435455); {13575#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} is VALID [2022-04-15 12:18:50,580 INFO L290 TraceCheckUtils]: 57: Hoare triple {13575#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {13546#false} is VALID [2022-04-15 12:18:50,580 INFO L290 TraceCheckUtils]: 58: Hoare triple {13546#false} assume !(~x~0 % 4294967296 < 268435455); {13546#false} is VALID [2022-04-15 12:18:50,581 INFO L272 TraceCheckUtils]: 59: Hoare triple {13546#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13546#false} is VALID [2022-04-15 12:18:50,581 INFO L290 TraceCheckUtils]: 60: Hoare triple {13546#false} ~cond := #in~cond; {13546#false} is VALID [2022-04-15 12:18:50,581 INFO L290 TraceCheckUtils]: 61: Hoare triple {13546#false} assume 0 == ~cond; {13546#false} is VALID [2022-04-15 12:18:50,581 INFO L290 TraceCheckUtils]: 62: Hoare triple {13546#false} assume !false; {13546#false} is VALID [2022-04-15 12:18:50,581 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:18:50,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:50,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204758468] [2022-04-15 12:18:50,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204758468] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:50,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715469256] [2022-04-15 12:18:50,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:50,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:50,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:50,583 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:18:50,583 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:18:50,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:50,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:50,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-15 12:18:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:50,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:51,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {13545#true} call ULTIMATE.init(); {13545#true} is VALID [2022-04-15 12:18:51,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {13545#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(13, 2);call #Ultimate.allocInit(12, 3); {13545#true} is VALID [2022-04-15 12:18:51,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {13545#true} assume true; {13545#true} is VALID [2022-04-15 12:18:51,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13545#true} {13545#true} #40#return; {13545#true} is VALID [2022-04-15 12:18:51,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {13545#true} call #t~ret5 := main(); {13545#true} is VALID [2022-04-15 12:18:51,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {13545#true} ~x~0 := 0; {13550#(= main_~x~0 0)} is VALID [2022-04-15 12:18:51,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {13550#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {13550#(= main_~x~0 0)} is VALID [2022-04-15 12:18:51,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {13550#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13551#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:51,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {13551#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {13551#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:51,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {13551#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13552#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:51,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {13552#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {13552#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:51,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {13552#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13553#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:51,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {13553#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13553#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:51,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {13553#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13554#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:51,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {13554#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13554#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:51,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {13554#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13555#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:51,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {13555#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {13555#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:51,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {13555#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13556#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:51,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {13556#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {13556#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:51,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {13556#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13557#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:51,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {13557#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13557#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:51,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {13557#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13558#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:51,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {13558#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13558#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:51,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {13558#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13559#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:51,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {13559#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13559#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:51,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {13559#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13560#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:51,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {13560#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13560#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:51,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {13560#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13561#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:51,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {13561#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13561#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:51,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {13561#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13562#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:51,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {13562#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13562#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:51,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {13562#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13563#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:51,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {13563#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13563#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:51,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {13563#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13564#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:51,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {13564#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {13564#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:51,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {13564#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13565#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:51,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {13565#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {13565#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:51,231 INFO L290 TraceCheckUtils]: 37: Hoare triple {13565#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13566#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:51,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {13566#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13566#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:51,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {13566#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13567#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:51,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {13567#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {13567#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:51,239 INFO L290 TraceCheckUtils]: 41: Hoare triple {13567#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13568#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:51,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {13568#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13568#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:51,241 INFO L290 TraceCheckUtils]: 43: Hoare triple {13568#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13569#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:51,242 INFO L290 TraceCheckUtils]: 44: Hoare triple {13569#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {13569#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:51,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {13569#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:51,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {13570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:51,251 INFO L290 TraceCheckUtils]: 47: Hoare triple {13570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13571#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:51,251 INFO L290 TraceCheckUtils]: 48: Hoare triple {13571#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {13571#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:51,254 INFO L290 TraceCheckUtils]: 49: Hoare triple {13571#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13572#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:51,254 INFO L290 TraceCheckUtils]: 50: Hoare triple {13572#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {13572#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:51,257 INFO L290 TraceCheckUtils]: 51: Hoare triple {13572#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13573#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:18:51,258 INFO L290 TraceCheckUtils]: 52: Hoare triple {13573#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {13573#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:18:51,261 INFO L290 TraceCheckUtils]: 53: Hoare triple {13573#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13574#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:51,262 INFO L290 TraceCheckUtils]: 54: Hoare triple {13574#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13574#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:51,265 INFO L290 TraceCheckUtils]: 55: Hoare triple {13574#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13745#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:18:51,265 INFO L290 TraceCheckUtils]: 56: Hoare triple {13745#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13745#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:18:51,266 INFO L290 TraceCheckUtils]: 57: Hoare triple {13745#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {13752#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:18:51,268 INFO L290 TraceCheckUtils]: 58: Hoare triple {13752#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !(~x~0 % 4294967296 < 268435455); {13546#false} is VALID [2022-04-15 12:18:51,268 INFO L272 TraceCheckUtils]: 59: Hoare triple {13546#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13546#false} is VALID [2022-04-15 12:18:51,268 INFO L290 TraceCheckUtils]: 60: Hoare triple {13546#false} ~cond := #in~cond; {13546#false} is VALID [2022-04-15 12:18:51,268 INFO L290 TraceCheckUtils]: 61: Hoare triple {13546#false} assume 0 == ~cond; {13546#false} is VALID [2022-04-15 12:18:51,268 INFO L290 TraceCheckUtils]: 62: Hoare triple {13546#false} assume !false; {13546#false} is VALID [2022-04-15 12:18:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:51,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:53,961 INFO L290 TraceCheckUtils]: 62: Hoare triple {13546#false} assume !false; {13546#false} is VALID [2022-04-15 12:18:53,961 INFO L290 TraceCheckUtils]: 61: Hoare triple {13546#false} assume 0 == ~cond; {13546#false} is VALID [2022-04-15 12:18:53,961 INFO L290 TraceCheckUtils]: 60: Hoare triple {13546#false} ~cond := #in~cond; {13546#false} is VALID [2022-04-15 12:18:53,961 INFO L272 TraceCheckUtils]: 59: Hoare triple {13546#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13546#false} is VALID [2022-04-15 12:18:53,961 INFO L290 TraceCheckUtils]: 58: Hoare triple {13780#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {13546#false} is VALID [2022-04-15 12:18:53,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {13784#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {13780#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:53,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {13784#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13784#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:53,972 INFO L290 TraceCheckUtils]: 55: Hoare triple {13791#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13784#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:53,973 INFO L290 TraceCheckUtils]: 54: Hoare triple {13791#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13791#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:18:53,976 INFO L290 TraceCheckUtils]: 53: Hoare triple {13798#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13791#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:18:53,977 INFO L290 TraceCheckUtils]: 52: Hoare triple {13798#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13798#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:53,979 INFO L290 TraceCheckUtils]: 51: Hoare triple {13805#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13798#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:53,980 INFO L290 TraceCheckUtils]: 50: Hoare triple {13805#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13805#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:53,981 INFO L290 TraceCheckUtils]: 49: Hoare triple {13812#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13805#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:53,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {13812#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13812#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:53,990 INFO L290 TraceCheckUtils]: 47: Hoare triple {13819#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13812#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:53,990 INFO L290 TraceCheckUtils]: 46: Hoare triple {13819#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13819#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:53,998 INFO L290 TraceCheckUtils]: 45: Hoare triple {13826#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13819#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:53,998 INFO L290 TraceCheckUtils]: 44: Hoare triple {13826#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13826#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,006 INFO L290 TraceCheckUtils]: 43: Hoare triple {13833#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13826#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,006 INFO L290 TraceCheckUtils]: 42: Hoare triple {13833#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13833#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,010 INFO L290 TraceCheckUtils]: 41: Hoare triple {13840#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13833#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {13840#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13840#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,015 INFO L290 TraceCheckUtils]: 39: Hoare triple {13847#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13840#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,016 INFO L290 TraceCheckUtils]: 38: Hoare triple {13847#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13847#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {13854#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13847#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {13854#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13854#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {13861#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13854#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {13861#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13861#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {13868#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13861#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {13868#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13868#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {13875#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13868#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {13875#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13875#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {13882#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13875#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {13882#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13882#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {13889#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13882#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {13889#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13889#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {13896#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13889#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {13896#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13896#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {13903#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13896#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {13903#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13903#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {13910#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13903#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {13910#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13910#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {13917#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13910#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {13917#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13917#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {13924#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13917#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {13924#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13924#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {13931#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13924#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {13931#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13931#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {13938#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13931#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {13938#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13938#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {13945#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13938#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {13945#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13945#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {13952#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13945#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {13952#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13952#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {13959#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13952#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {13959#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13959#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {13545#true} ~x~0 := 0; {13959#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} is VALID [2022-04-15 12:18:54,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {13545#true} call #t~ret5 := main(); {13545#true} is VALID [2022-04-15 12:18:54,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13545#true} {13545#true} #40#return; {13545#true} is VALID [2022-04-15 12:18:54,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {13545#true} assume true; {13545#true} is VALID [2022-04-15 12:18:54,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {13545#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(13, 2);call #Ultimate.allocInit(12, 3); {13545#true} is VALID [2022-04-15 12:18:54,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {13545#true} call ULTIMATE.init(); {13545#true} is VALID [2022-04-15 12:18:54,086 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:54,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715469256] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:54,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:54,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2022-04-15 12:18:54,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:54,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1119417646] [2022-04-15 12:18:54,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1119417646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:54,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:54,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 12:18:54,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079292779] [2022-04-15 12:18:54,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:54,087 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:18:54,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:54,088 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:18:54,346 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:18:54,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 12:18:54,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:54,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 12:18:54,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=895, Invalid=2411, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 12:18:54,348 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:19:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:03,467 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2022-04-15 12:19:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:19:03,468 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:19:03,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:03,468 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:19:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 75 transitions. [2022-04-15 12:19:03,469 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:19:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 75 transitions. [2022-04-15 12:19:03,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 75 transitions. [2022-04-15 12:19:03,754 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:19:03,755 INFO L225 Difference]: With dead ends: 74 [2022-04-15 12:19:03,755 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 12:19:03,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1751, Invalid=5221, Unknown=0, NotChecked=0, Total=6972 [2022-04-15 12:19:03,756 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:03,757 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 69 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-15 12:19:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 12:19:03,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-15 12:19:03,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:03,933 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:19:03,933 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:19:03,933 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:19:03,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:03,934 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2022-04-15 12:19:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-15 12:19:03,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:03,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:03,934 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:19:03,934 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:19:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:03,935 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2022-04-15 12:19:03,935 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-15 12:19:03,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:03,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:03,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:03,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:03,935 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:19:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2022-04-15 12:19:03,936 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 63 [2022-04-15 12:19:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:03,936 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2022-04-15 12:19:03,936 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:19:03,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 69 transitions. [2022-04-15 12:19:04,370 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:19:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-15 12:19:04,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 12:19:04,370 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:04,370 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:04,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 12:19:04,579 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:19:04,579 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:04,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:04,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1695595695, now seen corresponding path program 51 times [2022-04-15 12:19:04,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:04,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [232510061] [2022-04-15 12:19:04,735 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:19:04,737 INFO L85 PathProgramCache]: Analyzing trace with hash 233563441, now seen corresponding path program 1 times [2022-04-15 12:19:04,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:04,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29036328] [2022-04-15 12:19:04,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:04,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:04,746 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:19:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:04,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:19:04,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1695595695, now seen corresponding path program 52 times [2022-04-15 12:19:04,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:04,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872561444] [2022-04-15 12:19:04,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:04,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:05,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:05,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {14483#(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(13, 2);call #Ultimate.allocInit(12, 3); {14451#true} is VALID [2022-04-15 12:19:05,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {14451#true} assume true; {14451#true} is VALID [2022-04-15 12:19:05,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14451#true} {14451#true} #40#return; {14451#true} is VALID [2022-04-15 12:19:05,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {14451#true} call ULTIMATE.init(); {14483#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:05,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {14483#(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(13, 2);call #Ultimate.allocInit(12, 3); {14451#true} is VALID [2022-04-15 12:19:05,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {14451#true} assume true; {14451#true} is VALID [2022-04-15 12:19:05,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14451#true} {14451#true} #40#return; {14451#true} is VALID [2022-04-15 12:19:05,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {14451#true} call #t~ret5 := main(); {14451#true} is VALID [2022-04-15 12:19:05,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {14451#true} ~x~0 := 0; {14456#(= main_~x~0 0)} is VALID [2022-04-15 12:19:05,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {14456#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {14456#(= main_~x~0 0)} is VALID [2022-04-15 12:19:05,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {14456#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14457#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:05,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {14457#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {14457#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:05,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {14457#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14458#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:05,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {14458#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {14458#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:05,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {14458#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14459#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:05,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {14459#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14459#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:05,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {14459#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14460#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:05,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {14460#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14460#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:05,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {14460#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14461#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:05,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {14461#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {14461#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:05,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {14461#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14462#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:05,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {14462#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {14462#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:05,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {14462#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14463#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:05,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {14463#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14463#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:05,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {14463#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14464#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:05,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {14464#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14464#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:05,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {14464#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14465#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:05,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {14465#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14465#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:05,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {14465#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14466#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:05,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {14466#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14466#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:05,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {14466#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14467#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:05,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {14467#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14467#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:05,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {14467#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14468#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:05,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {14468#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14468#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:05,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {14468#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14469#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:05,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {14469#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14469#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:05,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {14469#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14470#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:05,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {14470#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {14470#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:05,441 INFO L290 TraceCheckUtils]: 35: Hoare triple {14470#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14471#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:05,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {14471#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {14471#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:05,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {14471#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:05,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {14472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:05,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {14472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14473#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:05,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {14473#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {14473#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:05,464 INFO L290 TraceCheckUtils]: 41: Hoare triple {14473#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14474#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:05,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {14474#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14474#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:05,466 INFO L290 TraceCheckUtils]: 43: Hoare triple {14474#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14475#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:05,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {14475#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {14475#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:05,475 INFO L290 TraceCheckUtils]: 45: Hoare triple {14475#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14476#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:05,476 INFO L290 TraceCheckUtils]: 46: Hoare triple {14476#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14476#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:05,484 INFO L290 TraceCheckUtils]: 47: Hoare triple {14476#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14477#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:05,485 INFO L290 TraceCheckUtils]: 48: Hoare triple {14477#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {14477#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:05,491 INFO L290 TraceCheckUtils]: 49: Hoare triple {14477#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14478#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:05,492 INFO L290 TraceCheckUtils]: 50: Hoare triple {14478#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {14478#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:05,500 INFO L290 TraceCheckUtils]: 51: Hoare triple {14478#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14479#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:05,501 INFO L290 TraceCheckUtils]: 52: Hoare triple {14479#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {14479#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:05,510 INFO L290 TraceCheckUtils]: 53: Hoare triple {14479#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14480#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:05,511 INFO L290 TraceCheckUtils]: 54: Hoare triple {14480#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14480#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:05,522 INFO L290 TraceCheckUtils]: 55: Hoare triple {14480#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14481#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:05,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {14481#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14481#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:05,525 INFO L290 TraceCheckUtils]: 57: Hoare triple {14481#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14482#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-15 12:19:05,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {14482#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 268435455); {14482#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-15 12:19:05,528 INFO L290 TraceCheckUtils]: 59: Hoare triple {14482#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {14452#false} is VALID [2022-04-15 12:19:05,528 INFO L290 TraceCheckUtils]: 60: Hoare triple {14452#false} assume !(~x~0 % 4294967296 < 268435455); {14452#false} is VALID [2022-04-15 12:19:05,529 INFO L272 TraceCheckUtils]: 61: Hoare triple {14452#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14452#false} is VALID [2022-04-15 12:19:05,529 INFO L290 TraceCheckUtils]: 62: Hoare triple {14452#false} ~cond := #in~cond; {14452#false} is VALID [2022-04-15 12:19:05,529 INFO L290 TraceCheckUtils]: 63: Hoare triple {14452#false} assume 0 == ~cond; {14452#false} is VALID [2022-04-15 12:19:05,529 INFO L290 TraceCheckUtils]: 64: Hoare triple {14452#false} assume !false; {14452#false} is VALID [2022-04-15 12:19:05,529 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:19:05,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:05,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872561444] [2022-04-15 12:19:05,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872561444] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:05,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367206931] [2022-04-15 12:19:05,530 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:19:05,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:05,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:05,531 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:19:05,531 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:19:05,581 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:19:05,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:05,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-15 12:19:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:05,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:06,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {14451#true} call ULTIMATE.init(); {14451#true} is VALID [2022-04-15 12:19:06,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {14451#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(13, 2);call #Ultimate.allocInit(12, 3); {14451#true} is VALID [2022-04-15 12:19:06,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {14451#true} assume true; {14451#true} is VALID [2022-04-15 12:19:06,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14451#true} {14451#true} #40#return; {14451#true} is VALID [2022-04-15 12:19:06,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {14451#true} call #t~ret5 := main(); {14451#true} is VALID [2022-04-15 12:19:06,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {14451#true} ~x~0 := 0; {14456#(= main_~x~0 0)} is VALID [2022-04-15 12:19:06,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {14456#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {14456#(= main_~x~0 0)} is VALID [2022-04-15 12:19:06,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {14456#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14457#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:06,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {14457#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {14457#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:06,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {14457#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14458#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:06,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {14458#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {14458#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:06,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {14458#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14459#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:06,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {14459#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14459#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:06,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {14459#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14460#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:06,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {14460#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14460#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:06,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {14460#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14461#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:06,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {14461#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {14461#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:06,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {14461#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14462#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:06,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {14462#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {14462#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:06,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {14462#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14463#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:06,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {14463#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14463#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:06,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {14463#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14464#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:06,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {14464#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14464#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:06,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {14464#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14465#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:06,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {14465#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14465#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:06,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {14465#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14466#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:06,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {14466#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14466#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:06,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {14466#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14467#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:06,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {14467#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14467#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:06,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {14467#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14468#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:06,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {14468#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14468#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:06,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {14468#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14469#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:06,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {14469#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14469#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:06,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {14469#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14470#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:06,258 INFO L290 TraceCheckUtils]: 34: Hoare triple {14470#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {14470#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:06,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {14470#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14471#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:06,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {14471#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {14471#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:06,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {14471#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:06,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {14472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:06,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {14472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14473#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:06,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {14473#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {14473#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:06,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {14473#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14474#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:06,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {14474#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14474#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:06,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {14474#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14475#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:06,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {14475#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {14475#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:06,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {14475#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14476#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:06,306 INFO L290 TraceCheckUtils]: 46: Hoare triple {14476#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14476#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:06,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {14476#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14477#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:06,314 INFO L290 TraceCheckUtils]: 48: Hoare triple {14477#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {14477#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:06,322 INFO L290 TraceCheckUtils]: 49: Hoare triple {14477#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14478#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:06,323 INFO L290 TraceCheckUtils]: 50: Hoare triple {14478#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {14478#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:06,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {14478#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14479#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:06,333 INFO L290 TraceCheckUtils]: 52: Hoare triple {14479#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {14479#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:06,343 INFO L290 TraceCheckUtils]: 53: Hoare triple {14479#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14480#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:06,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {14480#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14480#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:06,354 INFO L290 TraceCheckUtils]: 55: Hoare triple {14480#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14481#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:06,354 INFO L290 TraceCheckUtils]: 56: Hoare triple {14481#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14481#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:06,364 INFO L290 TraceCheckUtils]: 57: Hoare triple {14481#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14658#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:06,365 INFO L290 TraceCheckUtils]: 58: Hoare triple {14658#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14658#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:06,366 INFO L290 TraceCheckUtils]: 59: Hoare triple {14658#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {14665#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:19:06,366 INFO L290 TraceCheckUtils]: 60: Hoare triple {14665#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 268435455); {14665#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:19:06,367 INFO L272 TraceCheckUtils]: 61: Hoare triple {14665#(and (<= 28 main_~x~0) (<= main_~x~0 28))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:06,367 INFO L290 TraceCheckUtils]: 62: Hoare triple {14672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:06,367 INFO L290 TraceCheckUtils]: 63: Hoare triple {14676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14452#false} is VALID [2022-04-15 12:19:06,367 INFO L290 TraceCheckUtils]: 64: Hoare triple {14452#false} assume !false; {14452#false} is VALID [2022-04-15 12:19:06,368 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:19:06,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:06,665 INFO L290 TraceCheckUtils]: 64: Hoare triple {14452#false} assume !false; {14452#false} is VALID [2022-04-15 12:19:06,666 INFO L290 TraceCheckUtils]: 63: Hoare triple {14676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14452#false} is VALID [2022-04-15 12:19:06,666 INFO L290 TraceCheckUtils]: 62: Hoare triple {14672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:06,667 INFO L272 TraceCheckUtils]: 61: Hoare triple {14692#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:06,667 INFO L290 TraceCheckUtils]: 60: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,668 INFO L290 TraceCheckUtils]: 59: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,684 INFO L290 TraceCheckUtils]: 57: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,684 INFO L290 TraceCheckUtils]: 56: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,686 INFO L290 TraceCheckUtils]: 55: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,686 INFO L290 TraceCheckUtils]: 54: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,701 INFO L290 TraceCheckUtils]: 53: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,702 INFO L290 TraceCheckUtils]: 52: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,703 INFO L290 TraceCheckUtils]: 51: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,704 INFO L290 TraceCheckUtils]: 50: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,718 INFO L290 TraceCheckUtils]: 48: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,720 INFO L290 TraceCheckUtils]: 46: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,733 INFO L290 TraceCheckUtils]: 44: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,751 INFO L290 TraceCheckUtils]: 41: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,753 INFO L290 TraceCheckUtils]: 38: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {14705#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14705#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:06,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {14692#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {14451#true} ~x~0 := 0; {14692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:06,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {14451#true} call #t~ret5 := main(); {14451#true} is VALID [2022-04-15 12:19:06,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14451#true} {14451#true} #40#return; {14451#true} is VALID [2022-04-15 12:19:06,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {14451#true} assume true; {14451#true} is VALID [2022-04-15 12:19:06,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {14451#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(13, 2);call #Ultimate.allocInit(12, 3); {14451#true} is VALID [2022-04-15 12:19:06,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {14451#true} call ULTIMATE.init(); {14451#true} is VALID [2022-04-15 12:19:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 377 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-04-15 12:19:06,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367206931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:06,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:06,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 6] total 36 [2022-04-15 12:19:06,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:06,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [232510061] [2022-04-15 12:19:06,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [232510061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:06,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:06,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:19:06,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767851839] [2022-04-15 12:19:06,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:06,879 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:19:06,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:06,879 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:19:07,290 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:19:07,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:19:07,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:07,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:19:07,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:19:07,292 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:19:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:19,190 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-15 12:19:19,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 12:19:19,190 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:19:19,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:19,190 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:19:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 77 transitions. [2022-04-15 12:19:19,191 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:19:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 77 transitions. [2022-04-15 12:19:19,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 77 transitions. [2022-04-15 12:19:19,476 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:19:19,477 INFO L225 Difference]: With dead ends: 76 [2022-04-15 12:19:19,477 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 12:19:19,478 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=310, Invalid=3596, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 12:19:19,478 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:19,478 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 149 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-15 12:19:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 12:19:19,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-15 12:19:19,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:19,613 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:19:19,613 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:19:19,613 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:19:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:19,614 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2022-04-15 12:19:19,614 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-15 12:19:19,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:19,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:19,614 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:19:19,615 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:19:19,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:19,615 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2022-04-15 12:19:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-15 12:19:19,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:19,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:19,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:19,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:19,616 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:19:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2022-04-15 12:19:19,616 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 65 [2022-04-15 12:19:19,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:19,616 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2022-04-15 12:19:19,617 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:19:19,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 71 transitions. [2022-04-15 12:19:20,112 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:19:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-15 12:19:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 12:19:20,113 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:20,113 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:20,137 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:19:20,314 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:19:20,314 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:20,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:20,315 INFO L85 PathProgramCache]: Analyzing trace with hash -678172532, now seen corresponding path program 53 times [2022-04-15 12:19:20,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:20,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1035784537] [2022-04-15 12:19:20,486 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:19:20,488 INFO L85 PathProgramCache]: Analyzing trace with hash 292668785, now seen corresponding path program 1 times [2022-04-15 12:19:20,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:20,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246407198] [2022-04-15 12:19:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:20,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:20,495 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:19:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:20,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:19:20,499 INFO L85 PathProgramCache]: Analyzing trace with hash -678172532, now seen corresponding path program 54 times [2022-04-15 12:19:20,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:20,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695010304] [2022-04-15 12:19:20,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:20,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:21,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:21,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {15394#(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(13, 2);call #Ultimate.allocInit(12, 3); {15361#true} is VALID [2022-04-15 12:19:21,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {15361#true} assume true; {15361#true} is VALID [2022-04-15 12:19:21,157 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15361#true} {15361#true} #40#return; {15361#true} is VALID [2022-04-15 12:19:21,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {15361#true} call ULTIMATE.init(); {15394#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:21,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {15394#(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(13, 2);call #Ultimate.allocInit(12, 3); {15361#true} is VALID [2022-04-15 12:19:21,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {15361#true} assume true; {15361#true} is VALID [2022-04-15 12:19:21,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15361#true} {15361#true} #40#return; {15361#true} is VALID [2022-04-15 12:19:21,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {15361#true} call #t~ret5 := main(); {15361#true} is VALID [2022-04-15 12:19:21,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {15361#true} ~x~0 := 0; {15366#(= main_~x~0 0)} is VALID [2022-04-15 12:19:21,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {15366#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {15366#(= main_~x~0 0)} is VALID [2022-04-15 12:19:21,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {15366#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15367#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:21,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {15367#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {15367#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:21,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {15367#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15368#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:21,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {15368#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {15368#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:21,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {15368#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15369#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:21,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {15369#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15369#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:21,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {15369#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15370#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:21,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {15370#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15370#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:21,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {15370#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15371#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:21,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {15371#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {15371#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:21,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {15371#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15372#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:21,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {15372#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {15372#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:21,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {15372#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15373#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:21,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {15373#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15373#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:21,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {15373#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15374#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:21,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {15374#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15374#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:21,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {15374#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15375#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:21,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {15375#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15375#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:21,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {15375#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15376#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:21,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {15376#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15376#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:21,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {15376#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15377#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:21,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {15377#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15377#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:21,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {15377#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15378#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:21,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {15378#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15378#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:21,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {15378#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15379#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:21,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {15379#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15379#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:21,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {15379#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15380#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:21,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {15380#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {15380#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:21,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {15380#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15381#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:21,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {15381#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {15381#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:21,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {15381#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15382#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:21,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {15382#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15382#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:21,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {15382#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15383#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:21,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {15383#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {15383#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:21,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {15383#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15384#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:21,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {15384#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15384#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:21,339 INFO L290 TraceCheckUtils]: 43: Hoare triple {15384#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15385#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:21,340 INFO L290 TraceCheckUtils]: 44: Hoare triple {15385#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {15385#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:21,351 INFO L290 TraceCheckUtils]: 45: Hoare triple {15385#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15386#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:21,352 INFO L290 TraceCheckUtils]: 46: Hoare triple {15386#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15386#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:21,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {15386#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15387#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:21,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {15387#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {15387#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:21,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {15387#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15388#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:21,382 INFO L290 TraceCheckUtils]: 50: Hoare triple {15388#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {15388#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:21,396 INFO L290 TraceCheckUtils]: 51: Hoare triple {15388#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15389#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:21,397 INFO L290 TraceCheckUtils]: 52: Hoare triple {15389#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {15389#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:21,409 INFO L290 TraceCheckUtils]: 53: Hoare triple {15389#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15390#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:21,410 INFO L290 TraceCheckUtils]: 54: Hoare triple {15390#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15390#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:21,422 INFO L290 TraceCheckUtils]: 55: Hoare triple {15390#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15391#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:21,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {15391#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15391#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:21,436 INFO L290 TraceCheckUtils]: 57: Hoare triple {15391#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15392#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:21,436 INFO L290 TraceCheckUtils]: 58: Hoare triple {15392#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15392#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:21,439 INFO L290 TraceCheckUtils]: 59: Hoare triple {15392#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15393#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 27))} is VALID [2022-04-15 12:19:21,440 INFO L290 TraceCheckUtils]: 60: Hoare triple {15393#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {15393#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 27))} is VALID [2022-04-15 12:19:21,441 INFO L290 TraceCheckUtils]: 61: Hoare triple {15393#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 27))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {15362#false} is VALID [2022-04-15 12:19:21,441 INFO L290 TraceCheckUtils]: 62: Hoare triple {15362#false} assume !(~x~0 % 4294967296 < 268435455); {15362#false} is VALID [2022-04-15 12:19:21,441 INFO L272 TraceCheckUtils]: 63: Hoare triple {15362#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15362#false} is VALID [2022-04-15 12:19:21,441 INFO L290 TraceCheckUtils]: 64: Hoare triple {15362#false} ~cond := #in~cond; {15362#false} is VALID [2022-04-15 12:19:21,441 INFO L290 TraceCheckUtils]: 65: Hoare triple {15362#false} assume 0 == ~cond; {15362#false} is VALID [2022-04-15 12:19:21,442 INFO L290 TraceCheckUtils]: 66: Hoare triple {15362#false} assume !false; {15362#false} is VALID [2022-04-15 12:19:21,442 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:19:21,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:21,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695010304] [2022-04-15 12:19:21,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695010304] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:21,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597476746] [2022-04-15 12:19:21,443 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:19:21,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:21,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:21,448 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:19:21,449 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:19:21,508 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:19:21,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:21,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:19:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:21,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:21,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {15361#true} call ULTIMATE.init(); {15361#true} is VALID [2022-04-15 12:19:21,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {15361#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(13, 2);call #Ultimate.allocInit(12, 3); {15361#true} is VALID [2022-04-15 12:19:21,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {15361#true} assume true; {15361#true} is VALID [2022-04-15 12:19:21,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15361#true} {15361#true} #40#return; {15361#true} is VALID [2022-04-15 12:19:21,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {15361#true} call #t~ret5 := main(); {15361#true} is VALID [2022-04-15 12:19:21,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {15361#true} ~x~0 := 0; {15361#true} is VALID [2022-04-15 12:19:21,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,972 INFO L290 TraceCheckUtils]: 41: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,972 INFO L290 TraceCheckUtils]: 42: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,972 INFO L290 TraceCheckUtils]: 43: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,972 INFO L290 TraceCheckUtils]: 44: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,972 INFO L290 TraceCheckUtils]: 45: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,972 INFO L290 TraceCheckUtils]: 46: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,972 INFO L290 TraceCheckUtils]: 47: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,972 INFO L290 TraceCheckUtils]: 48: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,972 INFO L290 TraceCheckUtils]: 49: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,973 INFO L290 TraceCheckUtils]: 50: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,973 INFO L290 TraceCheckUtils]: 51: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,973 INFO L290 TraceCheckUtils]: 54: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,973 INFO L290 TraceCheckUtils]: 55: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,973 INFO L290 TraceCheckUtils]: 56: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,973 INFO L290 TraceCheckUtils]: 57: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:21,973 INFO L290 TraceCheckUtils]: 58: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:21,986 INFO L290 TraceCheckUtils]: 59: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15575#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:19:21,987 INFO L290 TraceCheckUtils]: 60: Hoare triple {15575#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {15575#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:19:21,991 INFO L290 TraceCheckUtils]: 61: Hoare triple {15575#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {15582#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} is VALID [2022-04-15 12:19:21,993 INFO L290 TraceCheckUtils]: 62: Hoare triple {15582#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 268435455); {15362#false} is VALID [2022-04-15 12:19:21,993 INFO L272 TraceCheckUtils]: 63: Hoare triple {15362#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15362#false} is VALID [2022-04-15 12:19:21,993 INFO L290 TraceCheckUtils]: 64: Hoare triple {15362#false} ~cond := #in~cond; {15362#false} is VALID [2022-04-15 12:19:21,993 INFO L290 TraceCheckUtils]: 65: Hoare triple {15362#false} assume 0 == ~cond; {15362#false} is VALID [2022-04-15 12:19:21,993 INFO L290 TraceCheckUtils]: 66: Hoare triple {15362#false} assume !false; {15362#false} is VALID [2022-04-15 12:19:21,993 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:19:21,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:22,523 INFO L290 TraceCheckUtils]: 66: Hoare triple {15362#false} assume !false; {15362#false} is VALID [2022-04-15 12:19:22,524 INFO L290 TraceCheckUtils]: 65: Hoare triple {15362#false} assume 0 == ~cond; {15362#false} is VALID [2022-04-15 12:19:22,524 INFO L290 TraceCheckUtils]: 64: Hoare triple {15362#false} ~cond := #in~cond; {15362#false} is VALID [2022-04-15 12:19:22,524 INFO L272 TraceCheckUtils]: 63: Hoare triple {15362#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15362#false} is VALID [2022-04-15 12:19:22,524 INFO L290 TraceCheckUtils]: 62: Hoare triple {15610#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {15362#false} is VALID [2022-04-15 12:19:22,527 INFO L290 TraceCheckUtils]: 61: Hoare triple {15614#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {15610#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:19:22,528 INFO L290 TraceCheckUtils]: 60: Hoare triple {15614#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {15614#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:19:22,543 INFO L290 TraceCheckUtils]: 59: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15614#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:19:22,544 INFO L290 TraceCheckUtils]: 58: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,544 INFO L290 TraceCheckUtils]: 57: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,544 INFO L290 TraceCheckUtils]: 56: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,544 INFO L290 TraceCheckUtils]: 55: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,544 INFO L290 TraceCheckUtils]: 54: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,544 INFO L290 TraceCheckUtils]: 53: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,544 INFO L290 TraceCheckUtils]: 52: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,544 INFO L290 TraceCheckUtils]: 51: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,544 INFO L290 TraceCheckUtils]: 50: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,544 INFO L290 TraceCheckUtils]: 48: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,544 INFO L290 TraceCheckUtils]: 47: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,544 INFO L290 TraceCheckUtils]: 46: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,544 INFO L290 TraceCheckUtils]: 45: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,545 INFO L290 TraceCheckUtils]: 41: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,545 INFO L290 TraceCheckUtils]: 40: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,545 INFO L290 TraceCheckUtils]: 39: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {15361#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15361#true} is VALID [2022-04-15 12:19:22,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {15361#true} assume !!(~x~0 % 4294967296 < 268435455); {15361#true} is VALID [2022-04-15 12:19:22,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {15361#true} ~x~0 := 0; {15361#true} is VALID [2022-04-15 12:19:22,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {15361#true} call #t~ret5 := main(); {15361#true} is VALID [2022-04-15 12:19:22,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15361#true} {15361#true} #40#return; {15361#true} is VALID [2022-04-15 12:19:22,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {15361#true} assume true; {15361#true} is VALID [2022-04-15 12:19:22,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {15361#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(13, 2);call #Ultimate.allocInit(12, 3); {15361#true} is VALID [2022-04-15 12:19:22,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {15361#true} call ULTIMATE.init(); {15361#true} is VALID [2022-04-15 12:19:22,548 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:19:22,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597476746] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:22,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:22,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 4, 4] total 35 [2022-04-15 12:19:22,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:22,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1035784537] [2022-04-15 12:19:22,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1035784537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:22,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:22,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 12:19:22,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786507405] [2022-04-15 12:19:22,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:22,549 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:19:22,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:22,550 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:19:23,229 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:19:23,229 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 12:19:23,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:23,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 12:19:23,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 12:19:23,230 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:19:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:41,533 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-04-15 12:19:41,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:19:41,533 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:19:41,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:41,534 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:19:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 79 transitions. [2022-04-15 12:19:41,534 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:19:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 79 transitions. [2022-04-15 12:19:41,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 79 transitions. [2022-04-15 12:19:42,061 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:19:42,062 INFO L225 Difference]: With dead ends: 78 [2022-04-15 12:19:42,062 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 12:19:42,063 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=476, Invalid=3430, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 12:19:42,064 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:42,064 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 139 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-04-15 12:19:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 12:19:42,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-15 12:19:42,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:42,215 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:19:42,215 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:19:42,215 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:19:42,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:42,216 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-15 12:19:42,216 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-15 12:19:42,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:42,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:42,217 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:19:42,217 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:19:42,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:42,217 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-15 12:19:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-15 12:19:42,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:42,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:42,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:42,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:42,218 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:19:42,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2022-04-15 12:19:42,218 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 67 [2022-04-15 12:19:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:42,219 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2022-04-15 12:19:42,219 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:19:42,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 73 transitions. [2022-04-15 12:19:42,654 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:19:42,654 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-15 12:19:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 12:19:42,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:42,654 INFO L499 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:42,670 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:19:42,854 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:19:42,855 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:42,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:42,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1241804503, now seen corresponding path program 55 times [2022-04-15 12:19:42,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:42,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1921887221] [2022-04-15 12:19:43,041 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:19:43,043 INFO L85 PathProgramCache]: Analyzing trace with hash 351774129, now seen corresponding path program 1 times [2022-04-15 12:19:43,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:43,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681346592] [2022-04-15 12:19:43,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:43,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:43,049 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:19:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:43,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:19:43,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1241804503, now seen corresponding path program 56 times [2022-04-15 12:19:43,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:43,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542327978] [2022-04-15 12:19:43,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:43,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:43,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:43,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {16330#(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(13, 2);call #Ultimate.allocInit(12, 3); {16296#true} is VALID [2022-04-15 12:19:43,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {16296#true} assume true; {16296#true} is VALID [2022-04-15 12:19:43,645 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16296#true} {16296#true} #40#return; {16296#true} is VALID [2022-04-15 12:19:43,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {16296#true} call ULTIMATE.init(); {16330#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:43,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {16330#(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(13, 2);call #Ultimate.allocInit(12, 3); {16296#true} is VALID [2022-04-15 12:19:43,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {16296#true} assume true; {16296#true} is VALID [2022-04-15 12:19:43,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16296#true} {16296#true} #40#return; {16296#true} is VALID [2022-04-15 12:19:43,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {16296#true} call #t~ret5 := main(); {16296#true} is VALID [2022-04-15 12:19:43,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {16296#true} ~x~0 := 0; {16301#(= main_~x~0 0)} is VALID [2022-04-15 12:19:43,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {16301#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {16301#(= main_~x~0 0)} is VALID [2022-04-15 12:19:43,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {16301#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16302#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:43,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {16302#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {16302#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:43,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {16302#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:43,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {16303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {16303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:43,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {16303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16304#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:43,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {16304#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16304#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:43,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {16304#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16305#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:43,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {16305#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16305#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:43,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {16305#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16306#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:43,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {16306#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {16306#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:43,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {16306#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16307#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:43,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {16307#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {16307#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:43,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {16307#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16308#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:43,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {16308#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16308#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:43,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {16308#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16309#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:43,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {16309#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16309#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:43,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {16309#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16310#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:43,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {16310#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16310#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:43,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {16310#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16311#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:43,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {16311#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16311#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:43,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {16311#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16312#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:43,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {16312#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16312#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:43,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {16312#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16313#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:43,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {16313#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16313#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:43,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {16313#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16314#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:43,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {16314#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16314#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:43,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {16314#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16315#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:43,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {16315#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {16315#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:43,805 INFO L290 TraceCheckUtils]: 35: Hoare triple {16315#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16316#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:43,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {16316#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {16316#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:43,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {16316#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16317#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:43,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {16317#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16317#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:43,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {16317#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16318#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:43,831 INFO L290 TraceCheckUtils]: 40: Hoare triple {16318#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {16318#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:43,833 INFO L290 TraceCheckUtils]: 41: Hoare triple {16318#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16319#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:43,833 INFO L290 TraceCheckUtils]: 42: Hoare triple {16319#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16319#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:43,835 INFO L290 TraceCheckUtils]: 43: Hoare triple {16319#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16320#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:43,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {16320#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {16320#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:43,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {16320#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16321#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:43,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {16321#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16321#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:43,866 INFO L290 TraceCheckUtils]: 47: Hoare triple {16321#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16322#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:43,867 INFO L290 TraceCheckUtils]: 48: Hoare triple {16322#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {16322#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:43,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {16322#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16323#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:43,883 INFO L290 TraceCheckUtils]: 50: Hoare triple {16323#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {16323#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:43,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {16323#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16324#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:43,899 INFO L290 TraceCheckUtils]: 52: Hoare triple {16324#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {16324#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:43,915 INFO L290 TraceCheckUtils]: 53: Hoare triple {16324#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16325#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:43,915 INFO L290 TraceCheckUtils]: 54: Hoare triple {16325#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16325#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:43,930 INFO L290 TraceCheckUtils]: 55: Hoare triple {16325#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16326#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:43,931 INFO L290 TraceCheckUtils]: 56: Hoare triple {16326#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16326#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:43,946 INFO L290 TraceCheckUtils]: 57: Hoare triple {16326#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16327#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:43,947 INFO L290 TraceCheckUtils]: 58: Hoare triple {16327#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16327#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:43,950 INFO L290 TraceCheckUtils]: 59: Hoare triple {16327#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16328#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:19:43,950 INFO L290 TraceCheckUtils]: 60: Hoare triple {16328#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {16328#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:19:43,952 INFO L290 TraceCheckUtils]: 61: Hoare triple {16328#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16329#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} is VALID [2022-04-15 12:19:43,952 INFO L290 TraceCheckUtils]: 62: Hoare triple {16329#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {16329#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} is VALID [2022-04-15 12:19:43,955 INFO L290 TraceCheckUtils]: 63: Hoare triple {16329#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {16297#false} is VALID [2022-04-15 12:19:43,956 INFO L290 TraceCheckUtils]: 64: Hoare triple {16297#false} assume !(~x~0 % 4294967296 < 268435455); {16297#false} is VALID [2022-04-15 12:19:43,956 INFO L272 TraceCheckUtils]: 65: Hoare triple {16297#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16297#false} is VALID [2022-04-15 12:19:43,956 INFO L290 TraceCheckUtils]: 66: Hoare triple {16297#false} ~cond := #in~cond; {16297#false} is VALID [2022-04-15 12:19:43,956 INFO L290 TraceCheckUtils]: 67: Hoare triple {16297#false} assume 0 == ~cond; {16297#false} is VALID [2022-04-15 12:19:43,956 INFO L290 TraceCheckUtils]: 68: Hoare triple {16297#false} assume !false; {16297#false} is VALID [2022-04-15 12:19:43,956 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:19:43,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:43,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542327978] [2022-04-15 12:19:43,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542327978] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:43,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568255065] [2022-04-15 12:19:43,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:19:43,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:43,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:43,958 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:19:43,959 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:19:44,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:19:44,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:44,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-15 12:19:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:44,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:44,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {16296#true} call ULTIMATE.init(); {16296#true} is VALID [2022-04-15 12:19:44,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {16296#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(13, 2);call #Ultimate.allocInit(12, 3); {16296#true} is VALID [2022-04-15 12:19:44,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {16296#true} assume true; {16296#true} is VALID [2022-04-15 12:19:44,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16296#true} {16296#true} #40#return; {16296#true} is VALID [2022-04-15 12:19:44,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {16296#true} call #t~ret5 := main(); {16296#true} is VALID [2022-04-15 12:19:44,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {16296#true} ~x~0 := 0; {16301#(= main_~x~0 0)} is VALID [2022-04-15 12:19:44,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {16301#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {16301#(= main_~x~0 0)} is VALID [2022-04-15 12:19:44,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {16301#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16302#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:44,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {16302#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {16302#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:44,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {16302#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:44,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {16303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {16303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:44,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {16303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16304#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:44,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {16304#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16304#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:44,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {16304#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16305#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:44,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {16305#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16305#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:44,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {16305#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16306#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:44,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {16306#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {16306#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:44,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {16306#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16307#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:44,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {16307#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {16307#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:44,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {16307#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16308#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:44,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {16308#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16308#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:44,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {16308#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16309#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:44,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {16309#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16309#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:44,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {16309#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16310#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:44,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {16310#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16310#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:44,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {16310#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16311#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:44,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {16311#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16311#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:44,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {16311#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16312#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:44,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {16312#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16312#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:44,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {16312#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16313#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:44,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {16313#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16313#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:44,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {16313#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16314#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:44,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {16314#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16314#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:44,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {16314#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16315#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:44,782 INFO L290 TraceCheckUtils]: 34: Hoare triple {16315#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {16315#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:44,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {16315#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16316#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:44,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {16316#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {16316#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:44,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {16316#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16317#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:44,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {16317#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16317#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:44,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {16317#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16318#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:44,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {16318#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {16318#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:44,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {16318#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16319#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:44,827 INFO L290 TraceCheckUtils]: 42: Hoare triple {16319#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16319#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:44,829 INFO L290 TraceCheckUtils]: 43: Hoare triple {16319#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16320#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:44,829 INFO L290 TraceCheckUtils]: 44: Hoare triple {16320#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {16320#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:44,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {16320#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16321#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:44,844 INFO L290 TraceCheckUtils]: 46: Hoare triple {16321#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16321#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:44,857 INFO L290 TraceCheckUtils]: 47: Hoare triple {16321#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16322#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:44,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {16322#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {16322#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:44,867 INFO L290 TraceCheckUtils]: 49: Hoare triple {16322#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16323#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:44,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {16323#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {16323#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:44,876 INFO L290 TraceCheckUtils]: 51: Hoare triple {16323#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16324#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:44,877 INFO L290 TraceCheckUtils]: 52: Hoare triple {16324#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {16324#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:44,884 INFO L290 TraceCheckUtils]: 53: Hoare triple {16324#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16325#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:44,885 INFO L290 TraceCheckUtils]: 54: Hoare triple {16325#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16325#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:44,890 INFO L290 TraceCheckUtils]: 55: Hoare triple {16325#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16326#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:44,890 INFO L290 TraceCheckUtils]: 56: Hoare triple {16326#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16326#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:44,900 INFO L290 TraceCheckUtils]: 57: Hoare triple {16326#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16327#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:44,900 INFO L290 TraceCheckUtils]: 58: Hoare triple {16327#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16327#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:44,903 INFO L290 TraceCheckUtils]: 59: Hoare triple {16327#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16328#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:19:44,903 INFO L290 TraceCheckUtils]: 60: Hoare triple {16328#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {16328#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:19:44,906 INFO L290 TraceCheckUtils]: 61: Hoare triple {16328#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16517#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:19:44,906 INFO L290 TraceCheckUtils]: 62: Hoare triple {16517#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {16517#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:19:44,907 INFO L290 TraceCheckUtils]: 63: Hoare triple {16517#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {16524#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:19:44,908 INFO L290 TraceCheckUtils]: 64: Hoare triple {16524#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(~x~0 % 4294967296 < 268435455); {16524#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:19:44,909 INFO L272 TraceCheckUtils]: 65: Hoare triple {16524#(and (<= 30 main_~x~0) (<= main_~x~0 30))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16531#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:44,909 INFO L290 TraceCheckUtils]: 66: Hoare triple {16531#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16535#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:44,909 INFO L290 TraceCheckUtils]: 67: Hoare triple {16535#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16297#false} is VALID [2022-04-15 12:19:44,909 INFO L290 TraceCheckUtils]: 68: Hoare triple {16297#false} assume !false; {16297#false} is VALID [2022-04-15 12:19:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:44,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:45,223 INFO L290 TraceCheckUtils]: 68: Hoare triple {16297#false} assume !false; {16297#false} is VALID [2022-04-15 12:19:45,223 INFO L290 TraceCheckUtils]: 67: Hoare triple {16535#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16297#false} is VALID [2022-04-15 12:19:45,224 INFO L290 TraceCheckUtils]: 66: Hoare triple {16531#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16535#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:45,224 INFO L272 TraceCheckUtils]: 65: Hoare triple {16551#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16531#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:45,224 INFO L290 TraceCheckUtils]: 64: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,225 INFO L290 TraceCheckUtils]: 63: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,225 INFO L290 TraceCheckUtils]: 62: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,239 INFO L290 TraceCheckUtils]: 61: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,241 INFO L290 TraceCheckUtils]: 59: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,241 INFO L290 TraceCheckUtils]: 58: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,261 INFO L290 TraceCheckUtils]: 57: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,261 INFO L290 TraceCheckUtils]: 56: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,263 INFO L290 TraceCheckUtils]: 55: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,263 INFO L290 TraceCheckUtils]: 54: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,280 INFO L290 TraceCheckUtils]: 53: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,280 INFO L290 TraceCheckUtils]: 52: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,282 INFO L290 TraceCheckUtils]: 51: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,282 INFO L290 TraceCheckUtils]: 50: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,298 INFO L290 TraceCheckUtils]: 49: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,298 INFO L290 TraceCheckUtils]: 48: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,300 INFO L290 TraceCheckUtils]: 47: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,313 INFO L290 TraceCheckUtils]: 45: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,313 INFO L290 TraceCheckUtils]: 44: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,315 INFO L290 TraceCheckUtils]: 42: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,325 INFO L290 TraceCheckUtils]: 41: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,326 INFO L290 TraceCheckUtils]: 40: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,336 INFO L290 TraceCheckUtils]: 36: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {16564#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16564#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:45,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {16551#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {16296#true} ~x~0 := 0; {16551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {16296#true} call #t~ret5 := main(); {16296#true} is VALID [2022-04-15 12:19:45,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16296#true} {16296#true} #40#return; {16296#true} is VALID [2022-04-15 12:19:45,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {16296#true} assume true; {16296#true} is VALID [2022-04-15 12:19:45,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {16296#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(13, 2);call #Ultimate.allocInit(12, 3); {16296#true} is VALID [2022-04-15 12:19:45,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {16296#true} call ULTIMATE.init(); {16296#true} is VALID [2022-04-15 12:19:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 434 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2022-04-15 12:19:45,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568255065] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:45,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:45,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34, 6] total 38 [2022-04-15 12:19:45,400 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:45,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1921887221] [2022-04-15 12:19:45,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1921887221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:45,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:45,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:19:45,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812812260] [2022-04-15 12:19:45,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:45,401 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:19:45,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:45,401 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:19:45,777 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:19:45,778 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:19:45,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:45,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:19:45,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1274, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:19:45,778 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:20:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:11,005 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-04-15 12:20:11,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 12:20:11,005 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:20:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:11,005 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:20:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 81 transitions. [2022-04-15 12:20:11,006 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:20:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 81 transitions. [2022-04-15 12:20:11,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 81 transitions. [2022-04-15 12:20:11,662 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:20:11,663 INFO L225 Difference]: With dead ends: 80 [2022-04-15 12:20:11,663 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 12:20:11,664 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 132 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=332, Invalid=4090, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 12:20:11,664 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:11,664 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 134 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2022-04-15 12:20:11,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 12:20:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-15 12:20:11,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:11,805 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:20:11,806 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:20:11,806 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:20:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:11,807 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-04-15 12:20:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-04-15 12:20:11,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:11,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:11,807 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:20:11,807 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:20:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:11,808 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-04-15 12:20:11,808 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-04-15 12:20:11,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:11,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:11,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:11,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:11,808 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:20:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2022-04-15 12:20:11,809 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2022-04-15 12:20:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:11,809 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2022-04-15 12:20:11,809 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:20:11,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 75 transitions. [2022-04-15 12:20:12,334 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:20:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-04-15 12:20:12,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 12:20:12,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:12,334 INFO L499 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:12,350 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:20:12,542 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:20:12,543 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:12,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:12,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1726249338, now seen corresponding path program 57 times [2022-04-15 12:20:12,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:12,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1945692250] [2022-04-15 12:20:12,712 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:20:12,714 INFO L85 PathProgramCache]: Analyzing trace with hash 410879473, now seen corresponding path program 1 times [2022-04-15 12:20:12,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:12,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383679289] [2022-04-15 12:20:12,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:12,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:20:12,727 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:20:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:20:12,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:20:12,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1726249338, now seen corresponding path program 58 times [2022-04-15 12:20:12,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:12,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177803885] [2022-04-15 12:20:12,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:12,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:13,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:13,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {17295#(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(13, 2);call #Ultimate.allocInit(12, 3); {17260#true} is VALID [2022-04-15 12:20:13,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {17260#true} assume true; {17260#true} is VALID [2022-04-15 12:20:13,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17260#true} {17260#true} #40#return; {17260#true} is VALID [2022-04-15 12:20:13,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {17260#true} call ULTIMATE.init(); {17295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:13,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {17295#(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(13, 2);call #Ultimate.allocInit(12, 3); {17260#true} is VALID [2022-04-15 12:20:13,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {17260#true} assume true; {17260#true} is VALID [2022-04-15 12:20:13,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17260#true} {17260#true} #40#return; {17260#true} is VALID [2022-04-15 12:20:13,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {17260#true} call #t~ret5 := main(); {17260#true} is VALID [2022-04-15 12:20:13,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {17260#true} ~x~0 := 0; {17265#(= main_~x~0 0)} is VALID [2022-04-15 12:20:13,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {17265#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {17265#(= main_~x~0 0)} is VALID [2022-04-15 12:20:13,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {17265#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17266#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:20:13,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {17266#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {17266#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:20:13,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {17266#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17267#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:13,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {17267#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {17267#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:13,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {17267#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17268#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:20:13,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {17268#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17268#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:20:13,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {17268#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17269#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:13,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {17269#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17269#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:13,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {17269#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17270#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:20:13,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {17270#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {17270#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:20:13,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {17270#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17271#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:13,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {17271#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {17271#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:13,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {17271#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17272#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:20:13,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {17272#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17272#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:20:13,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {17272#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17273#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:13,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {17273#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17273#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:13,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {17273#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17274#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:20:13,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {17274#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17274#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:20:13,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {17274#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17275#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:13,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {17275#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17275#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:13,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {17275#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17276#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:20:13,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {17276#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17276#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:20:13,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {17276#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17277#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:13,463 INFO L290 TraceCheckUtils]: 30: Hoare triple {17277#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17277#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:13,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {17277#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17278#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:20:13,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {17278#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17278#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:20:13,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {17278#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17279#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:13,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {17279#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {17279#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:13,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {17279#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17280#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:20:13,480 INFO L290 TraceCheckUtils]: 36: Hoare triple {17280#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {17280#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:20:13,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {17280#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17281#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:13,491 INFO L290 TraceCheckUtils]: 38: Hoare triple {17281#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17281#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:13,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {17281#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17282#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:20:13,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {17282#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {17282#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:20:13,508 INFO L290 TraceCheckUtils]: 41: Hoare triple {17282#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17283#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:13,509 INFO L290 TraceCheckUtils]: 42: Hoare triple {17283#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17283#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:13,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {17283#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17284#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:20:13,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {17284#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {17284#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:20:13,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {17284#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17285#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:13,522 INFO L290 TraceCheckUtils]: 46: Hoare triple {17285#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17285#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:13,533 INFO L290 TraceCheckUtils]: 47: Hoare triple {17285#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17286#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:20:13,533 INFO L290 TraceCheckUtils]: 48: Hoare triple {17286#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {17286#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:20:13,547 INFO L290 TraceCheckUtils]: 49: Hoare triple {17286#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17287#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:13,547 INFO L290 TraceCheckUtils]: 50: Hoare triple {17287#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {17287#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:13,557 INFO L290 TraceCheckUtils]: 51: Hoare triple {17287#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17288#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:20:13,558 INFO L290 TraceCheckUtils]: 52: Hoare triple {17288#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {17288#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:20:13,568 INFO L290 TraceCheckUtils]: 53: Hoare triple {17288#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17289#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:13,569 INFO L290 TraceCheckUtils]: 54: Hoare triple {17289#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17289#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:13,581 INFO L290 TraceCheckUtils]: 55: Hoare triple {17289#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17290#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:20:13,582 INFO L290 TraceCheckUtils]: 56: Hoare triple {17290#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17290#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:20:13,595 INFO L290 TraceCheckUtils]: 57: Hoare triple {17290#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17291#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:13,596 INFO L290 TraceCheckUtils]: 58: Hoare triple {17291#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17291#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:13,599 INFO L290 TraceCheckUtils]: 59: Hoare triple {17291#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17292#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:20:13,599 INFO L290 TraceCheckUtils]: 60: Hoare triple {17292#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {17292#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:20:13,602 INFO L290 TraceCheckUtils]: 61: Hoare triple {17292#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17293#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:13,602 INFO L290 TraceCheckUtils]: 62: Hoare triple {17293#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {17293#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:13,615 INFO L290 TraceCheckUtils]: 63: Hoare triple {17293#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17294#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:20:13,615 INFO L290 TraceCheckUtils]: 64: Hoare triple {17294#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {17294#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:20:13,618 INFO L290 TraceCheckUtils]: 65: Hoare triple {17294#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {17261#false} is VALID [2022-04-15 12:20:13,618 INFO L290 TraceCheckUtils]: 66: Hoare triple {17261#false} assume !(~x~0 % 4294967296 < 268435455); {17261#false} is VALID [2022-04-15 12:20:13,618 INFO L272 TraceCheckUtils]: 67: Hoare triple {17261#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17261#false} is VALID [2022-04-15 12:20:13,618 INFO L290 TraceCheckUtils]: 68: Hoare triple {17261#false} ~cond := #in~cond; {17261#false} is VALID [2022-04-15 12:20:13,618 INFO L290 TraceCheckUtils]: 69: Hoare triple {17261#false} assume 0 == ~cond; {17261#false} is VALID [2022-04-15 12:20:13,618 INFO L290 TraceCheckUtils]: 70: Hoare triple {17261#false} assume !false; {17261#false} is VALID [2022-04-15 12:20:13,619 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:20:13,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:13,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177803885] [2022-04-15 12:20:13,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177803885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:20:13,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577232054] [2022-04-15 12:20:13,619 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:20:13,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:13,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:20:13,620 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:20:13,621 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:20:13,693 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:20:13,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:20:13,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-15 12:20:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:13,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:20:14,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {17260#true} call ULTIMATE.init(); {17260#true} is VALID [2022-04-15 12:20:14,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {17260#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(13, 2);call #Ultimate.allocInit(12, 3); {17260#true} is VALID [2022-04-15 12:20:14,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {17260#true} assume true; {17260#true} is VALID [2022-04-15 12:20:14,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17260#true} {17260#true} #40#return; {17260#true} is VALID [2022-04-15 12:20:14,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {17260#true} call #t~ret5 := main(); {17260#true} is VALID [2022-04-15 12:20:14,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {17260#true} ~x~0 := 0; {17265#(= main_~x~0 0)} is VALID [2022-04-15 12:20:14,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {17265#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {17265#(= main_~x~0 0)} is VALID [2022-04-15 12:20:14,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {17265#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17266#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:20:14,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {17266#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {17266#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:20:14,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {17266#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17267#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:14,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {17267#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {17267#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:14,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {17267#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17268#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:20:14,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {17268#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17268#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:20:14,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {17268#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17269#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:14,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {17269#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17269#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:14,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {17269#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17270#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:20:14,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {17270#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {17270#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:20:14,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {17270#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17271#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:14,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {17271#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {17271#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:14,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {17271#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17272#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:20:14,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {17272#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17272#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:20:14,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {17272#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17273#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:14,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {17273#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17273#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:14,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {17273#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17274#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:20:14,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {17274#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17274#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:20:14,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {17274#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17275#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:14,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {17275#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17275#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:14,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {17275#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17276#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:20:14,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {17276#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17276#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:20:14,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {17276#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17277#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:14,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {17277#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17277#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:14,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {17277#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17278#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:20:14,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {17278#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17278#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:20:14,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {17278#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17279#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:14,347 INFO L290 TraceCheckUtils]: 34: Hoare triple {17279#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {17279#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:14,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {17279#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17280#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:20:14,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {17280#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {17280#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:20:14,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {17280#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17281#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:14,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {17281#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17281#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:14,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {17281#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17282#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:20:14,365 INFO L290 TraceCheckUtils]: 40: Hoare triple {17282#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {17282#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:20:14,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {17282#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17283#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:14,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {17283#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17283#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:14,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {17283#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17284#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:20:14,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {17284#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {17284#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:20:14,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {17284#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17285#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:14,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {17285#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17285#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:14,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {17285#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17286#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:20:14,380 INFO L290 TraceCheckUtils]: 48: Hoare triple {17286#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {17286#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:20:14,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {17286#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17287#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:14,384 INFO L290 TraceCheckUtils]: 50: Hoare triple {17287#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {17287#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:14,388 INFO L290 TraceCheckUtils]: 51: Hoare triple {17287#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17288#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:20:14,388 INFO L290 TraceCheckUtils]: 52: Hoare triple {17288#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {17288#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:20:14,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {17288#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17289#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:14,393 INFO L290 TraceCheckUtils]: 54: Hoare triple {17289#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17289#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:14,397 INFO L290 TraceCheckUtils]: 55: Hoare triple {17289#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17290#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:20:14,397 INFO L290 TraceCheckUtils]: 56: Hoare triple {17290#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17290#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:20:14,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {17290#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17291#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:14,402 INFO L290 TraceCheckUtils]: 58: Hoare triple {17291#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17291#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:14,404 INFO L290 TraceCheckUtils]: 59: Hoare triple {17291#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17292#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:20:14,404 INFO L290 TraceCheckUtils]: 60: Hoare triple {17292#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {17292#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:20:14,407 INFO L290 TraceCheckUtils]: 61: Hoare triple {17292#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17293#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:14,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {17293#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {17293#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:14,417 INFO L290 TraceCheckUtils]: 63: Hoare triple {17293#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17488#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:20:14,418 INFO L290 TraceCheckUtils]: 64: Hoare triple {17488#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17488#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:20:14,419 INFO L290 TraceCheckUtils]: 65: Hoare triple {17488#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {17495#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:20:14,422 INFO L290 TraceCheckUtils]: 66: Hoare triple {17495#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !(~x~0 % 4294967296 < 268435455); {17261#false} is VALID [2022-04-15 12:20:14,422 INFO L272 TraceCheckUtils]: 67: Hoare triple {17261#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17261#false} is VALID [2022-04-15 12:20:14,422 INFO L290 TraceCheckUtils]: 68: Hoare triple {17261#false} ~cond := #in~cond; {17261#false} is VALID [2022-04-15 12:20:14,422 INFO L290 TraceCheckUtils]: 69: Hoare triple {17261#false} assume 0 == ~cond; {17261#false} is VALID [2022-04-15 12:20:14,422 INFO L290 TraceCheckUtils]: 70: Hoare triple {17261#false} assume !false; {17261#false} is VALID [2022-04-15 12:20:14,422 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:20:14,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:18,532 INFO L290 TraceCheckUtils]: 70: Hoare triple {17261#false} assume !false; {17261#false} is VALID [2022-04-15 12:20:18,532 INFO L290 TraceCheckUtils]: 69: Hoare triple {17261#false} assume 0 == ~cond; {17261#false} is VALID [2022-04-15 12:20:18,532 INFO L290 TraceCheckUtils]: 68: Hoare triple {17261#false} ~cond := #in~cond; {17261#false} is VALID [2022-04-15 12:20:18,532 INFO L272 TraceCheckUtils]: 67: Hoare triple {17261#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17261#false} is VALID [2022-04-15 12:20:18,533 INFO L290 TraceCheckUtils]: 66: Hoare triple {17523#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {17261#false} is VALID [2022-04-15 12:20:18,536 INFO L290 TraceCheckUtils]: 65: Hoare triple {17527#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {17523#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,537 INFO L290 TraceCheckUtils]: 64: Hoare triple {17527#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17527#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,549 INFO L290 TraceCheckUtils]: 63: Hoare triple {17534#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17527#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,550 INFO L290 TraceCheckUtils]: 62: Hoare triple {17534#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17534#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,560 INFO L290 TraceCheckUtils]: 61: Hoare triple {17541#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17534#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,560 INFO L290 TraceCheckUtils]: 60: Hoare triple {17541#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17541#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,564 INFO L290 TraceCheckUtils]: 59: Hoare triple {17548#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17541#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,564 INFO L290 TraceCheckUtils]: 58: Hoare triple {17548#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17548#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,566 INFO L290 TraceCheckUtils]: 57: Hoare triple {17555#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17548#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,566 INFO L290 TraceCheckUtils]: 56: Hoare triple {17555#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17555#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,577 INFO L290 TraceCheckUtils]: 55: Hoare triple {17562#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17555#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,577 INFO L290 TraceCheckUtils]: 54: Hoare triple {17562#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17562#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,582 INFO L290 TraceCheckUtils]: 53: Hoare triple {17569#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17562#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,582 INFO L290 TraceCheckUtils]: 52: Hoare triple {17569#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17569#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,587 INFO L290 TraceCheckUtils]: 51: Hoare triple {17576#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17569#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,588 INFO L290 TraceCheckUtils]: 50: Hoare triple {17576#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17576#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {17583#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17576#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {17583#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17583#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {17590#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17583#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {17590#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17590#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {17597#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17590#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {17597#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17597#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {17604#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17597#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {17604#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17604#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {17611#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17604#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {17611#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17611#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {17618#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17611#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {17618#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17618#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,627 INFO L290 TraceCheckUtils]: 37: Hoare triple {17625#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17618#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,627 INFO L290 TraceCheckUtils]: 36: Hoare triple {17625#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17625#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {17632#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17625#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {17632#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17632#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {17639#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17632#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {17639#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17639#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {17646#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17639#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {17646#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17646#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {17653#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17646#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {17653#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17653#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {17660#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17653#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {17660#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17660#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {17667#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17660#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {17667#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17667#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {17674#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17667#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {17674#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17674#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {17681#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17674#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {17681#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17681#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {17688#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17681#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {17688#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17688#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {17695#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17688#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {17695#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17695#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {17702#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17695#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {17702#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17702#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {17709#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17702#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {17709#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17709#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {17716#(< (mod (+ 29 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17709#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {17716#(< (mod (+ 29 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17716#(< (mod (+ 29 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {17723#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17716#(< (mod (+ 29 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {17723#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17723#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {17730#(< (mod (+ main_~x~0 31) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17723#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {17730#(< (mod (+ main_~x~0 31) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17730#(< (mod (+ main_~x~0 31) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {17260#true} ~x~0 := 0; {17730#(< (mod (+ main_~x~0 31) 4294967296) 268435455)} is VALID [2022-04-15 12:20:18,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {17260#true} call #t~ret5 := main(); {17260#true} is VALID [2022-04-15 12:20:18,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17260#true} {17260#true} #40#return; {17260#true} is VALID [2022-04-15 12:20:18,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {17260#true} assume true; {17260#true} is VALID [2022-04-15 12:20:18,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {17260#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(13, 2);call #Ultimate.allocInit(12, 3); {17260#true} is VALID [2022-04-15 12:20:18,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {17260#true} call ULTIMATE.init(); {17260#true} is VALID [2022-04-15 12:20:18,728 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:20:18,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577232054] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:18,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:18,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2022-04-15 12:20:18,729 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:18,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1945692250] [2022-04-15 12:20:18,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1945692250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:18,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:18,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 12:20:18,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933614694] [2022-04-15 12:20:18,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:18,729 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:20:18,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:18,729 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:20:19,308 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:20:19,308 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 12:20:19,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:19,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 12:20:19,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1151, Invalid=3139, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 12:20:19,309 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:20:51,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:51,872 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-04-15 12:20:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 12:20:51,872 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:20:51,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:51,872 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:20:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 83 transitions. [2022-04-15 12:20:51,873 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:20:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 83 transitions. [2022-04-15 12:20:51,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 83 transitions. [2022-04-15 12:20:52,844 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:20:52,845 INFO L225 Difference]: With dead ends: 82 [2022-04-15 12:20:52,845 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 12:20:52,845 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2259, Invalid=6861, Unknown=0, NotChecked=0, Total=9120 [2022-04-15 12:20:52,846 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:52,846 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 109 Invalid, 1889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2022-04-15 12:20:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 12:20:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-15 12:20:52,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:52,996 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:20:52,997 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:20:52,997 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:20:52,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:52,998 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2022-04-15 12:20:52,998 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-15 12:20:52,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:52,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:52,998 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:20:52,998 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:20:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:53,000 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2022-04-15 12:20:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-15 12:20:53,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:53,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:53,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:53,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:53,000 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:20:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-04-15 12:20:53,001 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 71 [2022-04-15 12:20:53,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:53,001 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-04-15 12:20:53,001 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:20:53,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 77 transitions. [2022-04-15 12:20:53,622 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:20:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-15 12:20:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 12:20:53,623 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:53,623 INFO L499 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:53,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 12:20:53,823 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:20:53,824 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:53,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash 873699491, now seen corresponding path program 59 times [2022-04-15 12:20:53,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:53,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [78454107] [2022-04-15 12:20:53,990 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:20:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash 469984817, now seen corresponding path program 1 times [2022-04-15 12:20:53,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:53,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702619310] [2022-04-15 12:20:53,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:53,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:20:53,998 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:20:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:20:54,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:20:54,002 INFO L85 PathProgramCache]: Analyzing trace with hash 873699491, now seen corresponding path program 60 times [2022-04-15 12:20:54,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:54,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071593486] [2022-04-15 12:20:54,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:54,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:54,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:54,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {18314#(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(13, 2);call #Ultimate.allocInit(12, 3); {18278#true} is VALID [2022-04-15 12:20:54,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {18278#true} assume true; {18278#true} is VALID [2022-04-15 12:20:54,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18278#true} {18278#true} #40#return; {18278#true} is VALID [2022-04-15 12:20:54,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {18278#true} call ULTIMATE.init(); {18314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:54,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {18314#(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(13, 2);call #Ultimate.allocInit(12, 3); {18278#true} is VALID [2022-04-15 12:20:54,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {18278#true} assume true; {18278#true} is VALID [2022-04-15 12:20:54,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18278#true} {18278#true} #40#return; {18278#true} is VALID [2022-04-15 12:20:54,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {18278#true} call #t~ret5 := main(); {18278#true} is VALID [2022-04-15 12:20:54,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {18278#true} ~x~0 := 0; {18283#(= main_~x~0 0)} is VALID [2022-04-15 12:20:54,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {18283#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {18283#(= main_~x~0 0)} is VALID [2022-04-15 12:20:54,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {18283#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18284#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:20:54,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {18284#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {18284#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:20:54,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {18284#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18285#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:54,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {18285#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {18285#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:54,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {18285#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18286#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:20:54,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {18286#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18286#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:20:54,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {18286#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18287#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:54,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {18287#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18287#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:54,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {18287#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18288#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:20:54,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {18288#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {18288#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:20:54,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {18288#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18289#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:54,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {18289#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {18289#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:54,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {18289#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18290#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:20:54,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {18290#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18290#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:20:54,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {18290#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18291#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:54,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {18291#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18291#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:54,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {18291#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18292#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:20:54,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {18292#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18292#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:20:54,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {18292#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18293#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:54,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {18293#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18293#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:54,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {18293#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18294#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:20:54,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {18294#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18294#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:20:54,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {18294#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18295#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:54,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {18295#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18295#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:54,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {18295#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18296#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:20:54,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {18296#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18296#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:20:54,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {18296#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18297#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:54,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {18297#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {18297#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:54,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {18297#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18298#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:20:54,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {18298#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {18298#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:20:54,934 INFO L290 TraceCheckUtils]: 37: Hoare triple {18298#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18299#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:54,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {18299#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18299#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:54,955 INFO L290 TraceCheckUtils]: 39: Hoare triple {18299#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18300#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:20:54,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {18300#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {18300#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:20:54,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {18300#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18301#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:54,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {18301#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18301#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:54,961 INFO L290 TraceCheckUtils]: 43: Hoare triple {18301#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18302#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:20:54,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {18302#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {18302#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:20:54,980 INFO L290 TraceCheckUtils]: 45: Hoare triple {18302#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18303#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:54,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {18303#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18303#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:55,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {18303#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18304#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:20:55,005 INFO L290 TraceCheckUtils]: 48: Hoare triple {18304#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {18304#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:20:55,023 INFO L290 TraceCheckUtils]: 49: Hoare triple {18304#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18305#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:55,024 INFO L290 TraceCheckUtils]: 50: Hoare triple {18305#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {18305#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:55,043 INFO L290 TraceCheckUtils]: 51: Hoare triple {18305#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18306#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:20:55,044 INFO L290 TraceCheckUtils]: 52: Hoare triple {18306#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {18306#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:20:55,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {18306#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18307#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:55,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {18307#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18307#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:55,086 INFO L290 TraceCheckUtils]: 55: Hoare triple {18307#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18308#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:20:55,087 INFO L290 TraceCheckUtils]: 56: Hoare triple {18308#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18308#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:20:55,109 INFO L290 TraceCheckUtils]: 57: Hoare triple {18308#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18309#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:55,109 INFO L290 TraceCheckUtils]: 58: Hoare triple {18309#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18309#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:55,113 INFO L290 TraceCheckUtils]: 59: Hoare triple {18309#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18310#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:20:55,113 INFO L290 TraceCheckUtils]: 60: Hoare triple {18310#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {18310#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:20:55,117 INFO L290 TraceCheckUtils]: 61: Hoare triple {18310#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18311#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:55,117 INFO L290 TraceCheckUtils]: 62: Hoare triple {18311#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {18311#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:55,139 INFO L290 TraceCheckUtils]: 63: Hoare triple {18311#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18312#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:20:55,140 INFO L290 TraceCheckUtils]: 64: Hoare triple {18312#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18312#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:20:55,143 INFO L290 TraceCheckUtils]: 65: Hoare triple {18312#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18313#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:20:55,144 INFO L290 TraceCheckUtils]: 66: Hoare triple {18313#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {18313#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:20:55,149 INFO L290 TraceCheckUtils]: 67: Hoare triple {18313#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {18279#false} is VALID [2022-04-15 12:20:55,149 INFO L290 TraceCheckUtils]: 68: Hoare triple {18279#false} assume !(~x~0 % 4294967296 < 268435455); {18279#false} is VALID [2022-04-15 12:20:55,149 INFO L272 TraceCheckUtils]: 69: Hoare triple {18279#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {18279#false} is VALID [2022-04-15 12:20:55,149 INFO L290 TraceCheckUtils]: 70: Hoare triple {18279#false} ~cond := #in~cond; {18279#false} is VALID [2022-04-15 12:20:55,150 INFO L290 TraceCheckUtils]: 71: Hoare triple {18279#false} assume 0 == ~cond; {18279#false} is VALID [2022-04-15 12:20:55,150 INFO L290 TraceCheckUtils]: 72: Hoare triple {18279#false} assume !false; {18279#false} is VALID [2022-04-15 12:20:55,150 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:20:55,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:55,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071593486] [2022-04-15 12:20:55,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071593486] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:20:55,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196262197] [2022-04-15 12:20:55,151 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:20:55,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:55,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:20:55,152 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:20:55,152 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:20:55,236 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:20:55,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:20:55,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:20:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:55,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:20:55,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {18278#true} call ULTIMATE.init(); {18278#true} is VALID [2022-04-15 12:20:55,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {18278#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(13, 2);call #Ultimate.allocInit(12, 3); {18278#true} is VALID [2022-04-15 12:20:55,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {18278#true} assume true; {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18278#true} {18278#true} #40#return; {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {18278#true} call #t~ret5 := main(); {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {18278#true} ~x~0 := 0; {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 50: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 51: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 52: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 53: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 54: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 55: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 56: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,812 INFO L290 TraceCheckUtils]: 57: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,813 INFO L290 TraceCheckUtils]: 58: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,813 INFO L290 TraceCheckUtils]: 59: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,813 INFO L290 TraceCheckUtils]: 60: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,813 INFO L290 TraceCheckUtils]: 61: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,813 INFO L290 TraceCheckUtils]: 62: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,813 INFO L290 TraceCheckUtils]: 63: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:55,813 INFO L290 TraceCheckUtils]: 64: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:55,833 INFO L290 TraceCheckUtils]: 65: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18513#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:20:55,833 INFO L290 TraceCheckUtils]: 66: Hoare triple {18513#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {18513#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:20:55,840 INFO L290 TraceCheckUtils]: 67: Hoare triple {18513#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {18520#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65521)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65521))} is VALID [2022-04-15 12:20:55,844 INFO L290 TraceCheckUtils]: 68: Hoare triple {18520#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65521)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65521))} assume !(~x~0 % 4294967296 < 268435455); {18279#false} is VALID [2022-04-15 12:20:55,845 INFO L272 TraceCheckUtils]: 69: Hoare triple {18279#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {18279#false} is VALID [2022-04-15 12:20:55,845 INFO L290 TraceCheckUtils]: 70: Hoare triple {18279#false} ~cond := #in~cond; {18279#false} is VALID [2022-04-15 12:20:55,845 INFO L290 TraceCheckUtils]: 71: Hoare triple {18279#false} assume 0 == ~cond; {18279#false} is VALID [2022-04-15 12:20:55,845 INFO L290 TraceCheckUtils]: 72: Hoare triple {18279#false} assume !false; {18279#false} is VALID [2022-04-15 12:20:55,845 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:20:55,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:56,937 INFO L290 TraceCheckUtils]: 72: Hoare triple {18279#false} assume !false; {18279#false} is VALID [2022-04-15 12:20:56,937 INFO L290 TraceCheckUtils]: 71: Hoare triple {18279#false} assume 0 == ~cond; {18279#false} is VALID [2022-04-15 12:20:56,937 INFO L290 TraceCheckUtils]: 70: Hoare triple {18279#false} ~cond := #in~cond; {18279#false} is VALID [2022-04-15 12:20:56,937 INFO L272 TraceCheckUtils]: 69: Hoare triple {18279#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {18279#false} is VALID [2022-04-15 12:20:56,938 INFO L290 TraceCheckUtils]: 68: Hoare triple {18548#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {18279#false} is VALID [2022-04-15 12:20:56,942 INFO L290 TraceCheckUtils]: 67: Hoare triple {18552#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {18548#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:20:56,942 INFO L290 TraceCheckUtils]: 66: Hoare triple {18556#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455); {18552#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:20:56,955 INFO L290 TraceCheckUtils]: 65: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18556#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 12:20:56,955 INFO L290 TraceCheckUtils]: 64: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,955 INFO L290 TraceCheckUtils]: 63: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 62: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 61: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 60: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 59: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 58: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 57: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 56: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 55: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 54: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 53: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 52: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 51: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 49: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 48: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 47: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 46: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 45: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,956 INFO L290 TraceCheckUtils]: 44: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 40: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 39: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 38: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {18278#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {18278#true} assume !!(~x~0 % 4294967296 < 268435455); {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {18278#true} ~x~0 := 0; {18278#true} is VALID [2022-04-15 12:20:56,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {18278#true} call #t~ret5 := main(); {18278#true} is VALID [2022-04-15 12:20:56,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18278#true} {18278#true} #40#return; {18278#true} is VALID [2022-04-15 12:20:56,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {18278#true} assume true; {18278#true} is VALID [2022-04-15 12:20:56,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {18278#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(13, 2);call #Ultimate.allocInit(12, 3); {18278#true} is VALID [2022-04-15 12:20:56,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {18278#true} call ULTIMATE.init(); {18278#true} is VALID [2022-04-15 12:20:56,959 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:20:56,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196262197] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:56,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:56,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 4, 5] total 39 [2022-04-15 12:20:56,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:56,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [78454107] [2022-04-15 12:20:56,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [78454107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:56,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:56,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 12:20:56,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062386171] [2022-04-15 12:20:56,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:56,960 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:20:56,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:56,960 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:20:57,800 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:20:57,800 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 12:20:57,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:57,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 12:20:57,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1248, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:20:57,801 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:21:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:31,653 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-15 12:21:31,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 12:21:31,654 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:21:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:31,654 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:21:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 85 transitions. [2022-04-15 12:21:31,655 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:21:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 85 transitions. [2022-04-15 12:21:31,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 85 transitions. [2022-04-15 12:21:32,795 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:21:32,795 INFO L225 Difference]: With dead ends: 84 [2022-04-15 12:21:32,796 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 12:21:32,796 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=540, Invalid=4290, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 12:21:32,796 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1881 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:32,797 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 54 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1881 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2022-04-15 12:21:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 12:21:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-15 12:21:32,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:32,947 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:21:32,947 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:21:32,947 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:21:32,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:32,948 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2022-04-15 12:21:32,948 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2022-04-15 12:21:32,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:32,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:32,948 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:21:32,948 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:21:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:32,949 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2022-04-15 12:21:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2022-04-15 12:21:32,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:32,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:32,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:32,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:32,949 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:21:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2022-04-15 12:21:32,950 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 73 [2022-04-15 12:21:32,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:32,950 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2022-04-15 12:21:32,950 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:21:32,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 79 transitions. [2022-04-15 12:21:33,445 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:21:33,445 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2022-04-15 12:21:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 12:21:33,446 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:33,446 INFO L499 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:33,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-15 12:21:33,646 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:21:33,646 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:33,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:33,647 INFO L85 PathProgramCache]: Analyzing trace with hash -246442112, now seen corresponding path program 61 times [2022-04-15 12:21:33,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:33,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1744909683] [2022-04-15 12:21:33,859 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:21:33,860 INFO L85 PathProgramCache]: Analyzing trace with hash 529090161, now seen corresponding path program 1 times [2022-04-15 12:21:33,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:33,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272868727] [2022-04-15 12:21:33,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:33,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:21:33,867 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:21:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:21:33,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:21:33,870 INFO L85 PathProgramCache]: Analyzing trace with hash -246442112, now seen corresponding path program 62 times [2022-04-15 12:21:33,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:33,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768051542] [2022-04-15 12:21:33,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:33,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:34,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:34,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {19332#(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(13, 2);call #Ultimate.allocInit(12, 3); {19295#true} is VALID [2022-04-15 12:21:34,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {19295#true} assume true; {19295#true} is VALID [2022-04-15 12:21:34,527 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19295#true} {19295#true} #40#return; {19295#true} is VALID [2022-04-15 12:21:34,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {19295#true} call ULTIMATE.init(); {19332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:34,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {19332#(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(13, 2);call #Ultimate.allocInit(12, 3); {19295#true} is VALID [2022-04-15 12:21:34,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {19295#true} assume true; {19295#true} is VALID [2022-04-15 12:21:34,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19295#true} {19295#true} #40#return; {19295#true} is VALID [2022-04-15 12:21:34,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {19295#true} call #t~ret5 := main(); {19295#true} is VALID [2022-04-15 12:21:34,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {19295#true} ~x~0 := 0; {19300#(= main_~x~0 0)} is VALID [2022-04-15 12:21:34,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {19300#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {19300#(= main_~x~0 0)} is VALID [2022-04-15 12:21:34,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {19300#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19301#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:21:34,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {19301#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {19301#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:21:34,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {19301#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19302#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:21:34,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {19302#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {19302#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:21:34,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {19302#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19303#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:21:34,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {19303#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19303#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:21:34,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {19303#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:21:34,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {19304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:21:34,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {19304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19305#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:21:34,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {19305#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {19305#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:21:34,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {19305#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19306#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:21:34,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {19306#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {19306#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:21:34,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {19306#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19307#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:21:34,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {19307#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19307#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:21:34,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {19307#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19308#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:21:34,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {19308#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19308#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:21:34,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {19308#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19309#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:21:34,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {19309#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19309#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:21:34,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {19309#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19310#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:21:34,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {19310#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19310#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:21:34,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {19310#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19311#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:21:34,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {19311#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19311#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:21:34,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {19311#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19312#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:21:34,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {19312#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19312#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:21:34,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {19312#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19313#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:21:34,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {19313#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19313#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:21:34,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {19313#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19314#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:21:34,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {19314#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {19314#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:21:34,630 INFO L290 TraceCheckUtils]: 35: Hoare triple {19314#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19315#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:21:34,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {19315#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {19315#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:21:34,638 INFO L290 TraceCheckUtils]: 37: Hoare triple {19315#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19316#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:21:34,639 INFO L290 TraceCheckUtils]: 38: Hoare triple {19316#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19316#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:21:34,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {19316#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19317#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:21:34,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {19317#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {19317#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:21:34,651 INFO L290 TraceCheckUtils]: 41: Hoare triple {19317#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19318#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:21:34,651 INFO L290 TraceCheckUtils]: 42: Hoare triple {19318#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19318#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:21:34,654 INFO L290 TraceCheckUtils]: 43: Hoare triple {19318#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19319#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:21:34,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {19319#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {19319#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:21:34,665 INFO L290 TraceCheckUtils]: 45: Hoare triple {19319#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19320#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:21:34,665 INFO L290 TraceCheckUtils]: 46: Hoare triple {19320#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19320#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:21:34,675 INFO L290 TraceCheckUtils]: 47: Hoare triple {19320#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19321#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:21:34,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {19321#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {19321#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:21:34,683 INFO L290 TraceCheckUtils]: 49: Hoare triple {19321#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19322#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:21:34,683 INFO L290 TraceCheckUtils]: 50: Hoare triple {19322#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {19322#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:21:34,692 INFO L290 TraceCheckUtils]: 51: Hoare triple {19322#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19323#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:21:34,693 INFO L290 TraceCheckUtils]: 52: Hoare triple {19323#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {19323#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:21:34,699 INFO L290 TraceCheckUtils]: 53: Hoare triple {19323#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19324#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:21:34,699 INFO L290 TraceCheckUtils]: 54: Hoare triple {19324#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19324#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:21:34,707 INFO L290 TraceCheckUtils]: 55: Hoare triple {19324#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19325#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:21:34,708 INFO L290 TraceCheckUtils]: 56: Hoare triple {19325#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19325#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:21:34,715 INFO L290 TraceCheckUtils]: 57: Hoare triple {19325#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19326#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:21:34,716 INFO L290 TraceCheckUtils]: 58: Hoare triple {19326#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19326#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:21:34,719 INFO L290 TraceCheckUtils]: 59: Hoare triple {19326#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19327#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:21:34,719 INFO L290 TraceCheckUtils]: 60: Hoare triple {19327#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {19327#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:21:34,722 INFO L290 TraceCheckUtils]: 61: Hoare triple {19327#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19328#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:21:34,722 INFO L290 TraceCheckUtils]: 62: Hoare triple {19328#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {19328#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:21:34,736 INFO L290 TraceCheckUtils]: 63: Hoare triple {19328#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19329#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:21:34,737 INFO L290 TraceCheckUtils]: 64: Hoare triple {19329#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19329#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:21:34,745 INFO L290 TraceCheckUtils]: 65: Hoare triple {19329#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19330#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:21:34,746 INFO L290 TraceCheckUtils]: 66: Hoare triple {19330#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455); {19330#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:21:34,756 INFO L290 TraceCheckUtils]: 67: Hoare triple {19330#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19331#(and (<= main_~x~0 31) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:21:34,756 INFO L290 TraceCheckUtils]: 68: Hoare triple {19331#(and (<= main_~x~0 31) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {19331#(and (<= main_~x~0 31) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:21:34,758 INFO L290 TraceCheckUtils]: 69: Hoare triple {19331#(and (<= main_~x~0 31) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {19296#false} is VALID [2022-04-15 12:21:34,758 INFO L290 TraceCheckUtils]: 70: Hoare triple {19296#false} assume !(~x~0 % 4294967296 < 268435455); {19296#false} is VALID [2022-04-15 12:21:34,759 INFO L272 TraceCheckUtils]: 71: Hoare triple {19296#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {19296#false} is VALID [2022-04-15 12:21:34,759 INFO L290 TraceCheckUtils]: 72: Hoare triple {19296#false} ~cond := #in~cond; {19296#false} is VALID [2022-04-15 12:21:34,759 INFO L290 TraceCheckUtils]: 73: Hoare triple {19296#false} assume 0 == ~cond; {19296#false} is VALID [2022-04-15 12:21:34,759 INFO L290 TraceCheckUtils]: 74: Hoare triple {19296#false} assume !false; {19296#false} is VALID [2022-04-15 12:21:34,759 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:21:34,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:34,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768051542] [2022-04-15 12:21:34,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768051542] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:21:34,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093869549] [2022-04-15 12:21:34,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:21:34,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:34,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:21:34,761 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:21:34,761 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:21:34,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:21:34,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:21:34,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-15 12:21:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:34,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:21:35,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {19295#true} call ULTIMATE.init(); {19295#true} is VALID [2022-04-15 12:21:35,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {19295#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(13, 2);call #Ultimate.allocInit(12, 3); {19295#true} is VALID [2022-04-15 12:21:35,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {19295#true} assume true; {19295#true} is VALID [2022-04-15 12:21:35,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19295#true} {19295#true} #40#return; {19295#true} is VALID [2022-04-15 12:21:35,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {19295#true} call #t~ret5 := main(); {19295#true} is VALID [2022-04-15 12:21:35,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {19295#true} ~x~0 := 0; {19300#(= main_~x~0 0)} is VALID [2022-04-15 12:21:35,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {19300#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {19300#(= main_~x~0 0)} is VALID [2022-04-15 12:21:35,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {19300#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19301#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:21:35,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {19301#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {19301#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:21:35,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {19301#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19302#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:21:35,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {19302#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {19302#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:21:35,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {19302#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19303#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:21:35,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {19303#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19303#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:21:35,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {19303#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:21:35,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {19304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:21:35,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {19304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19305#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:21:35,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {19305#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {19305#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:21:35,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {19305#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19306#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:21:35,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {19306#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {19306#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:21:35,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {19306#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19307#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:21:35,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {19307#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19307#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:21:35,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {19307#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19308#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:21:35,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {19308#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19308#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:21:35,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {19308#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19309#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:21:35,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {19309#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19309#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:21:35,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {19309#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19310#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:21:35,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {19310#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19310#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:21:35,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {19310#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19311#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:21:35,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {19311#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19311#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:21:35,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {19311#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19312#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:21:35,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {19312#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19312#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:21:35,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {19312#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19313#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:21:35,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {19313#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19313#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:21:35,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {19313#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19314#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:21:35,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {19314#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {19314#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:21:35,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {19314#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19315#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:21:35,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {19315#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {19315#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:21:35,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {19315#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19316#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:21:35,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {19316#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19316#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:21:35,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {19316#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19317#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:21:35,607 INFO L290 TraceCheckUtils]: 40: Hoare triple {19317#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {19317#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:21:35,609 INFO L290 TraceCheckUtils]: 41: Hoare triple {19317#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19318#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:21:35,610 INFO L290 TraceCheckUtils]: 42: Hoare triple {19318#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19318#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:21:35,612 INFO L290 TraceCheckUtils]: 43: Hoare triple {19318#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19319#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:21:35,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {19319#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {19319#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:21:35,625 INFO L290 TraceCheckUtils]: 45: Hoare triple {19319#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19320#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:21:35,626 INFO L290 TraceCheckUtils]: 46: Hoare triple {19320#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19320#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:21:35,634 INFO L290 TraceCheckUtils]: 47: Hoare triple {19320#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19321#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:21:35,635 INFO L290 TraceCheckUtils]: 48: Hoare triple {19321#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {19321#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:21:35,644 INFO L290 TraceCheckUtils]: 49: Hoare triple {19321#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19322#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:21:35,645 INFO L290 TraceCheckUtils]: 50: Hoare triple {19322#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {19322#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:21:35,654 INFO L290 TraceCheckUtils]: 51: Hoare triple {19322#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19323#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:21:35,654 INFO L290 TraceCheckUtils]: 52: Hoare triple {19323#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {19323#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:21:35,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {19323#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19324#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:21:35,666 INFO L290 TraceCheckUtils]: 54: Hoare triple {19324#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19324#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:21:35,676 INFO L290 TraceCheckUtils]: 55: Hoare triple {19324#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19325#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:21:35,676 INFO L290 TraceCheckUtils]: 56: Hoare triple {19325#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19325#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:21:35,684 INFO L290 TraceCheckUtils]: 57: Hoare triple {19325#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19326#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:21:35,685 INFO L290 TraceCheckUtils]: 58: Hoare triple {19326#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19326#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:21:35,688 INFO L290 TraceCheckUtils]: 59: Hoare triple {19326#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19327#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:21:35,688 INFO L290 TraceCheckUtils]: 60: Hoare triple {19327#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {19327#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:21:35,691 INFO L290 TraceCheckUtils]: 61: Hoare triple {19327#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19328#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:21:35,692 INFO L290 TraceCheckUtils]: 62: Hoare triple {19328#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {19328#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:21:35,705 INFO L290 TraceCheckUtils]: 63: Hoare triple {19328#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19329#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:21:35,706 INFO L290 TraceCheckUtils]: 64: Hoare triple {19329#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {19329#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:21:35,715 INFO L290 TraceCheckUtils]: 65: Hoare triple {19329#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19330#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:21:35,716 INFO L290 TraceCheckUtils]: 66: Hoare triple {19330#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455); {19330#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:21:35,726 INFO L290 TraceCheckUtils]: 67: Hoare triple {19330#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19537#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:21:35,727 INFO L290 TraceCheckUtils]: 68: Hoare triple {19537#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 268435455); {19537#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:21:35,728 INFO L290 TraceCheckUtils]: 69: Hoare triple {19537#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {19544#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:21:35,731 INFO L290 TraceCheckUtils]: 70: Hoare triple {19544#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {19296#false} is VALID [2022-04-15 12:21:35,731 INFO L272 TraceCheckUtils]: 71: Hoare triple {19296#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {19296#false} is VALID [2022-04-15 12:21:35,731 INFO L290 TraceCheckUtils]: 72: Hoare triple {19296#false} ~cond := #in~cond; {19296#false} is VALID [2022-04-15 12:21:35,731 INFO L290 TraceCheckUtils]: 73: Hoare triple {19296#false} assume 0 == ~cond; {19296#false} is VALID [2022-04-15 12:21:35,731 INFO L290 TraceCheckUtils]: 74: Hoare triple {19296#false} assume !false; {19296#false} is VALID [2022-04-15 12:21:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:35,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:21:41,233 INFO L290 TraceCheckUtils]: 74: Hoare triple {19296#false} assume !false; {19296#false} is VALID [2022-04-15 12:21:41,234 INFO L290 TraceCheckUtils]: 73: Hoare triple {19296#false} assume 0 == ~cond; {19296#false} is VALID [2022-04-15 12:21:41,234 INFO L290 TraceCheckUtils]: 72: Hoare triple {19296#false} ~cond := #in~cond; {19296#false} is VALID [2022-04-15 12:21:41,234 INFO L272 TraceCheckUtils]: 71: Hoare triple {19296#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {19296#false} is VALID [2022-04-15 12:21:41,234 INFO L290 TraceCheckUtils]: 70: Hoare triple {19572#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {19296#false} is VALID [2022-04-15 12:21:41,236 INFO L290 TraceCheckUtils]: 69: Hoare triple {19576#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {19572#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,237 INFO L290 TraceCheckUtils]: 68: Hoare triple {19576#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19576#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,251 INFO L290 TraceCheckUtils]: 67: Hoare triple {19583#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19576#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,252 INFO L290 TraceCheckUtils]: 66: Hoare triple {19583#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19583#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,259 INFO L290 TraceCheckUtils]: 65: Hoare triple {19590#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19583#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,260 INFO L290 TraceCheckUtils]: 64: Hoare triple {19590#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19590#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,263 INFO L290 TraceCheckUtils]: 63: Hoare triple {19597#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19590#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,263 INFO L290 TraceCheckUtils]: 62: Hoare triple {19597#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19597#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {19604#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19597#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,265 INFO L290 TraceCheckUtils]: 60: Hoare triple {19604#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19604#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,276 INFO L290 TraceCheckUtils]: 59: Hoare triple {19611#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19604#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,277 INFO L290 TraceCheckUtils]: 58: Hoare triple {19611#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19611#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,284 INFO L290 TraceCheckUtils]: 57: Hoare triple {19618#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19611#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,284 INFO L290 TraceCheckUtils]: 56: Hoare triple {19618#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19618#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,291 INFO L290 TraceCheckUtils]: 55: Hoare triple {19625#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19618#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,291 INFO L290 TraceCheckUtils]: 54: Hoare triple {19625#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19625#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,297 INFO L290 TraceCheckUtils]: 53: Hoare triple {19632#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19625#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,298 INFO L290 TraceCheckUtils]: 52: Hoare triple {19632#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19632#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,306 INFO L290 TraceCheckUtils]: 51: Hoare triple {19639#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19632#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,306 INFO L290 TraceCheckUtils]: 50: Hoare triple {19639#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19639#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {19646#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19639#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {19646#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19646#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {19653#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19646#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,321 INFO L290 TraceCheckUtils]: 46: Hoare triple {19653#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19653#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {19660#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19653#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {19660#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19660#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,326 INFO L290 TraceCheckUtils]: 43: Hoare triple {19667#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19660#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {19667#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19667#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {19674#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19667#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {19674#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19674#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {19681#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19674#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {19681#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19681#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {19688#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19681#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,351 INFO L290 TraceCheckUtils]: 36: Hoare triple {19688#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19688#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {19695#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19688#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {19695#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19695#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {19702#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19695#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {19702#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19702#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {19709#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19702#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {19709#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19709#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {19716#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19709#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {19716#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19716#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {19723#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19716#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {19723#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19723#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {19730#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19723#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {19730#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19730#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {19737#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19730#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {19737#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19737#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {19744#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19737#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {19744#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19744#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {19751#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19744#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {19751#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19751#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {19758#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19751#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {19758#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19758#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {19765#(< (mod (+ 29 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19758#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {19765#(< (mod (+ 29 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19765#(< (mod (+ 29 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {19772#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19765#(< (mod (+ 29 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {19772#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19772#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {19779#(< (mod (+ main_~x~0 31) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19772#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {19779#(< (mod (+ main_~x~0 31) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19779#(< (mod (+ main_~x~0 31) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {19786#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19779#(< (mod (+ main_~x~0 31) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {19786#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19786#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {19793#(< (mod (+ main_~x~0 33) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19786#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {19793#(< (mod (+ main_~x~0 33) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {19793#(< (mod (+ main_~x~0 33) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {19295#true} ~x~0 := 0; {19793#(< (mod (+ main_~x~0 33) 4294967296) 268435455)} is VALID [2022-04-15 12:21:41,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {19295#true} call #t~ret5 := main(); {19295#true} is VALID [2022-04-15 12:21:41,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19295#true} {19295#true} #40#return; {19295#true} is VALID [2022-04-15 12:21:41,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {19295#true} assume true; {19295#true} is VALID [2022-04-15 12:21:41,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {19295#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(13, 2);call #Ultimate.allocInit(12, 3); {19295#true} is VALID [2022-04-15 12:21:41,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {19295#true} call ULTIMATE.init(); {19295#true} is VALID [2022-04-15 12:21:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:41,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093869549] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:21:41,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:21:41,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2022-04-15 12:21:41,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:21:41,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1744909683] [2022-04-15 12:21:41,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1744909683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:41,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:41,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 12:21:41,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496773705] [2022-04-15 12:21:41,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:21:41,489 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:21:41,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:21:41,489 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:21:42,030 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:21:42,030 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 12:21:42,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:42,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 12:21:42,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1291, Invalid=3539, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 12:21:42,038 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:22:28,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:28,426 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-04-15 12:22:28,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 12:22:28,426 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:22:28,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:22:28,427 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:22:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 87 transitions. [2022-04-15 12:22:28,428 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:22:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 87 transitions. [2022-04-15 12:22:28,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 87 transitions. [2022-04-15 12:22:29,124 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:22:29,125 INFO L225 Difference]: With dead ends: 86 [2022-04-15 12:22:29,125 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 12:22:29,126 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2537, Invalid=7765, Unknown=0, NotChecked=0, Total=10302 [2022-04-15 12:22:29,126 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2028 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:22:29,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 74 Invalid, 2093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2028 Invalid, 0 Unknown, 0 Unchecked, 18.4s Time] [2022-04-15 12:22:29,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 12:22:29,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-15 12:22:29,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:22:29,282 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:22:29,282 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:22:29,283 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:22:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:29,283 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-15 12:22:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-15 12:22:29,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:29,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:29,284 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:22:29,284 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:22:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:29,284 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-15 12:22:29,284 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-15 12:22:29,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:29,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:29,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:22:29,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:22:29,285 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:22:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-04-15 12:22:29,285 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 75 [2022-04-15 12:22:29,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:22:29,286 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-04-15 12:22:29,286 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:22:29,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 81 transitions. [2022-04-15 12:22:29,830 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:22:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-15 12:22:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 12:22:29,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:22:29,830 INFO L499 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:22:29,846 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:22:30,031 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:22:30,031 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:22:30,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:22:30,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1334268701, now seen corresponding path program 63 times [2022-04-15 12:22:30,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:30,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [658919852] [2022-04-15 12:22:30,194 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:22:30,196 INFO L85 PathProgramCache]: Analyzing trace with hash 588195505, now seen corresponding path program 1 times [2022-04-15 12:22:30,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:30,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640647543] [2022-04-15 12:22:30,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:30,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:22:30,203 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:22:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:22:30,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:22:30,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1334268701, now seen corresponding path program 64 times [2022-04-15 12:22:30,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:30,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797572065] [2022-04-15 12:22:30,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:30,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:30,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:22:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:30,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {20407#(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(13, 2);call #Ultimate.allocInit(12, 3); {20369#true} is VALID [2022-04-15 12:22:30,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {20369#true} assume true; {20369#true} is VALID [2022-04-15 12:22:30,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20369#true} {20369#true} #40#return; {20369#true} is VALID [2022-04-15 12:22:30,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {20369#true} call ULTIMATE.init(); {20407#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:22:30,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {20407#(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(13, 2);call #Ultimate.allocInit(12, 3); {20369#true} is VALID [2022-04-15 12:22:30,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {20369#true} assume true; {20369#true} is VALID [2022-04-15 12:22:30,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20369#true} {20369#true} #40#return; {20369#true} is VALID [2022-04-15 12:22:30,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {20369#true} call #t~ret5 := main(); {20369#true} is VALID [2022-04-15 12:22:30,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {20369#true} ~x~0 := 0; {20374#(= main_~x~0 0)} is VALID [2022-04-15 12:22:30,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {20374#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {20374#(= main_~x~0 0)} is VALID [2022-04-15 12:22:30,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {20374#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20375#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:22:30,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {20375#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {20375#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:22:30,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {20375#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20376#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:22:30,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {20376#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {20376#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:22:30,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {20376#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20377#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:22:30,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {20377#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20377#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:22:30,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {20377#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20378#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:22:30,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {20378#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20378#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:22:30,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {20378#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20379#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:22:30,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {20379#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {20379#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:22:30,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {20379#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20380#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:22:30,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {20380#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {20380#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:22:30,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {20380#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20381#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:22:30,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {20381#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20381#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:22:30,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {20381#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20382#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:22:30,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {20382#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20382#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:22:31,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {20382#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20383#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:22:31,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {20383#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20383#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:22:31,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {20383#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20384#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:22:31,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {20384#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20384#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:22:31,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {20384#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20385#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:22:31,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {20385#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20385#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:22:31,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {20385#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20386#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:22:31,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {20386#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20386#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:22:31,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {20386#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20387#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:22:31,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {20387#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20387#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:22:31,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {20387#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20388#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:22:31,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {20388#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {20388#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:22:31,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {20388#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20389#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:22:31,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {20389#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {20389#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:22:31,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {20389#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20390#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:22:31,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {20390#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20390#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:22:31,099 INFO L290 TraceCheckUtils]: 39: Hoare triple {20390#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20391#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:22:31,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {20391#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {20391#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:22:31,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {20391#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20392#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:22:31,103 INFO L290 TraceCheckUtils]: 42: Hoare triple {20392#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20392#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:22:31,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {20392#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20393#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:22:31,106 INFO L290 TraceCheckUtils]: 44: Hoare triple {20393#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {20393#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:22:31,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {20393#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20394#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:22:31,120 INFO L290 TraceCheckUtils]: 46: Hoare triple {20394#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20394#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:22:31,129 INFO L290 TraceCheckUtils]: 47: Hoare triple {20394#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20395#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:22:31,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {20395#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {20395#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:22:31,138 INFO L290 TraceCheckUtils]: 49: Hoare triple {20395#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20396#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:22:31,139 INFO L290 TraceCheckUtils]: 50: Hoare triple {20396#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {20396#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:22:31,148 INFO L290 TraceCheckUtils]: 51: Hoare triple {20396#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20397#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:22:31,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {20397#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {20397#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:22:31,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {20397#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20398#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:22:31,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {20398#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20398#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:22:31,166 INFO L290 TraceCheckUtils]: 55: Hoare triple {20398#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20399#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:22:31,167 INFO L290 TraceCheckUtils]: 56: Hoare triple {20399#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20399#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:22:31,175 INFO L290 TraceCheckUtils]: 57: Hoare triple {20399#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20400#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:22:31,176 INFO L290 TraceCheckUtils]: 58: Hoare triple {20400#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20400#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:22:31,179 INFO L290 TraceCheckUtils]: 59: Hoare triple {20400#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20401#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:22:31,179 INFO L290 TraceCheckUtils]: 60: Hoare triple {20401#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {20401#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:22:31,183 INFO L290 TraceCheckUtils]: 61: Hoare triple {20401#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20402#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:22:31,183 INFO L290 TraceCheckUtils]: 62: Hoare triple {20402#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {20402#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:22:31,197 INFO L290 TraceCheckUtils]: 63: Hoare triple {20402#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20403#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:22:31,197 INFO L290 TraceCheckUtils]: 64: Hoare triple {20403#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20403#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:22:31,207 INFO L290 TraceCheckUtils]: 65: Hoare triple {20403#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20404#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:22:31,208 INFO L290 TraceCheckUtils]: 66: Hoare triple {20404#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455); {20404#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:22:31,218 INFO L290 TraceCheckUtils]: 67: Hoare triple {20404#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20405#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:22:31,218 INFO L290 TraceCheckUtils]: 68: Hoare triple {20405#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 268435455); {20405#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:22:31,227 INFO L290 TraceCheckUtils]: 69: Hoare triple {20405#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20406#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:22:31,228 INFO L290 TraceCheckUtils]: 70: Hoare triple {20406#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {20406#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:22:31,230 INFO L290 TraceCheckUtils]: 71: Hoare triple {20406#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {20370#false} is VALID [2022-04-15 12:22:31,230 INFO L290 TraceCheckUtils]: 72: Hoare triple {20370#false} assume !(~x~0 % 4294967296 < 268435455); {20370#false} is VALID [2022-04-15 12:22:31,230 INFO L272 TraceCheckUtils]: 73: Hoare triple {20370#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {20370#false} is VALID [2022-04-15 12:22:31,230 INFO L290 TraceCheckUtils]: 74: Hoare triple {20370#false} ~cond := #in~cond; {20370#false} is VALID [2022-04-15 12:22:31,230 INFO L290 TraceCheckUtils]: 75: Hoare triple {20370#false} assume 0 == ~cond; {20370#false} is VALID [2022-04-15 12:22:31,230 INFO L290 TraceCheckUtils]: 76: Hoare triple {20370#false} assume !false; {20370#false} is VALID [2022-04-15 12:22:31,231 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:22:31,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:22:31,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797572065] [2022-04-15 12:22:31,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797572065] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:22:31,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957428013] [2022-04-15 12:22:31,231 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:22:31,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:22:31,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:22:31,232 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:22:31,233 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:22:31,303 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:22:31,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:22:31,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-15 12:22:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:31,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:22:32,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {20369#true} call ULTIMATE.init(); {20369#true} is VALID [2022-04-15 12:22:32,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {20369#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(13, 2);call #Ultimate.allocInit(12, 3); {20369#true} is VALID [2022-04-15 12:22:32,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {20369#true} assume true; {20369#true} is VALID [2022-04-15 12:22:32,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20369#true} {20369#true} #40#return; {20369#true} is VALID [2022-04-15 12:22:32,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {20369#true} call #t~ret5 := main(); {20369#true} is VALID [2022-04-15 12:22:32,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {20369#true} ~x~0 := 0; {20374#(= main_~x~0 0)} is VALID [2022-04-15 12:22:32,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {20374#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {20374#(= main_~x~0 0)} is VALID [2022-04-15 12:22:32,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {20374#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20375#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:22:32,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {20375#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {20375#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:22:32,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {20375#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20376#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:22:32,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {20376#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {20376#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:22:32,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {20376#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20377#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:22:32,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {20377#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20377#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:22:32,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {20377#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20378#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:22:32,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {20378#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20378#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:22:32,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {20378#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20379#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:22:32,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {20379#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {20379#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:22:32,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {20379#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20380#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:22:32,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {20380#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {20380#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:22:32,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {20380#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20381#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:22:32,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {20381#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20381#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:22:32,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {20381#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20382#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:22:32,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {20382#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20382#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:22:32,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {20382#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20383#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:22:32,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {20383#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20383#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:22:32,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {20383#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20384#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:22:32,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {20384#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20384#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:22:32,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {20384#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20385#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:22:32,213 INFO L290 TraceCheckUtils]: 28: Hoare triple {20385#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20385#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:22:32,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {20385#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20386#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:22:32,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {20386#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20386#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:22:32,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {20386#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20387#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:22:32,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {20387#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20387#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:22:32,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {20387#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20388#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:22:32,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {20388#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {20388#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:22:32,248 INFO L290 TraceCheckUtils]: 35: Hoare triple {20388#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20389#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:22:32,249 INFO L290 TraceCheckUtils]: 36: Hoare triple {20389#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {20389#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:22:32,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {20389#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20390#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:22:32,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {20390#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20390#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:22:32,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {20390#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20391#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:22:32,292 INFO L290 TraceCheckUtils]: 40: Hoare triple {20391#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {20391#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:22:32,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {20391#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20392#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:22:32,296 INFO L290 TraceCheckUtils]: 42: Hoare triple {20392#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20392#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:22:32,298 INFO L290 TraceCheckUtils]: 43: Hoare triple {20392#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20393#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:22:32,299 INFO L290 TraceCheckUtils]: 44: Hoare triple {20393#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {20393#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:22:32,319 INFO L290 TraceCheckUtils]: 45: Hoare triple {20393#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20394#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:22:32,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {20394#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20394#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:22:32,341 INFO L290 TraceCheckUtils]: 47: Hoare triple {20394#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20395#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:22:32,342 INFO L290 TraceCheckUtils]: 48: Hoare triple {20395#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {20395#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:22:32,363 INFO L290 TraceCheckUtils]: 49: Hoare triple {20395#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20396#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:22:32,364 INFO L290 TraceCheckUtils]: 50: Hoare triple {20396#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {20396#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:22:32,384 INFO L290 TraceCheckUtils]: 51: Hoare triple {20396#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20397#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:22:32,384 INFO L290 TraceCheckUtils]: 52: Hoare triple {20397#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {20397#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:22:32,406 INFO L290 TraceCheckUtils]: 53: Hoare triple {20397#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20398#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:22:32,406 INFO L290 TraceCheckUtils]: 54: Hoare triple {20398#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20398#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:22:32,427 INFO L290 TraceCheckUtils]: 55: Hoare triple {20398#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20399#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:22:32,428 INFO L290 TraceCheckUtils]: 56: Hoare triple {20399#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20399#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:22:32,449 INFO L290 TraceCheckUtils]: 57: Hoare triple {20399#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20400#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:22:32,449 INFO L290 TraceCheckUtils]: 58: Hoare triple {20400#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20400#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:22:32,453 INFO L290 TraceCheckUtils]: 59: Hoare triple {20400#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20401#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:22:32,454 INFO L290 TraceCheckUtils]: 60: Hoare triple {20401#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {20401#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:22:32,457 INFO L290 TraceCheckUtils]: 61: Hoare triple {20401#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20402#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:22:32,458 INFO L290 TraceCheckUtils]: 62: Hoare triple {20402#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {20402#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:22:32,478 INFO L290 TraceCheckUtils]: 63: Hoare triple {20402#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20403#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:22:32,479 INFO L290 TraceCheckUtils]: 64: Hoare triple {20403#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20403#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:22:32,501 INFO L290 TraceCheckUtils]: 65: Hoare triple {20403#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20404#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:22:32,501 INFO L290 TraceCheckUtils]: 66: Hoare triple {20404#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455); {20404#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:22:32,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {20404#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20405#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:22:32,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {20405#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 268435455); {20405#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:22:32,545 INFO L290 TraceCheckUtils]: 69: Hoare triple {20405#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20618#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:22:32,545 INFO L290 TraceCheckUtils]: 70: Hoare triple {20618#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {20618#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:22:32,546 INFO L290 TraceCheckUtils]: 71: Hoare triple {20618#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {20625#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:22:32,547 INFO L290 TraceCheckUtils]: 72: Hoare triple {20625#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {20625#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:22:32,547 INFO L272 TraceCheckUtils]: 73: Hoare triple {20625#(and (<= main_~x~0 34) (<= 34 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {20632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:22:32,548 INFO L290 TraceCheckUtils]: 74: Hoare triple {20632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:22:32,548 INFO L290 TraceCheckUtils]: 75: Hoare triple {20636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20370#false} is VALID [2022-04-15 12:22:32,548 INFO L290 TraceCheckUtils]: 76: Hoare triple {20370#false} assume !false; {20370#false} is VALID [2022-04-15 12:22:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:22:32,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:22:32,884 INFO L290 TraceCheckUtils]: 76: Hoare triple {20370#false} assume !false; {20370#false} is VALID [2022-04-15 12:22:32,885 INFO L290 TraceCheckUtils]: 75: Hoare triple {20636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20370#false} is VALID [2022-04-15 12:22:32,885 INFO L290 TraceCheckUtils]: 74: Hoare triple {20632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:22:32,886 INFO L272 TraceCheckUtils]: 73: Hoare triple {20652#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {20632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:22:32,886 INFO L290 TraceCheckUtils]: 72: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:32,887 INFO L290 TraceCheckUtils]: 71: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:32,887 INFO L290 TraceCheckUtils]: 70: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:32,909 INFO L290 TraceCheckUtils]: 69: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:32,909 INFO L290 TraceCheckUtils]: 68: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:32,911 INFO L290 TraceCheckUtils]: 67: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:32,911 INFO L290 TraceCheckUtils]: 66: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:32,928 INFO L290 TraceCheckUtils]: 65: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:32,928 INFO L290 TraceCheckUtils]: 64: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:32,930 INFO L290 TraceCheckUtils]: 63: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:32,930 INFO L290 TraceCheckUtils]: 62: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:32,947 INFO L290 TraceCheckUtils]: 61: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:32,948 INFO L290 TraceCheckUtils]: 60: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:32,950 INFO L290 TraceCheckUtils]: 59: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:32,950 INFO L290 TraceCheckUtils]: 58: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:32,966 INFO L290 TraceCheckUtils]: 57: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:32,967 INFO L290 TraceCheckUtils]: 56: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:32,969 INFO L290 TraceCheckUtils]: 55: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:32,969 INFO L290 TraceCheckUtils]: 54: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:32,985 INFO L290 TraceCheckUtils]: 53: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:32,986 INFO L290 TraceCheckUtils]: 52: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:32,988 INFO L290 TraceCheckUtils]: 51: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:32,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:32,999 INFO L290 TraceCheckUtils]: 49: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,000 INFO L290 TraceCheckUtils]: 48: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,003 INFO L290 TraceCheckUtils]: 47: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,003 INFO L290 TraceCheckUtils]: 46: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,019 INFO L290 TraceCheckUtils]: 45: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,022 INFO L290 TraceCheckUtils]: 43: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,022 INFO L290 TraceCheckUtils]: 42: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,041 INFO L290 TraceCheckUtils]: 41: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,044 INFO L290 TraceCheckUtils]: 39: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,044 INFO L290 TraceCheckUtils]: 38: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,070 INFO L290 TraceCheckUtils]: 35: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {20665#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20665#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:22:33,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {20652#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {20369#true} ~x~0 := 0; {20652#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:22:33,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {20369#true} call #t~ret5 := main(); {20369#true} is VALID [2022-04-15 12:22:33,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20369#true} {20369#true} #40#return; {20369#true} is VALID [2022-04-15 12:22:33,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {20369#true} assume true; {20369#true} is VALID [2022-04-15 12:22:33,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {20369#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(13, 2);call #Ultimate.allocInit(12, 3); {20369#true} is VALID [2022-04-15 12:22:33,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {20369#true} call ULTIMATE.init(); {20369#true} is VALID [2022-04-15 12:22:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 560 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-15 12:22:33,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957428013] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:22:33,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:22:33,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 38, 6] total 42 [2022-04-15 12:22:33,249 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:22:33,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [658919852] [2022-04-15 12:22:33,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [658919852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:22:33,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:22:33,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 12:22:33,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627451778] [2022-04-15 12:22:33,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:22:33,250 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:22:33,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:22:33,250 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:22:34,475 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:22:34,475 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 12:22:34,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:34,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 12:22:34,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1574, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:22:34,476 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:23:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:11,458 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-04-15 12:23:11,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 12:23:11,459 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:23:11,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:23:11,459 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:23:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 89 transitions. [2022-04-15 12:23:11,460 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:23:11,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 89 transitions. [2022-04-15 12:23:11,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 89 transitions. [2022-04-15 12:23:12,924 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:23:12,925 INFO L225 Difference]: With dead ends: 88 [2022-04-15 12:23:12,925 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 12:23:12,926 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 148 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=376, Invalid=5174, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 12:23:12,926 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:23:12,926 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 34 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 14.8s Time] [2022-04-15 12:23:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 12:23:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-15 12:23:13,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:23:13,103 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:23:13,103 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:23:13,103 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:23:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:13,104 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2022-04-15 12:23:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-04-15 12:23:13,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:13,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:13,104 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:23:13,104 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:23:13,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:13,105 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2022-04-15 12:23:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-04-15 12:23:13,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:13,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:13,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:23:13,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:23:13,105 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:23:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2022-04-15 12:23:13,106 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 77 [2022-04-15 12:23:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:23:13,106 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2022-04-15 12:23:13,106 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:23:13,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 83 transitions. [2022-04-15 12:23:14,012 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:23:14,012 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-04-15 12:23:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 12:23:14,012 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:23:14,012 INFO L499 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:23:14,029 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:23:14,213 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:23:14,213 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:23:14,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:23:14,213 INFO L85 PathProgramCache]: Analyzing trace with hash -21062790, now seen corresponding path program 65 times [2022-04-15 12:23:14,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:14,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [344361701] [2022-04-15 12:23:14,429 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:23:14,431 INFO L85 PathProgramCache]: Analyzing trace with hash 647300849, now seen corresponding path program 1 times [2022-04-15 12:23:14,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:23:14,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238881761] [2022-04-15 12:23:14,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:23:14,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:23:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:23:14,437 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:23:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:23:14,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:23:14,442 INFO L85 PathProgramCache]: Analyzing trace with hash -21062790, now seen corresponding path program 66 times [2022-04-15 12:23:14,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:23:14,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307398005] [2022-04-15 12:23:14,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:23:14,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:23:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:15,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:23:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:15,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {21480#(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(13, 2);call #Ultimate.allocInit(12, 3); {21441#true} is VALID [2022-04-15 12:23:15,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {21441#true} assume true; {21441#true} is VALID [2022-04-15 12:23:15,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21441#true} {21441#true} #40#return; {21441#true} is VALID [2022-04-15 12:23:15,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {21441#true} call ULTIMATE.init(); {21480#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:23:15,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {21480#(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(13, 2);call #Ultimate.allocInit(12, 3); {21441#true} is VALID [2022-04-15 12:23:15,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {21441#true} assume true; {21441#true} is VALID [2022-04-15 12:23:15,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21441#true} {21441#true} #40#return; {21441#true} is VALID [2022-04-15 12:23:15,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {21441#true} call #t~ret5 := main(); {21441#true} is VALID [2022-04-15 12:23:15,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {21441#true} ~x~0 := 0; {21446#(= main_~x~0 0)} is VALID [2022-04-15 12:23:15,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {21446#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {21446#(= main_~x~0 0)} is VALID [2022-04-15 12:23:15,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {21446#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21447#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:23:15,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {21447#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {21447#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:23:15,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {21447#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21448#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:23:15,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {21448#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {21448#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:23:15,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {21448#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21449#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:23:15,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {21449#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21449#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:23:15,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {21449#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21450#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:23:15,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {21450#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21450#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:23:15,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {21450#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21451#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:23:15,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {21451#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {21451#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:23:15,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {21451#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21452#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:23:15,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {21452#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {21452#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:23:15,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {21452#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21453#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:23:15,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {21453#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21453#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:23:15,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {21453#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21454#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:23:15,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {21454#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21454#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:23:15,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {21454#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21455#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:23:15,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {21455#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21455#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:23:15,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {21455#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21456#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:23:15,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {21456#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21456#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:23:15,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {21456#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21457#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:23:15,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {21457#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21457#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:23:15,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {21457#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21458#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:23:15,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {21458#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21458#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:23:15,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {21458#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21459#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:23:15,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {21459#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21459#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:23:15,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {21459#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21460#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:23:15,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {21460#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {21460#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:23:15,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {21460#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21461#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:23:15,390 INFO L290 TraceCheckUtils]: 36: Hoare triple {21461#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {21461#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:23:15,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {21461#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21462#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:23:15,415 INFO L290 TraceCheckUtils]: 38: Hoare triple {21462#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21462#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:23:15,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {21462#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21463#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:23:15,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {21463#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {21463#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:23:15,440 INFO L290 TraceCheckUtils]: 41: Hoare triple {21463#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21464#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:23:15,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {21464#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21464#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:23:15,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {21464#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21465#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:23:15,446 INFO L290 TraceCheckUtils]: 44: Hoare triple {21465#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {21465#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:23:15,466 INFO L290 TraceCheckUtils]: 45: Hoare triple {21465#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21466#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:23:15,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {21466#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21466#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:23:15,488 INFO L290 TraceCheckUtils]: 47: Hoare triple {21466#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21467#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:23:15,488 INFO L290 TraceCheckUtils]: 48: Hoare triple {21467#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {21467#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:23:15,515 INFO L290 TraceCheckUtils]: 49: Hoare triple {21467#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21468#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:23:15,515 INFO L290 TraceCheckUtils]: 50: Hoare triple {21468#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {21468#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:23:15,541 INFO L290 TraceCheckUtils]: 51: Hoare triple {21468#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21469#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:23:15,541 INFO L290 TraceCheckUtils]: 52: Hoare triple {21469#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {21469#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:23:15,568 INFO L290 TraceCheckUtils]: 53: Hoare triple {21469#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21470#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:23:15,568 INFO L290 TraceCheckUtils]: 54: Hoare triple {21470#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21470#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:23:15,594 INFO L290 TraceCheckUtils]: 55: Hoare triple {21470#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21471#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:23:15,595 INFO L290 TraceCheckUtils]: 56: Hoare triple {21471#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21471#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:23:15,621 INFO L290 TraceCheckUtils]: 57: Hoare triple {21471#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21472#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:23:15,621 INFO L290 TraceCheckUtils]: 58: Hoare triple {21472#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21472#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:23:15,626 INFO L290 TraceCheckUtils]: 59: Hoare triple {21472#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21473#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:23:15,626 INFO L290 TraceCheckUtils]: 60: Hoare triple {21473#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {21473#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:23:15,630 INFO L290 TraceCheckUtils]: 61: Hoare triple {21473#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21474#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:23:15,630 INFO L290 TraceCheckUtils]: 62: Hoare triple {21474#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {21474#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:23:15,657 INFO L290 TraceCheckUtils]: 63: Hoare triple {21474#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21475#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:23:15,657 INFO L290 TraceCheckUtils]: 64: Hoare triple {21475#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21475#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:23:15,680 INFO L290 TraceCheckUtils]: 65: Hoare triple {21475#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21476#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:23:15,680 INFO L290 TraceCheckUtils]: 66: Hoare triple {21476#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455); {21476#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:23:15,703 INFO L290 TraceCheckUtils]: 67: Hoare triple {21476#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21477#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:23:15,704 INFO L290 TraceCheckUtils]: 68: Hoare triple {21477#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 268435455); {21477#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:23:15,730 INFO L290 TraceCheckUtils]: 69: Hoare triple {21477#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21478#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:23:15,730 INFO L290 TraceCheckUtils]: 70: Hoare triple {21478#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {21478#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:23:15,757 INFO L290 TraceCheckUtils]: 71: Hoare triple {21478#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21479#(and (<= main_~x~0 33) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:23:15,757 INFO L290 TraceCheckUtils]: 72: Hoare triple {21479#(and (<= main_~x~0 33) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {21479#(and (<= main_~x~0 33) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:23:15,763 INFO L290 TraceCheckUtils]: 73: Hoare triple {21479#(and (<= main_~x~0 33) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {21442#false} is VALID [2022-04-15 12:23:15,763 INFO L290 TraceCheckUtils]: 74: Hoare triple {21442#false} assume !(~x~0 % 4294967296 < 268435455); {21442#false} is VALID [2022-04-15 12:23:15,763 INFO L272 TraceCheckUtils]: 75: Hoare triple {21442#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {21442#false} is VALID [2022-04-15 12:23:15,763 INFO L290 TraceCheckUtils]: 76: Hoare triple {21442#false} ~cond := #in~cond; {21442#false} is VALID [2022-04-15 12:23:15,763 INFO L290 TraceCheckUtils]: 77: Hoare triple {21442#false} assume 0 == ~cond; {21442#false} is VALID [2022-04-15 12:23:15,763 INFO L290 TraceCheckUtils]: 78: Hoare triple {21442#false} assume !false; {21442#false} is VALID [2022-04-15 12:23:15,764 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:23:15,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:23:15,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307398005] [2022-04-15 12:23:15,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307398005] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:23:15,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889195556] [2022-04-15 12:23:15,764 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:23:15,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:23:15,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:23:15,765 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:23:15,766 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:23:15,817 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:23:15,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:23:15,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:23:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:15,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:23:16,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {21441#true} call ULTIMATE.init(); {21441#true} is VALID [2022-04-15 12:23:16,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {21441#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(13, 2);call #Ultimate.allocInit(12, 3); {21441#true} is VALID [2022-04-15 12:23:16,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {21441#true} assume true; {21441#true} is VALID [2022-04-15 12:23:16,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21441#true} {21441#true} #40#return; {21441#true} is VALID [2022-04-15 12:23:16,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {21441#true} call #t~ret5 := main(); {21441#true} is VALID [2022-04-15 12:23:16,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {21441#true} ~x~0 := 0; {21441#true} is VALID [2022-04-15 12:23:16,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 34: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 41: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 42: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 43: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,347 INFO L290 TraceCheckUtils]: 44: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 45: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 46: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 47: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 48: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 49: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 50: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 51: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 52: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 53: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 54: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 55: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 56: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 57: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 58: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 59: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 60: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 61: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 62: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,348 INFO L290 TraceCheckUtils]: 63: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,349 INFO L290 TraceCheckUtils]: 64: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,349 INFO L290 TraceCheckUtils]: 65: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,349 INFO L290 TraceCheckUtils]: 66: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,349 INFO L290 TraceCheckUtils]: 67: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,349 INFO L290 TraceCheckUtils]: 68: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,349 INFO L290 TraceCheckUtils]: 69: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:16,349 INFO L290 TraceCheckUtils]: 70: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:16,384 INFO L290 TraceCheckUtils]: 71: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21697#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:23:16,385 INFO L290 TraceCheckUtils]: 72: Hoare triple {21697#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {21697#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:23:16,390 INFO L290 TraceCheckUtils]: 73: Hoare triple {21697#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {21704#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} is VALID [2022-04-15 12:23:16,394 INFO L290 TraceCheckUtils]: 74: Hoare triple {21704#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 268435455); {21442#false} is VALID [2022-04-15 12:23:16,394 INFO L272 TraceCheckUtils]: 75: Hoare triple {21442#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {21442#false} is VALID [2022-04-15 12:23:16,394 INFO L290 TraceCheckUtils]: 76: Hoare triple {21442#false} ~cond := #in~cond; {21442#false} is VALID [2022-04-15 12:23:16,394 INFO L290 TraceCheckUtils]: 77: Hoare triple {21442#false} assume 0 == ~cond; {21442#false} is VALID [2022-04-15 12:23:16,394 INFO L290 TraceCheckUtils]: 78: Hoare triple {21442#false} assume !false; {21442#false} is VALID [2022-04-15 12:23:16,395 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:23:16,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:23:17,661 INFO L290 TraceCheckUtils]: 78: Hoare triple {21442#false} assume !false; {21442#false} is VALID [2022-04-15 12:23:17,661 INFO L290 TraceCheckUtils]: 77: Hoare triple {21442#false} assume 0 == ~cond; {21442#false} is VALID [2022-04-15 12:23:17,661 INFO L290 TraceCheckUtils]: 76: Hoare triple {21442#false} ~cond := #in~cond; {21442#false} is VALID [2022-04-15 12:23:17,661 INFO L272 TraceCheckUtils]: 75: Hoare triple {21442#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {21442#false} is VALID [2022-04-15 12:23:17,662 INFO L290 TraceCheckUtils]: 74: Hoare triple {21732#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {21442#false} is VALID [2022-04-15 12:23:17,666 INFO L290 TraceCheckUtils]: 73: Hoare triple {21736#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {21732#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:23:17,667 INFO L290 TraceCheckUtils]: 72: Hoare triple {21736#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {21736#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:23:17,692 INFO L290 TraceCheckUtils]: 71: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21736#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:23:17,692 INFO L290 TraceCheckUtils]: 70: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,692 INFO L290 TraceCheckUtils]: 69: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,692 INFO L290 TraceCheckUtils]: 68: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,692 INFO L290 TraceCheckUtils]: 67: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,692 INFO L290 TraceCheckUtils]: 66: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,692 INFO L290 TraceCheckUtils]: 65: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,692 INFO L290 TraceCheckUtils]: 64: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,692 INFO L290 TraceCheckUtils]: 63: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,692 INFO L290 TraceCheckUtils]: 62: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 61: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 60: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 59: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 56: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 55: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 54: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 53: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 52: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 51: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 50: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 49: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 48: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 47: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 46: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 45: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 44: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,693 INFO L290 TraceCheckUtils]: 42: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 41: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 40: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {21441#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {21441#true} assume !!(~x~0 % 4294967296 < 268435455); {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {21441#true} ~x~0 := 0; {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {21441#true} call #t~ret5 := main(); {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21441#true} {21441#true} #40#return; {21441#true} is VALID [2022-04-15 12:23:17,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {21441#true} assume true; {21441#true} is VALID [2022-04-15 12:23:17,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {21441#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(13, 2);call #Ultimate.allocInit(12, 3); {21441#true} is VALID [2022-04-15 12:23:17,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {21441#true} call ULTIMATE.init(); {21441#true} is VALID [2022-04-15 12:23:17,696 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:23:17,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889195556] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:23:17,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:23:17,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 4, 4] total 41 [2022-04-15 12:23:17,696 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:23:17,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [344361701] [2022-04-15 12:23:17,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [344361701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:23:17,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:23:17,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 12:23:17,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324761321] [2022-04-15 12:23:17,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:23:17,697 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:23:17,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:23:17,697 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:23:19,100 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:23:19,101 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 12:23:19,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:19,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 12:23:19,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1394, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:23:19,101 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:24:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:20,140 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-04-15 12:24:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 12:24:20,141 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:24:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:24:20,141 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:24:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 91 transitions. [2022-04-15 12:24:20,142 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:24:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 91 transitions. [2022-04-15 12:24:20,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 91 transitions. [2022-04-15 12:24:21,052 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:24:21,053 INFO L225 Difference]: With dead ends: 90 [2022-04-15 12:24:21,053 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 12:24:21,053 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=578, Invalid=4972, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 12:24:21,053 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2376 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 2445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:24:21,054 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 149 Invalid, 2445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2376 Invalid, 0 Unknown, 0 Unchecked, 24.7s Time] [2022-04-15 12:24:21,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 12:24:21,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-15 12:24:21,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:24:21,224 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:24:21,224 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:24:21,224 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:24:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:21,225 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2022-04-15 12:24:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2022-04-15 12:24:21,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:21,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:21,226 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:24:21,226 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:24:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:24:21,226 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2022-04-15 12:24:21,226 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2022-04-15 12:24:21,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:24:21,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:24:21,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:24:21,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:24:21,227 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:24:21,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2022-04-15 12:24:21,228 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 79 [2022-04-15 12:24:21,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:24:21,228 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2022-04-15 12:24:21,228 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:24:21,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 85 transitions. [2022-04-15 12:24:22,029 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:24:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2022-04-15 12:24:22,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 12:24:22,030 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:24:22,030 INFO L499 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:24:22,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-15 12:24:22,235 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:24:22,235 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:24:22,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:24:22,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1119534953, now seen corresponding path program 67 times [2022-04-15 12:24:22,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:22,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1750499506] [2022-04-15 12:24:22,440 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:24:22,442 INFO L85 PathProgramCache]: Analyzing trace with hash 706406193, now seen corresponding path program 1 times [2022-04-15 12:24:22,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:24:22,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465666028] [2022-04-15 12:24:22,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:24:22,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:24:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:24:22,452 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:24:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:24:22,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:24:22,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1119534953, now seen corresponding path program 68 times [2022-04-15 12:24:22,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:24:22,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306294487] [2022-04-15 12:24:22,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:24:22,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:24:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:23,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:24:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:23,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {22578#(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(13, 2);call #Ultimate.allocInit(12, 3); {22538#true} is VALID [2022-04-15 12:24:23,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {22538#true} assume true; {22538#true} is VALID [2022-04-15 12:24:23,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22538#true} {22538#true} #40#return; {22538#true} is VALID [2022-04-15 12:24:23,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {22538#true} call ULTIMATE.init(); {22578#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:24:23,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {22578#(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(13, 2);call #Ultimate.allocInit(12, 3); {22538#true} is VALID [2022-04-15 12:24:23,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {22538#true} assume true; {22538#true} is VALID [2022-04-15 12:24:23,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22538#true} {22538#true} #40#return; {22538#true} is VALID [2022-04-15 12:24:23,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {22538#true} call #t~ret5 := main(); {22538#true} is VALID [2022-04-15 12:24:23,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {22538#true} ~x~0 := 0; {22543#(= main_~x~0 0)} is VALID [2022-04-15 12:24:23,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {22543#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {22543#(= main_~x~0 0)} is VALID [2022-04-15 12:24:23,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {22543#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22544#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:24:23,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {22544#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {22544#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:24:23,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {22544#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22545#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:24:23,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {22545#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {22545#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:24:23,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {22545#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22546#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:24:23,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {22546#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22546#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:24:23,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {22546#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22547#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:24:23,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {22547#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22547#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:24:23,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {22547#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22548#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:24:23,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {22548#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {22548#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:24:23,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {22548#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22549#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:24:23,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {22549#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {22549#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:24:23,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {22549#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22550#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:24:23,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {22550#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22550#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:24:23,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {22550#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22551#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:24:23,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {22551#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22551#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:24:23,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {22551#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22552#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:24:23,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {22552#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22552#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:24:23,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {22552#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22553#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:24:23,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {22553#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22553#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:24:23,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {22553#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22554#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:24:23,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {22554#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22554#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:24:23,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {22554#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:24:23,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {22555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:24:23,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {22555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22556#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:24:23,344 INFO L290 TraceCheckUtils]: 32: Hoare triple {22556#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22556#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:24:23,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {22556#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22557#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:24:23,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {22557#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {22557#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:24:23,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {22557#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22558#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:24:23,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {22558#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {22558#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:24:23,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {22558#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22559#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:24:23,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {22559#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22559#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:24:23,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {22559#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22560#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:24:23,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {22560#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {22560#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:24:23,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {22560#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22561#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:24:23,396 INFO L290 TraceCheckUtils]: 42: Hoare triple {22561#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22561#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:24:23,399 INFO L290 TraceCheckUtils]: 43: Hoare triple {22561#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22562#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:24:23,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {22562#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {22562#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:24:23,416 INFO L290 TraceCheckUtils]: 45: Hoare triple {22562#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22563#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:24:23,417 INFO L290 TraceCheckUtils]: 46: Hoare triple {22563#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22563#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:24:23,431 INFO L290 TraceCheckUtils]: 47: Hoare triple {22563#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22564#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:24:23,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {22564#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {22564#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:24:23,445 INFO L290 TraceCheckUtils]: 49: Hoare triple {22564#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22565#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:24:23,445 INFO L290 TraceCheckUtils]: 50: Hoare triple {22565#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {22565#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:24:23,460 INFO L290 TraceCheckUtils]: 51: Hoare triple {22565#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22566#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:24:23,460 INFO L290 TraceCheckUtils]: 52: Hoare triple {22566#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {22566#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:24:23,473 INFO L290 TraceCheckUtils]: 53: Hoare triple {22566#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22567#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:24:23,474 INFO L290 TraceCheckUtils]: 54: Hoare triple {22567#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22567#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:24:23,493 INFO L290 TraceCheckUtils]: 55: Hoare triple {22567#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22568#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:24:23,494 INFO L290 TraceCheckUtils]: 56: Hoare triple {22568#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22568#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:24:23,514 INFO L290 TraceCheckUtils]: 57: Hoare triple {22568#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22569#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:24:23,515 INFO L290 TraceCheckUtils]: 58: Hoare triple {22569#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22569#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:24:23,520 INFO L290 TraceCheckUtils]: 59: Hoare triple {22569#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22570#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:24:23,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {22570#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {22570#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:24:23,524 INFO L290 TraceCheckUtils]: 61: Hoare triple {22570#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22571#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:24:23,524 INFO L290 TraceCheckUtils]: 62: Hoare triple {22571#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {22571#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:24:23,548 INFO L290 TraceCheckUtils]: 63: Hoare triple {22571#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22572#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:24:23,549 INFO L290 TraceCheckUtils]: 64: Hoare triple {22572#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22572#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:24:23,567 INFO L290 TraceCheckUtils]: 65: Hoare triple {22572#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22573#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:24:23,568 INFO L290 TraceCheckUtils]: 66: Hoare triple {22573#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455); {22573#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:24:23,587 INFO L290 TraceCheckUtils]: 67: Hoare triple {22573#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22574#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:24:23,587 INFO L290 TraceCheckUtils]: 68: Hoare triple {22574#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 268435455); {22574#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:24:23,604 INFO L290 TraceCheckUtils]: 69: Hoare triple {22574#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22575#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:24:23,605 INFO L290 TraceCheckUtils]: 70: Hoare triple {22575#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22575#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:24:23,622 INFO L290 TraceCheckUtils]: 71: Hoare triple {22575#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22576#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:24:23,622 INFO L290 TraceCheckUtils]: 72: Hoare triple {22576#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22576#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:24:23,640 INFO L290 TraceCheckUtils]: 73: Hoare triple {22576#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22577#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:24:23,641 INFO L290 TraceCheckUtils]: 74: Hoare triple {22577#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {22577#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:24:23,644 INFO L290 TraceCheckUtils]: 75: Hoare triple {22577#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {22539#false} is VALID [2022-04-15 12:24:23,645 INFO L290 TraceCheckUtils]: 76: Hoare triple {22539#false} assume !(~x~0 % 4294967296 < 268435455); {22539#false} is VALID [2022-04-15 12:24:23,645 INFO L272 TraceCheckUtils]: 77: Hoare triple {22539#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22539#false} is VALID [2022-04-15 12:24:23,645 INFO L290 TraceCheckUtils]: 78: Hoare triple {22539#false} ~cond := #in~cond; {22539#false} is VALID [2022-04-15 12:24:23,645 INFO L290 TraceCheckUtils]: 79: Hoare triple {22539#false} assume 0 == ~cond; {22539#false} is VALID [2022-04-15 12:24:23,645 INFO L290 TraceCheckUtils]: 80: Hoare triple {22539#false} assume !false; {22539#false} is VALID [2022-04-15 12:24:23,645 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:24:23,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:24:23,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306294487] [2022-04-15 12:24:23,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306294487] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:24:23,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333150896] [2022-04-15 12:24:23,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:24:23,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:24:23,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:24:23,647 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:24:23,647 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:24:23,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:24:23,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:24:23,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 75 conjunts are in the unsatisfiable core [2022-04-15 12:24:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:24:23,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:24:24,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {22538#true} call ULTIMATE.init(); {22538#true} is VALID [2022-04-15 12:24:24,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {22538#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(13, 2);call #Ultimate.allocInit(12, 3); {22538#true} is VALID [2022-04-15 12:24:24,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {22538#true} assume true; {22538#true} is VALID [2022-04-15 12:24:24,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22538#true} {22538#true} #40#return; {22538#true} is VALID [2022-04-15 12:24:24,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {22538#true} call #t~ret5 := main(); {22538#true} is VALID [2022-04-15 12:24:24,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {22538#true} ~x~0 := 0; {22543#(= main_~x~0 0)} is VALID [2022-04-15 12:24:24,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {22543#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {22543#(= main_~x~0 0)} is VALID [2022-04-15 12:24:24,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {22543#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22544#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:24:24,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {22544#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {22544#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:24:24,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {22544#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22545#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:24:24,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {22545#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {22545#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:24:24,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {22545#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22546#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:24:24,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {22546#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22546#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:24:24,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {22546#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22547#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:24:24,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {22547#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22547#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:24:24,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {22547#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22548#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:24:24,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {22548#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {22548#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:24:24,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {22548#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22549#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:24:24,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {22549#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {22549#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:24:24,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {22549#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22550#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:24:24,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {22550#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22550#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:24:24,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {22550#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22551#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:24:24,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {22551#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22551#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:24:24,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {22551#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22552#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:24:24,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {22552#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22552#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:24:24,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {22552#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22553#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:24:24,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {22553#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22553#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:24:24,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {22553#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22554#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:24:24,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {22554#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22554#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:24:24,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {22554#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:24:24,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {22555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:24:24,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {22555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22556#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:24:24,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {22556#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22556#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:24:24,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {22556#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22557#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:24:24,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {22557#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {22557#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:24:24,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {22557#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22558#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:24:24,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {22558#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {22558#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:24:24,651 INFO L290 TraceCheckUtils]: 37: Hoare triple {22558#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22559#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:24:24,651 INFO L290 TraceCheckUtils]: 38: Hoare triple {22559#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22559#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:24:24,667 INFO L290 TraceCheckUtils]: 39: Hoare triple {22559#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22560#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:24:24,668 INFO L290 TraceCheckUtils]: 40: Hoare triple {22560#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {22560#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:24:24,671 INFO L290 TraceCheckUtils]: 41: Hoare triple {22560#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22561#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:24:24,671 INFO L290 TraceCheckUtils]: 42: Hoare triple {22561#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22561#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:24:24,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {22561#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22562#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:24:24,675 INFO L290 TraceCheckUtils]: 44: Hoare triple {22562#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {22562#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:24:24,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {22562#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22563#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:24:24,697 INFO L290 TraceCheckUtils]: 46: Hoare triple {22563#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22563#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:24:24,721 INFO L290 TraceCheckUtils]: 47: Hoare triple {22563#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22564#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:24:24,722 INFO L290 TraceCheckUtils]: 48: Hoare triple {22564#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {22564#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:24:24,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {22564#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22565#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:24:24,746 INFO L290 TraceCheckUtils]: 50: Hoare triple {22565#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {22565#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:24:24,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {22565#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22566#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:24:24,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {22566#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {22566#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:24:24,789 INFO L290 TraceCheckUtils]: 53: Hoare triple {22566#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22567#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:24:24,789 INFO L290 TraceCheckUtils]: 54: Hoare triple {22567#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22567#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:24:24,810 INFO L290 TraceCheckUtils]: 55: Hoare triple {22567#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22568#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:24:24,811 INFO L290 TraceCheckUtils]: 56: Hoare triple {22568#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22568#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:24:24,832 INFO L290 TraceCheckUtils]: 57: Hoare triple {22568#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22569#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:24:24,833 INFO L290 TraceCheckUtils]: 58: Hoare triple {22569#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22569#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:24:24,838 INFO L290 TraceCheckUtils]: 59: Hoare triple {22569#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22570#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:24:24,838 INFO L290 TraceCheckUtils]: 60: Hoare triple {22570#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {22570#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:24:24,841 INFO L290 TraceCheckUtils]: 61: Hoare triple {22570#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22571#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:24:24,842 INFO L290 TraceCheckUtils]: 62: Hoare triple {22571#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {22571#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:24:24,863 INFO L290 TraceCheckUtils]: 63: Hoare triple {22571#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22572#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:24:24,864 INFO L290 TraceCheckUtils]: 64: Hoare triple {22572#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22572#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:24:24,880 INFO L290 TraceCheckUtils]: 65: Hoare triple {22572#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22573#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:24:24,881 INFO L290 TraceCheckUtils]: 66: Hoare triple {22573#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455); {22573#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:24:24,900 INFO L290 TraceCheckUtils]: 67: Hoare triple {22573#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22574#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:24:24,901 INFO L290 TraceCheckUtils]: 68: Hoare triple {22574#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 268435455); {22574#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:24:24,919 INFO L290 TraceCheckUtils]: 69: Hoare triple {22574#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22575#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:24:24,920 INFO L290 TraceCheckUtils]: 70: Hoare triple {22575#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22575#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:24:24,938 INFO L290 TraceCheckUtils]: 71: Hoare triple {22575#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22576#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:24:24,939 INFO L290 TraceCheckUtils]: 72: Hoare triple {22576#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22576#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:24:24,955 INFO L290 TraceCheckUtils]: 73: Hoare triple {22576#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22801#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:24:24,955 INFO L290 TraceCheckUtils]: 74: Hoare triple {22801#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {22801#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:24:24,956 INFO L290 TraceCheckUtils]: 75: Hoare triple {22801#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {22808#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:24:24,957 INFO L290 TraceCheckUtils]: 76: Hoare triple {22808#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {22808#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:24:24,958 INFO L272 TraceCheckUtils]: 77: Hoare triple {22808#(and (<= main_~x~0 36) (<= 36 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22815#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:24:24,958 INFO L290 TraceCheckUtils]: 78: Hoare triple {22815#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22819#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:24:24,958 INFO L290 TraceCheckUtils]: 79: Hoare triple {22819#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22539#false} is VALID [2022-04-15 12:24:24,958 INFO L290 TraceCheckUtils]: 80: Hoare triple {22539#false} assume !false; {22539#false} is VALID [2022-04-15 12:24:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:24:24,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:24:25,281 INFO L290 TraceCheckUtils]: 80: Hoare triple {22539#false} assume !false; {22539#false} is VALID [2022-04-15 12:24:25,282 INFO L290 TraceCheckUtils]: 79: Hoare triple {22819#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22539#false} is VALID [2022-04-15 12:24:25,282 INFO L290 TraceCheckUtils]: 78: Hoare triple {22815#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22819#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:24:25,282 INFO L272 TraceCheckUtils]: 77: Hoare triple {22835#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22815#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:24:25,283 INFO L290 TraceCheckUtils]: 76: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,284 INFO L290 TraceCheckUtils]: 75: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,284 INFO L290 TraceCheckUtils]: 74: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,303 INFO L290 TraceCheckUtils]: 73: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,304 INFO L290 TraceCheckUtils]: 72: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,306 INFO L290 TraceCheckUtils]: 71: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,306 INFO L290 TraceCheckUtils]: 70: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,323 INFO L290 TraceCheckUtils]: 69: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,324 INFO L290 TraceCheckUtils]: 68: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,325 INFO L290 TraceCheckUtils]: 67: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,326 INFO L290 TraceCheckUtils]: 66: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,343 INFO L290 TraceCheckUtils]: 65: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,343 INFO L290 TraceCheckUtils]: 64: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,345 INFO L290 TraceCheckUtils]: 63: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,345 INFO L290 TraceCheckUtils]: 62: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,366 INFO L290 TraceCheckUtils]: 61: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,367 INFO L290 TraceCheckUtils]: 60: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,369 INFO L290 TraceCheckUtils]: 59: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,369 INFO L290 TraceCheckUtils]: 58: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,394 INFO L290 TraceCheckUtils]: 57: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,395 INFO L290 TraceCheckUtils]: 56: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,397 INFO L290 TraceCheckUtils]: 55: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,422 INFO L290 TraceCheckUtils]: 52: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,424 INFO L290 TraceCheckUtils]: 51: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,424 INFO L290 TraceCheckUtils]: 50: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,448 INFO L290 TraceCheckUtils]: 48: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,450 INFO L290 TraceCheckUtils]: 46: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,475 INFO L290 TraceCheckUtils]: 45: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,475 INFO L290 TraceCheckUtils]: 44: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,506 INFO L290 TraceCheckUtils]: 41: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,508 INFO L290 TraceCheckUtils]: 39: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,536 INFO L290 TraceCheckUtils]: 36: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {22848#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22848#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:24:25,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {22835#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {22538#true} ~x~0 := 0; {22835#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:24:25,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {22538#true} call #t~ret5 := main(); {22538#true} is VALID [2022-04-15 12:24:25,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22538#true} {22538#true} #40#return; {22538#true} is VALID [2022-04-15 12:24:25,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {22538#true} assume true; {22538#true} is VALID [2022-04-15 12:24:25,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {22538#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(13, 2);call #Ultimate.allocInit(12, 3); {22538#true} is VALID [2022-04-15 12:24:25,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {22538#true} call ULTIMATE.init(); {22538#true} is VALID [2022-04-15 12:24:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 629 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2022-04-15 12:24:25,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333150896] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:24:25,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:24:25,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 40, 6] total 44 [2022-04-15 12:24:25,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:24:25,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1750499506] [2022-04-15 12:24:25,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1750499506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:24:25,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:24:25,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 12:24:25,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639651465] [2022-04-15 12:24:25,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:24:25,689 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:24:25,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:24:25,689 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:24:26,492 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:24:26,493 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 12:24:26,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:24:26,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 12:24:26,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1736, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 12:24:26,493 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:25:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:22,889 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-15 12:25:22,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 12:25:22,893 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:25:22,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:25:22,893 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:25:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 93 transitions. [2022-04-15 12:25:22,894 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:25:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 93 transitions. [2022-04-15 12:25:22,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 93 transitions. [2022-04-15 12:25:24,083 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:25:24,084 INFO L225 Difference]: With dead ends: 92 [2022-04-15 12:25:24,084 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 12:25:24,085 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 156 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=398, Invalid=5764, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 12:25:24,085 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:25:24,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 124 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 22.2s Time] [2022-04-15 12:25:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 12:25:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-15 12:25:24,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:25:24,287 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:25:24,288 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:25:24,288 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:25:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:24,289 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2022-04-15 12:25:24,289 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2022-04-15 12:25:24,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:25:24,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:25:24,289 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:25:24,289 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:25:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:24,290 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2022-04-15 12:25:24,290 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2022-04-15 12:25:24,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:25:24,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:25:24,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:25:24,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:25:24,291 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:25:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2022-04-15 12:25:24,292 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 81 [2022-04-15 12:25:24,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:25:24,292 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2022-04-15 12:25:24,292 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:25:24,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 87 transitions. [2022-04-15 12:25:25,184 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:25:25,185 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2022-04-15 12:25:25,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 12:25:25,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:25:25,185 INFO L499 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:25:25,202 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:25:25,394 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:25:25,394 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:25:25,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:25:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash -189328780, now seen corresponding path program 69 times [2022-04-15 12:25:25,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:25,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [299806339] [2022-04-15 12:25:25,548 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:25:25,550 INFO L85 PathProgramCache]: Analyzing trace with hash 765511537, now seen corresponding path program 1 times [2022-04-15 12:25:25,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:25:25,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318453825] [2022-04-15 12:25:25,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:25:25,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:25:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:25:25,555 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:25:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:25:25,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:25:25,558 INFO L85 PathProgramCache]: Analyzing trace with hash -189328780, now seen corresponding path program 70 times [2022-04-15 12:25:25,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:25:25,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449616232] [2022-04-15 12:25:25,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:25:25,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:25:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:26,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:25:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:26,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {23705#(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(13, 2);call #Ultimate.allocInit(12, 3); {23664#true} is VALID [2022-04-15 12:25:26,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {23664#true} assume true; {23664#true} is VALID [2022-04-15 12:25:26,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23664#true} {23664#true} #40#return; {23664#true} is VALID [2022-04-15 12:25:26,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {23664#true} call ULTIMATE.init(); {23705#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:25:26,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {23705#(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(13, 2);call #Ultimate.allocInit(12, 3); {23664#true} is VALID [2022-04-15 12:25:26,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {23664#true} assume true; {23664#true} is VALID [2022-04-15 12:25:26,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23664#true} {23664#true} #40#return; {23664#true} is VALID [2022-04-15 12:25:26,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {23664#true} call #t~ret5 := main(); {23664#true} is VALID [2022-04-15 12:25:26,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {23664#true} ~x~0 := 0; {23669#(= main_~x~0 0)} is VALID [2022-04-15 12:25:26,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {23669#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {23669#(= main_~x~0 0)} is VALID [2022-04-15 12:25:26,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {23669#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23670#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:25:26,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {23670#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {23670#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:25:26,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {23670#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23671#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:25:26,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {23671#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {23671#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:25:26,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {23671#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23672#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:25:26,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {23672#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23672#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:25:26,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {23672#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23673#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:25:26,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {23673#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23673#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:25:26,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {23673#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23674#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:25:26,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {23674#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {23674#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:25:26,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {23674#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23675#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:25:26,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {23675#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {23675#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:25:26,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {23675#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23676#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:25:26,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {23676#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23676#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:25:26,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {23676#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23677#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:25:26,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {23677#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23677#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:25:26,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {23677#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23678#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:25:26,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {23678#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23678#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:25:26,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {23678#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23679#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:25:26,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {23679#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23679#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:25:26,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {23679#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23680#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:25:26,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {23680#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23680#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:25:26,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {23680#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23681#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:25:26,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {23681#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23681#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:25:26,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {23681#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23682#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:25:26,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {23682#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23682#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:25:26,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {23682#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23683#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:25:26,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {23683#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {23683#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:25:26,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {23683#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23684#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:25:26,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {23684#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {23684#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:25:26,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {23684#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23685#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:25:26,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {23685#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23685#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:25:26,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {23685#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23686#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:25:26,717 INFO L290 TraceCheckUtils]: 40: Hoare triple {23686#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {23686#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:25:26,721 INFO L290 TraceCheckUtils]: 41: Hoare triple {23686#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23687#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:25:26,721 INFO L290 TraceCheckUtils]: 42: Hoare triple {23687#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23687#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:25:26,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {23687#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23688#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:25:26,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {23688#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {23688#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:25:26,755 INFO L290 TraceCheckUtils]: 45: Hoare triple {23688#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23689#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:25:26,755 INFO L290 TraceCheckUtils]: 46: Hoare triple {23689#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23689#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:25:26,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {23689#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23690#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:25:26,787 INFO L290 TraceCheckUtils]: 48: Hoare triple {23690#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {23690#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:25:26,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {23690#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23691#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:25:26,818 INFO L290 TraceCheckUtils]: 50: Hoare triple {23691#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {23691#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:25:26,847 INFO L290 TraceCheckUtils]: 51: Hoare triple {23691#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23692#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:25:26,848 INFO L290 TraceCheckUtils]: 52: Hoare triple {23692#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {23692#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:25:26,878 INFO L290 TraceCheckUtils]: 53: Hoare triple {23692#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23693#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:25:26,878 INFO L290 TraceCheckUtils]: 54: Hoare triple {23693#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23693#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:25:26,909 INFO L290 TraceCheckUtils]: 55: Hoare triple {23693#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23694#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:25:26,909 INFO L290 TraceCheckUtils]: 56: Hoare triple {23694#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23694#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:25:26,939 INFO L290 TraceCheckUtils]: 57: Hoare triple {23694#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23695#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:25:26,939 INFO L290 TraceCheckUtils]: 58: Hoare triple {23695#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23695#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:25:26,944 INFO L290 TraceCheckUtils]: 59: Hoare triple {23695#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23696#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:25:26,945 INFO L290 TraceCheckUtils]: 60: Hoare triple {23696#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {23696#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:25:26,948 INFO L290 TraceCheckUtils]: 61: Hoare triple {23696#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23697#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:25:26,949 INFO L290 TraceCheckUtils]: 62: Hoare triple {23697#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {23697#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:25:26,979 INFO L290 TraceCheckUtils]: 63: Hoare triple {23697#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23698#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:25:26,980 INFO L290 TraceCheckUtils]: 64: Hoare triple {23698#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23698#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:25:27,010 INFO L290 TraceCheckUtils]: 65: Hoare triple {23698#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23699#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:25:27,011 INFO L290 TraceCheckUtils]: 66: Hoare triple {23699#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455); {23699#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:25:27,043 INFO L290 TraceCheckUtils]: 67: Hoare triple {23699#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23700#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:25:27,043 INFO L290 TraceCheckUtils]: 68: Hoare triple {23700#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 268435455); {23700#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:25:27,074 INFO L290 TraceCheckUtils]: 69: Hoare triple {23700#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23701#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:25:27,075 INFO L290 TraceCheckUtils]: 70: Hoare triple {23701#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23701#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:25:27,108 INFO L290 TraceCheckUtils]: 71: Hoare triple {23701#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23702#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:25:27,108 INFO L290 TraceCheckUtils]: 72: Hoare triple {23702#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23702#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:25:27,141 INFO L290 TraceCheckUtils]: 73: Hoare triple {23702#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23703#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:25:27,141 INFO L290 TraceCheckUtils]: 74: Hoare triple {23703#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23703#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:25:27,174 INFO L290 TraceCheckUtils]: 75: Hoare triple {23703#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23704#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:25:27,174 INFO L290 TraceCheckUtils]: 76: Hoare triple {23704#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {23704#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:25:27,181 INFO L290 TraceCheckUtils]: 77: Hoare triple {23704#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {23665#false} is VALID [2022-04-15 12:25:27,181 INFO L290 TraceCheckUtils]: 78: Hoare triple {23665#false} assume !(~x~0 % 4294967296 < 268435455); {23665#false} is VALID [2022-04-15 12:25:27,181 INFO L272 TraceCheckUtils]: 79: Hoare triple {23665#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23665#false} is VALID [2022-04-15 12:25:27,181 INFO L290 TraceCheckUtils]: 80: Hoare triple {23665#false} ~cond := #in~cond; {23665#false} is VALID [2022-04-15 12:25:27,181 INFO L290 TraceCheckUtils]: 81: Hoare triple {23665#false} assume 0 == ~cond; {23665#false} is VALID [2022-04-15 12:25:27,181 INFO L290 TraceCheckUtils]: 82: Hoare triple {23665#false} assume !false; {23665#false} is VALID [2022-04-15 12:25:27,181 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:25:27,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:25:27,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449616232] [2022-04-15 12:25:27,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449616232] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:25:27,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81743263] [2022-04-15 12:25:27,182 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:25:27,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:25:27,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:25:27,183 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:25:27,192 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:25:27,282 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:25:27,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:25:27,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 74 conjunts are in the unsatisfiable core [2022-04-15 12:25:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:27,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:25:27,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {23664#true} call ULTIMATE.init(); {23664#true} is VALID [2022-04-15 12:25:27,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {23664#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(13, 2);call #Ultimate.allocInit(12, 3); {23664#true} is VALID [2022-04-15 12:25:27,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {23664#true} assume true; {23664#true} is VALID [2022-04-15 12:25:27,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23664#true} {23664#true} #40#return; {23664#true} is VALID [2022-04-15 12:25:27,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {23664#true} call #t~ret5 := main(); {23664#true} is VALID [2022-04-15 12:25:27,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {23664#true} ~x~0 := 0; {23669#(= main_~x~0 0)} is VALID [2022-04-15 12:25:27,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {23669#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {23669#(= main_~x~0 0)} is VALID [2022-04-15 12:25:27,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {23669#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23670#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:25:27,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {23670#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {23670#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:25:27,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {23670#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23671#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:25:27,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {23671#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {23671#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:25:27,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {23671#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23672#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:25:27,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {23672#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23672#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:25:28,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {23672#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23673#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:25:28,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {23673#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23673#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:25:28,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {23673#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23674#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:25:28,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {23674#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {23674#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:25:28,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {23674#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23675#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:25:28,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {23675#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {23675#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:25:28,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {23675#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23676#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:25:28,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {23676#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23676#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:25:28,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {23676#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23677#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:25:28,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {23677#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23677#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:25:28,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {23677#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23678#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:25:28,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {23678#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23678#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:25:28,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {23678#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23679#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:25:28,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {23679#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23679#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:25:28,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {23679#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23680#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:25:28,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {23680#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23680#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:25:28,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {23680#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23681#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:25:28,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {23681#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23681#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:25:28,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {23681#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23682#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:25:28,227 INFO L290 TraceCheckUtils]: 32: Hoare triple {23682#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23682#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:25:28,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {23682#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23683#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:25:28,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {23683#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {23683#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:25:28,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {23683#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23684#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:25:28,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {23684#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {23684#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:25:28,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {23684#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23685#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:25:28,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {23685#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23685#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:25:28,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {23685#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23686#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:25:28,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {23686#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {23686#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:25:28,340 INFO L290 TraceCheckUtils]: 41: Hoare triple {23686#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23687#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:25:28,341 INFO L290 TraceCheckUtils]: 42: Hoare triple {23687#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23687#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:25:28,344 INFO L290 TraceCheckUtils]: 43: Hoare triple {23687#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23688#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:25:28,345 INFO L290 TraceCheckUtils]: 44: Hoare triple {23688#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {23688#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:25:28,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {23688#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23689#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:25:28,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {23689#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23689#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:25:28,413 INFO L290 TraceCheckUtils]: 47: Hoare triple {23689#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23690#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:25:28,414 INFO L290 TraceCheckUtils]: 48: Hoare triple {23690#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {23690#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:25:28,444 INFO L290 TraceCheckUtils]: 49: Hoare triple {23690#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23691#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:25:28,444 INFO L290 TraceCheckUtils]: 50: Hoare triple {23691#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {23691#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:25:28,475 INFO L290 TraceCheckUtils]: 51: Hoare triple {23691#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23692#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:25:28,476 INFO L290 TraceCheckUtils]: 52: Hoare triple {23692#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {23692#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:25:28,509 INFO L290 TraceCheckUtils]: 53: Hoare triple {23692#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23693#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:25:28,510 INFO L290 TraceCheckUtils]: 54: Hoare triple {23693#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23693#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:25:28,542 INFO L290 TraceCheckUtils]: 55: Hoare triple {23693#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23694#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:25:28,542 INFO L290 TraceCheckUtils]: 56: Hoare triple {23694#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23694#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:25:28,576 INFO L290 TraceCheckUtils]: 57: Hoare triple {23694#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23695#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:25:28,577 INFO L290 TraceCheckUtils]: 58: Hoare triple {23695#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23695#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:25:28,582 INFO L290 TraceCheckUtils]: 59: Hoare triple {23695#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23696#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:25:28,583 INFO L290 TraceCheckUtils]: 60: Hoare triple {23696#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {23696#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:25:28,586 INFO L290 TraceCheckUtils]: 61: Hoare triple {23696#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23697#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:25:28,587 INFO L290 TraceCheckUtils]: 62: Hoare triple {23697#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {23697#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:25:28,617 INFO L290 TraceCheckUtils]: 63: Hoare triple {23697#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23698#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:25:28,618 INFO L290 TraceCheckUtils]: 64: Hoare triple {23698#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23698#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:25:28,650 INFO L290 TraceCheckUtils]: 65: Hoare triple {23698#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23699#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:25:28,650 INFO L290 TraceCheckUtils]: 66: Hoare triple {23699#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455); {23699#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:25:28,680 INFO L290 TraceCheckUtils]: 67: Hoare triple {23699#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23700#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:25:28,681 INFO L290 TraceCheckUtils]: 68: Hoare triple {23700#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 268435455); {23700#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:25:28,712 INFO L290 TraceCheckUtils]: 69: Hoare triple {23700#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23701#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:25:28,712 INFO L290 TraceCheckUtils]: 70: Hoare triple {23701#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23701#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:25:28,745 INFO L290 TraceCheckUtils]: 71: Hoare triple {23701#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23702#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:25:28,746 INFO L290 TraceCheckUtils]: 72: Hoare triple {23702#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23702#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:25:28,777 INFO L290 TraceCheckUtils]: 73: Hoare triple {23702#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23703#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:25:28,778 INFO L290 TraceCheckUtils]: 74: Hoare triple {23703#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {23703#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:25:28,808 INFO L290 TraceCheckUtils]: 75: Hoare triple {23703#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23934#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:25:28,809 INFO L290 TraceCheckUtils]: 76: Hoare triple {23934#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !!(~x~0 % 4294967296 < 268435455); {23934#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:25:28,810 INFO L290 TraceCheckUtils]: 77: Hoare triple {23934#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {23665#false} is VALID [2022-04-15 12:25:28,810 INFO L290 TraceCheckUtils]: 78: Hoare triple {23665#false} assume !(~x~0 % 4294967296 < 268435455); {23665#false} is VALID [2022-04-15 12:25:28,810 INFO L272 TraceCheckUtils]: 79: Hoare triple {23665#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23665#false} is VALID [2022-04-15 12:25:28,810 INFO L290 TraceCheckUtils]: 80: Hoare triple {23665#false} ~cond := #in~cond; {23665#false} is VALID [2022-04-15 12:25:28,810 INFO L290 TraceCheckUtils]: 81: Hoare triple {23665#false} assume 0 == ~cond; {23665#false} is VALID [2022-04-15 12:25:28,810 INFO L290 TraceCheckUtils]: 82: Hoare triple {23665#false} assume !false; {23665#false} is VALID [2022-04-15 12:25:28,810 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:25:28,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:25:37,183 INFO L290 TraceCheckUtils]: 82: Hoare triple {23665#false} assume !false; {23665#false} is VALID [2022-04-15 12:25:37,183 INFO L290 TraceCheckUtils]: 81: Hoare triple {23665#false} assume 0 == ~cond; {23665#false} is VALID [2022-04-15 12:25:37,183 INFO L290 TraceCheckUtils]: 80: Hoare triple {23665#false} ~cond := #in~cond; {23665#false} is VALID [2022-04-15 12:25:37,183 INFO L272 TraceCheckUtils]: 79: Hoare triple {23665#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23665#false} is VALID [2022-04-15 12:25:37,183 INFO L290 TraceCheckUtils]: 78: Hoare triple {23665#false} assume !(~x~0 % 4294967296 < 268435455); {23665#false} is VALID [2022-04-15 12:25:37,183 INFO L290 TraceCheckUtils]: 77: Hoare triple {23971#(< (mod main_~x~0 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {23665#false} is VALID [2022-04-15 12:25:37,184 INFO L290 TraceCheckUtils]: 76: Hoare triple {23975#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod main_~x~0 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {23971#(< (mod main_~x~0 4294967296) 65521)} is VALID [2022-04-15 12:25:37,217 INFO L290 TraceCheckUtils]: 75: Hoare triple {23979#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23975#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod main_~x~0 4294967296) 65521))} is VALID [2022-04-15 12:25:37,218 INFO L290 TraceCheckUtils]: 74: Hoare triple {23979#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {23979#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,219 INFO L290 TraceCheckUtils]: 73: Hoare triple {23986#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23979#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,220 INFO L290 TraceCheckUtils]: 72: Hoare triple {23986#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {23986#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,251 INFO L290 TraceCheckUtils]: 71: Hoare triple {23993#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23986#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,252 INFO L290 TraceCheckUtils]: 70: Hoare triple {23993#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {23993#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,253 INFO L290 TraceCheckUtils]: 69: Hoare triple {24000#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23993#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,253 INFO L290 TraceCheckUtils]: 68: Hoare triple {24000#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24000#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,254 INFO L290 TraceCheckUtils]: 67: Hoare triple {24007#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24000#(or (< (mod (+ main_~x~0 4) 4294967296) 65521) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,254 INFO L290 TraceCheckUtils]: 66: Hoare triple {24007#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {24007#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,258 INFO L290 TraceCheckUtils]: 65: Hoare triple {24014#(or (< (mod (+ main_~x~0 6) 4294967296) 65521) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24007#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,259 INFO L290 TraceCheckUtils]: 64: Hoare triple {24014#(or (< (mod (+ main_~x~0 6) 4294967296) 65521) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24014#(or (< (mod (+ main_~x~0 6) 4294967296) 65521) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,291 INFO L290 TraceCheckUtils]: 63: Hoare triple {24021#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 268435455)) (< (mod (+ 7 main_~x~0) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24014#(or (< (mod (+ main_~x~0 6) 4294967296) 65521) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,291 INFO L290 TraceCheckUtils]: 62: Hoare triple {24021#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 268435455)) (< (mod (+ 7 main_~x~0) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {24021#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 268435455)) (< (mod (+ 7 main_~x~0) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,326 INFO L290 TraceCheckUtils]: 61: Hoare triple {24028#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24021#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 268435455)) (< (mod (+ 7 main_~x~0) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,327 INFO L290 TraceCheckUtils]: 60: Hoare triple {24028#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {24028#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,362 INFO L290 TraceCheckUtils]: 59: Hoare triple {24035#(or (not (< (mod (+ main_~x~0 9) 4294967296) 268435455)) (< (mod (+ main_~x~0 9) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24028#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,363 INFO L290 TraceCheckUtils]: 58: Hoare triple {24035#(or (not (< (mod (+ main_~x~0 9) 4294967296) 268435455)) (< (mod (+ main_~x~0 9) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {24035#(or (not (< (mod (+ main_~x~0 9) 4294967296) 268435455)) (< (mod (+ main_~x~0 9) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,367 INFO L290 TraceCheckUtils]: 57: Hoare triple {24042#(or (< (mod (+ main_~x~0 10) 4294967296) 65521) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24035#(or (not (< (mod (+ main_~x~0 9) 4294967296) 268435455)) (< (mod (+ main_~x~0 9) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,367 INFO L290 TraceCheckUtils]: 56: Hoare triple {24042#(or (< (mod (+ main_~x~0 10) 4294967296) 65521) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24042#(or (< (mod (+ main_~x~0 10) 4294967296) 65521) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,399 INFO L290 TraceCheckUtils]: 55: Hoare triple {24049#(or (< (mod (+ main_~x~0 11) 4294967296) 65521) (not (< (mod (+ main_~x~0 11) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24042#(or (< (mod (+ main_~x~0 10) 4294967296) 65521) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,399 INFO L290 TraceCheckUtils]: 54: Hoare triple {24049#(or (< (mod (+ main_~x~0 11) 4294967296) 65521) (not (< (mod (+ main_~x~0 11) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24049#(or (< (mod (+ main_~x~0 11) 4294967296) 65521) (not (< (mod (+ main_~x~0 11) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,426 INFO L290 TraceCheckUtils]: 53: Hoare triple {24056#(or (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24049#(or (< (mod (+ main_~x~0 11) 4294967296) 65521) (not (< (mod (+ main_~x~0 11) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,427 INFO L290 TraceCheckUtils]: 52: Hoare triple {24056#(or (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {24056#(or (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,458 INFO L290 TraceCheckUtils]: 51: Hoare triple {24063#(or (< (mod (+ main_~x~0 13) 4294967296) 65521) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24056#(or (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,459 INFO L290 TraceCheckUtils]: 50: Hoare triple {24063#(or (< (mod (+ main_~x~0 13) 4294967296) 65521) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24063#(or (< (mod (+ main_~x~0 13) 4294967296) 65521) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,463 INFO L290 TraceCheckUtils]: 49: Hoare triple {24070#(or (< (mod (+ main_~x~0 14) 4294967296) 65521) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24063#(or (< (mod (+ main_~x~0 13) 4294967296) 65521) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {24070#(or (< (mod (+ main_~x~0 14) 4294967296) 65521) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24070#(or (< (mod (+ main_~x~0 14) 4294967296) 65521) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {24077#(or (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)) (< (mod (+ main_~x~0 15) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24070#(or (< (mod (+ main_~x~0 14) 4294967296) 65521) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {24077#(or (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)) (< (mod (+ main_~x~0 15) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {24077#(or (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)) (< (mod (+ main_~x~0 15) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {24084#(or (< (mod (+ main_~x~0 16) 4294967296) 65521) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24077#(or (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)) (< (mod (+ main_~x~0 15) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,497 INFO L290 TraceCheckUtils]: 44: Hoare triple {24084#(or (< (mod (+ main_~x~0 16) 4294967296) 65521) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24084#(or (< (mod (+ main_~x~0 16) 4294967296) 65521) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {24091#(or (< (mod (+ main_~x~0 17) 4294967296) 65521) (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24084#(or (< (mod (+ main_~x~0 16) 4294967296) 65521) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,498 INFO L290 TraceCheckUtils]: 42: Hoare triple {24091#(or (< (mod (+ main_~x~0 17) 4294967296) 65521) (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24091#(or (< (mod (+ main_~x~0 17) 4294967296) 65521) (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,530 INFO L290 TraceCheckUtils]: 41: Hoare triple {24098#(or (< (mod (+ main_~x~0 18) 4294967296) 65521) (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24091#(or (< (mod (+ main_~x~0 17) 4294967296) 65521) (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,531 INFO L290 TraceCheckUtils]: 40: Hoare triple {24098#(or (< (mod (+ main_~x~0 18) 4294967296) 65521) (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24098#(or (< (mod (+ main_~x~0 18) 4294967296) 65521) (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,563 INFO L290 TraceCheckUtils]: 39: Hoare triple {24105#(or (< (mod (+ 19 main_~x~0) 4294967296) 65521) (not (< (mod (+ 19 main_~x~0) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24098#(or (< (mod (+ main_~x~0 18) 4294967296) 65521) (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {24105#(or (< (mod (+ 19 main_~x~0) 4294967296) 65521) (not (< (mod (+ 19 main_~x~0) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24105#(or (< (mod (+ 19 main_~x~0) 4294967296) 65521) (not (< (mod (+ 19 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {24112#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24105#(or (< (mod (+ 19 main_~x~0) 4294967296) 65521) (not (< (mod (+ 19 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,568 INFO L290 TraceCheckUtils]: 36: Hoare triple {24112#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {24112#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {24119#(or (< (mod (+ main_~x~0 21) 4294967296) 65521) (not (< (mod (+ main_~x~0 21) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24112#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,602 INFO L290 TraceCheckUtils]: 34: Hoare triple {24119#(or (< (mod (+ main_~x~0 21) 4294967296) 65521) (not (< (mod (+ main_~x~0 21) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24119#(or (< (mod (+ main_~x~0 21) 4294967296) 65521) (not (< (mod (+ main_~x~0 21) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {24126#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (< (mod (+ main_~x~0 22) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24119#(or (< (mod (+ main_~x~0 21) 4294967296) 65521) (not (< (mod (+ main_~x~0 21) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {24126#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (< (mod (+ main_~x~0 22) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {24126#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (< (mod (+ main_~x~0 22) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {24133#(or (< (mod (+ 23 main_~x~0) 4294967296) 65521) (not (< (mod (+ 23 main_~x~0) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24126#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (< (mod (+ main_~x~0 22) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {24133#(or (< (mod (+ 23 main_~x~0) 4294967296) 65521) (not (< (mod (+ 23 main_~x~0) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24133#(or (< (mod (+ 23 main_~x~0) 4294967296) 65521) (not (< (mod (+ 23 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {24140#(or (< (mod (+ main_~x~0 24) 4294967296) 65521) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24133#(or (< (mod (+ 23 main_~x~0) 4294967296) 65521) (not (< (mod (+ 23 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {24140#(or (< (mod (+ main_~x~0 24) 4294967296) 65521) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24140#(or (< (mod (+ main_~x~0 24) 4294967296) 65521) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {24147#(or (< (mod (+ main_~x~0 25) 4294967296) 65521) (not (< (mod (+ main_~x~0 25) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24140#(or (< (mod (+ main_~x~0 24) 4294967296) 65521) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {24147#(or (< (mod (+ main_~x~0 25) 4294967296) 65521) (not (< (mod (+ main_~x~0 25) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24147#(or (< (mod (+ main_~x~0 25) 4294967296) 65521) (not (< (mod (+ main_~x~0 25) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {24154#(or (< (mod (+ main_~x~0 26) 4294967296) 65521) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24147#(or (< (mod (+ main_~x~0 25) 4294967296) 65521) (not (< (mod (+ main_~x~0 25) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {24154#(or (< (mod (+ main_~x~0 26) 4294967296) 65521) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24154#(or (< (mod (+ main_~x~0 26) 4294967296) 65521) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {24161#(or (< (mod (+ main_~x~0 27) 4294967296) 65521) (not (< (mod (+ main_~x~0 27) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24154#(or (< (mod (+ main_~x~0 26) 4294967296) 65521) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {24161#(or (< (mod (+ main_~x~0 27) 4294967296) 65521) (not (< (mod (+ main_~x~0 27) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24161#(or (< (mod (+ main_~x~0 27) 4294967296) 65521) (not (< (mod (+ main_~x~0 27) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {24168#(or (< (mod (+ main_~x~0 28) 4294967296) 65521) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24161#(or (< (mod (+ main_~x~0 27) 4294967296) 65521) (not (< (mod (+ main_~x~0 27) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {24168#(or (< (mod (+ main_~x~0 28) 4294967296) 65521) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24168#(or (< (mod (+ main_~x~0 28) 4294967296) 65521) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {24175#(or (not (< (mod (+ 29 main_~x~0) 4294967296) 268435455)) (< (mod (+ 29 main_~x~0) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24168#(or (< (mod (+ main_~x~0 28) 4294967296) 65521) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {24175#(or (not (< (mod (+ 29 main_~x~0) 4294967296) 268435455)) (< (mod (+ 29 main_~x~0) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {24175#(or (not (< (mod (+ 29 main_~x~0) 4294967296) 268435455)) (< (mod (+ 29 main_~x~0) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {24182#(or (< (mod (+ 30 main_~x~0) 4294967296) 65521) (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24175#(or (not (< (mod (+ 29 main_~x~0) 4294967296) 268435455)) (< (mod (+ 29 main_~x~0) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {24182#(or (< (mod (+ 30 main_~x~0) 4294967296) 65521) (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24182#(or (< (mod (+ 30 main_~x~0) 4294967296) 65521) (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {24189#(or (< (mod (+ main_~x~0 31) 4294967296) 65521) (not (< (mod (+ main_~x~0 31) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24182#(or (< (mod (+ 30 main_~x~0) 4294967296) 65521) (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {24189#(or (< (mod (+ main_~x~0 31) 4294967296) 65521) (not (< (mod (+ main_~x~0 31) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24189#(or (< (mod (+ main_~x~0 31) 4294967296) 65521) (not (< (mod (+ main_~x~0 31) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {24196#(or (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)) (< (mod (+ 32 main_~x~0) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24189#(or (< (mod (+ main_~x~0 31) 4294967296) 65521) (not (< (mod (+ main_~x~0 31) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {24196#(or (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)) (< (mod (+ 32 main_~x~0) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {24196#(or (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)) (< (mod (+ 32 main_~x~0) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {24203#(or (< (mod (+ main_~x~0 33) 4294967296) 65521) (not (< (mod (+ main_~x~0 33) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24196#(or (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)) (< (mod (+ 32 main_~x~0) 4294967296) 65521))} is VALID [2022-04-15 12:25:37,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {24203#(or (< (mod (+ main_~x~0 33) 4294967296) 65521) (not (< (mod (+ main_~x~0 33) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24203#(or (< (mod (+ main_~x~0 33) 4294967296) 65521) (not (< (mod (+ main_~x~0 33) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {24210#(or (< (mod (+ main_~x~0 34) 4294967296) 65521) (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24203#(or (< (mod (+ main_~x~0 33) 4294967296) 65521) (not (< (mod (+ main_~x~0 33) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:37,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {24210#(or (< (mod (+ main_~x~0 34) 4294967296) 65521) (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {24210#(or (< (mod (+ main_~x~0 34) 4294967296) 65521) (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:38,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {24217#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 268435455)) (< (mod (+ 35 main_~x~0) 4294967296) 65521))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24210#(or (< (mod (+ main_~x~0 34) 4294967296) 65521) (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)))} is VALID [2022-04-15 12:25:38,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {24217#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 268435455)) (< (mod (+ 35 main_~x~0) 4294967296) 65521))} assume !!(~x~0 % 4294967296 < 268435455); {24217#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 268435455)) (< (mod (+ 35 main_~x~0) 4294967296) 65521))} is VALID [2022-04-15 12:25:38,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {23664#true} ~x~0 := 0; {24217#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 268435455)) (< (mod (+ 35 main_~x~0) 4294967296) 65521))} is VALID [2022-04-15 12:25:38,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {23664#true} call #t~ret5 := main(); {23664#true} is VALID [2022-04-15 12:25:38,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23664#true} {23664#true} #40#return; {23664#true} is VALID [2022-04-15 12:25:38,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {23664#true} assume true; {23664#true} is VALID [2022-04-15 12:25:38,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {23664#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(13, 2);call #Ultimate.allocInit(12, 3); {23664#true} is VALID [2022-04-15 12:25:38,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {23664#true} call ULTIMATE.init(); {23664#true} is VALID [2022-04-15 12:25:38,029 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:25:38,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81743263] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:25:38,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:25:38,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 39] total 77 [2022-04-15 12:25:38,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:25:38,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [299806339] [2022-04-15 12:25:38,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [299806339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:25:38,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:25:38,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 12:25:38,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995397338] [2022-04-15 12:25:38,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:25:38,031 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:25:38,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:25:38,031 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:25:40,334 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:25:40,334 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 12:25:40,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:40,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 12:25:40,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1557, Invalid=4295, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 12:25:40,335 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:27:18,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:18,842 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-04-15 12:27:18,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 12:27:18,842 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:27:18,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:27:18,842 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:27:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 95 transitions. [2022-04-15 12:27:18,843 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:27:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 95 transitions. [2022-04-15 12:27:18,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 95 transitions. [2022-04-15 12:27:20,181 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:27:20,182 INFO L225 Difference]: With dead ends: 94 [2022-04-15 12:27:20,182 INFO L226 Difference]: Without dead ends: 87 [2022-04-15 12:27:20,183 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=3103, Invalid=9553, Unknown=0, NotChecked=0, Total=12656 [2022-04-15 12:27:20,183 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2614 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 2687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:27:20,183 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 119 Invalid, 2687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2614 Invalid, 0 Unknown, 0 Unchecked, 40.0s Time] [2022-04-15 12:27:20,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-15 12:27:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-15 12:27:20,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:27:20,366 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:27:20,366 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:27:20,366 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:27:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:20,367 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-15 12:27:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-15 12:27:20,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:20,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:20,368 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:27:20,368 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:27:20,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:20,368 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-15 12:27:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-15 12:27:20,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:20,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:20,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:27:20,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:27:20,369 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:27:20,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2022-04-15 12:27:20,369 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2022-04-15 12:27:20,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:27:20,370 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2022-04-15 12:27:20,370 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:27:20,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 89 transitions. [2022-04-15 12:27:21,372 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:27:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-15 12:27:21,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 12:27:21,372 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:27:21,372 INFO L499 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:27:21,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-15 12:27:21,585 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:27:21,585 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:27:21,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:27:21,585 INFO L85 PathProgramCache]: Analyzing trace with hash 385605905, now seen corresponding path program 71 times [2022-04-15 12:27:21,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:21,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [227219256] [2022-04-15 12:27:21,780 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:27:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash 824616881, now seen corresponding path program 1 times [2022-04-15 12:27:21,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:21,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918147730] [2022-04-15 12:27:21,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:21,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:27:21,787 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:27:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:27:21,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:27:21,791 INFO L85 PathProgramCache]: Analyzing trace with hash 385605905, now seen corresponding path program 72 times [2022-04-15 12:27:21,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:21,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332446620] [2022-04-15 12:27:21,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:21,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:22,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:27:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:22,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {24891#(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(13, 2);call #Ultimate.allocInit(12, 3); {24849#true} is VALID [2022-04-15 12:27:22,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {24849#true} assume true; {24849#true} is VALID [2022-04-15 12:27:22,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24849#true} {24849#true} #40#return; {24849#true} is VALID [2022-04-15 12:27:22,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {24849#true} call ULTIMATE.init(); {24891#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:27:22,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {24891#(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(13, 2);call #Ultimate.allocInit(12, 3); {24849#true} is VALID [2022-04-15 12:27:22,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {24849#true} assume true; {24849#true} is VALID [2022-04-15 12:27:22,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24849#true} {24849#true} #40#return; {24849#true} is VALID [2022-04-15 12:27:22,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {24849#true} call #t~ret5 := main(); {24849#true} is VALID [2022-04-15 12:27:22,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {24849#true} ~x~0 := 0; {24854#(= main_~x~0 0)} is VALID [2022-04-15 12:27:22,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {24854#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {24854#(= main_~x~0 0)} is VALID [2022-04-15 12:27:22,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {24854#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24855#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:27:22,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {24855#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {24855#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:27:22,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {24855#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:27:22,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {24856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {24856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:27:22,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {24856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24857#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:27:22,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {24857#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24857#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:27:22,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {24857#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24858#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:27:22,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {24858#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24858#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:27:22,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {24858#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24859#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:27:22,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {24859#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {24859#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:27:22,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {24859#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24860#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:27:22,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {24860#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {24860#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:27:22,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {24860#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24861#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:27:22,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {24861#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24861#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:27:22,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {24861#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24862#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:27:22,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {24862#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24862#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:27:22,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {24862#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24863#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:27:22,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {24863#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24863#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:27:22,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {24863#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:27:22,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {24864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:27:22,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {24864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24865#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:27:22,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {24865#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24865#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:27:22,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {24865#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:27:22,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {24866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:27:22,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {24866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24867#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:27:22,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {24867#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24867#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:27:22,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {24867#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24868#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:27:22,821 INFO L290 TraceCheckUtils]: 34: Hoare triple {24868#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {24868#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:27:22,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {24868#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24869#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:27:22,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {24869#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {24869#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:27:22,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {24869#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24870#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:27:22,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {24870#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24870#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:27:22,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {24870#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24871#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:27:22,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {24871#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {24871#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:27:22,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {24871#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24872#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:27:22,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {24872#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24872#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:27:22,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {24872#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24873#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:27:22,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {24873#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {24873#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:27:22,932 INFO L290 TraceCheckUtils]: 45: Hoare triple {24873#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24874#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:27:22,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {24874#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24874#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:27:22,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {24874#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24875#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:27:22,958 INFO L290 TraceCheckUtils]: 48: Hoare triple {24875#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {24875#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:27:22,984 INFO L290 TraceCheckUtils]: 49: Hoare triple {24875#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24876#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:27:22,984 INFO L290 TraceCheckUtils]: 50: Hoare triple {24876#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {24876#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:27:23,014 INFO L290 TraceCheckUtils]: 51: Hoare triple {24876#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24877#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:27:23,015 INFO L290 TraceCheckUtils]: 52: Hoare triple {24877#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {24877#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:27:23,045 INFO L290 TraceCheckUtils]: 53: Hoare triple {24877#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24878#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:27:23,046 INFO L290 TraceCheckUtils]: 54: Hoare triple {24878#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24878#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:27:23,069 INFO L290 TraceCheckUtils]: 55: Hoare triple {24878#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24879#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:27:23,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {24879#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24879#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:27:23,091 INFO L290 TraceCheckUtils]: 57: Hoare triple {24879#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24880#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:27:23,092 INFO L290 TraceCheckUtils]: 58: Hoare triple {24880#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24880#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:27:23,097 INFO L290 TraceCheckUtils]: 59: Hoare triple {24880#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24881#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:27:23,098 INFO L290 TraceCheckUtils]: 60: Hoare triple {24881#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {24881#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:27:23,102 INFO L290 TraceCheckUtils]: 61: Hoare triple {24881#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24882#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:27:23,102 INFO L290 TraceCheckUtils]: 62: Hoare triple {24882#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {24882#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:27:23,132 INFO L290 TraceCheckUtils]: 63: Hoare triple {24882#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24883#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:27:23,133 INFO L290 TraceCheckUtils]: 64: Hoare triple {24883#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24883#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:27:23,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {24883#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24884#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:27:23,164 INFO L290 TraceCheckUtils]: 66: Hoare triple {24884#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455); {24884#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:27:23,193 INFO L290 TraceCheckUtils]: 67: Hoare triple {24884#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24885#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:27:23,194 INFO L290 TraceCheckUtils]: 68: Hoare triple {24885#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 268435455); {24885#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:27:23,226 INFO L290 TraceCheckUtils]: 69: Hoare triple {24885#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24886#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:27:23,226 INFO L290 TraceCheckUtils]: 70: Hoare triple {24886#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24886#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:27:23,249 INFO L290 TraceCheckUtils]: 71: Hoare triple {24886#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24887#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:27:23,249 INFO L290 TraceCheckUtils]: 72: Hoare triple {24887#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24887#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:27:23,273 INFO L290 TraceCheckUtils]: 73: Hoare triple {24887#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24888#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:27:23,274 INFO L290 TraceCheckUtils]: 74: Hoare triple {24888#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {24888#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:27:23,297 INFO L290 TraceCheckUtils]: 75: Hoare triple {24888#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24889#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:27:23,297 INFO L290 TraceCheckUtils]: 76: Hoare triple {24889#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !!(~x~0 % 4294967296 < 268435455); {24889#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:27:23,320 INFO L290 TraceCheckUtils]: 77: Hoare triple {24889#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24890#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:27:23,321 INFO L290 TraceCheckUtils]: 78: Hoare triple {24890#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {24890#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:27:23,325 INFO L290 TraceCheckUtils]: 79: Hoare triple {24890#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {24850#false} is VALID [2022-04-15 12:27:23,325 INFO L290 TraceCheckUtils]: 80: Hoare triple {24850#false} assume !(~x~0 % 4294967296 < 268435455); {24850#false} is VALID [2022-04-15 12:27:23,325 INFO L272 TraceCheckUtils]: 81: Hoare triple {24850#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {24850#false} is VALID [2022-04-15 12:27:23,325 INFO L290 TraceCheckUtils]: 82: Hoare triple {24850#false} ~cond := #in~cond; {24850#false} is VALID [2022-04-15 12:27:23,325 INFO L290 TraceCheckUtils]: 83: Hoare triple {24850#false} assume 0 == ~cond; {24850#false} is VALID [2022-04-15 12:27:23,325 INFO L290 TraceCheckUtils]: 84: Hoare triple {24850#false} assume !false; {24850#false} is VALID [2022-04-15 12:27:23,326 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:27:23,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:27:23,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332446620] [2022-04-15 12:27:23,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332446620] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:27:23,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124513079] [2022-04-15 12:27:23,326 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:27:23,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:27:23,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:27:23,327 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:27:23,328 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:27:23,392 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:27:23,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:27:23,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:27:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:23,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:27:23,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {24849#true} call ULTIMATE.init(); {24849#true} is VALID [2022-04-15 12:27:23,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {24849#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(13, 2);call #Ultimate.allocInit(12, 3); {24849#true} is VALID [2022-04-15 12:27:23,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {24849#true} assume true; {24849#true} is VALID [2022-04-15 12:27:23,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24849#true} {24849#true} #40#return; {24849#true} is VALID [2022-04-15 12:27:23,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {24849#true} call #t~ret5 := main(); {24849#true} is VALID [2022-04-15 12:27:23,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {24849#true} ~x~0 := 0; {24849#true} is VALID [2022-04-15 12:27:23,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 36: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 40: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 46: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,939 INFO L290 TraceCheckUtils]: 47: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 49: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 50: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 51: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 52: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 54: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 55: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 56: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 57: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 58: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 59: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 60: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 61: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 62: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 63: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 64: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 65: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 66: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,940 INFO L290 TraceCheckUtils]: 67: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,941 INFO L290 TraceCheckUtils]: 68: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,941 INFO L290 TraceCheckUtils]: 69: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,941 INFO L290 TraceCheckUtils]: 70: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,941 INFO L290 TraceCheckUtils]: 71: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,941 INFO L290 TraceCheckUtils]: 72: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,941 INFO L290 TraceCheckUtils]: 73: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,941 INFO L290 TraceCheckUtils]: 74: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,941 INFO L290 TraceCheckUtils]: 75: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:23,941 INFO L290 TraceCheckUtils]: 76: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:23,971 INFO L290 TraceCheckUtils]: 77: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25126#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:27:23,971 INFO L290 TraceCheckUtils]: 78: Hoare triple {25126#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !!(~x~0 % 4294967296 < 268435455); {25126#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} is VALID [2022-04-15 12:27:23,976 INFO L290 TraceCheckUtils]: 79: Hoare triple {25126#(< (mod (+ main_~x~0 4294967295) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {25133#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} is VALID [2022-04-15 12:27:23,978 INFO L290 TraceCheckUtils]: 80: Hoare triple {25133#(< (mod (+ main_~x~0 4294967293) 4294967296) 65521)} assume !(~x~0 % 4294967296 < 268435455); {24850#false} is VALID [2022-04-15 12:27:23,978 INFO L272 TraceCheckUtils]: 81: Hoare triple {24850#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {24850#false} is VALID [2022-04-15 12:27:23,978 INFO L290 TraceCheckUtils]: 82: Hoare triple {24850#false} ~cond := #in~cond; {24850#false} is VALID [2022-04-15 12:27:23,978 INFO L290 TraceCheckUtils]: 83: Hoare triple {24850#false} assume 0 == ~cond; {24850#false} is VALID [2022-04-15 12:27:23,978 INFO L290 TraceCheckUtils]: 84: Hoare triple {24850#false} assume !false; {24850#false} is VALID [2022-04-15 12:27:23,979 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:27:23,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:27:25,295 INFO L290 TraceCheckUtils]: 84: Hoare triple {24850#false} assume !false; {24850#false} is VALID [2022-04-15 12:27:25,296 INFO L290 TraceCheckUtils]: 83: Hoare triple {24850#false} assume 0 == ~cond; {24850#false} is VALID [2022-04-15 12:27:25,296 INFO L290 TraceCheckUtils]: 82: Hoare triple {24850#false} ~cond := #in~cond; {24850#false} is VALID [2022-04-15 12:27:25,296 INFO L272 TraceCheckUtils]: 81: Hoare triple {24850#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {24850#false} is VALID [2022-04-15 12:27:25,296 INFO L290 TraceCheckUtils]: 80: Hoare triple {25161#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {24850#false} is VALID [2022-04-15 12:27:25,301 INFO L290 TraceCheckUtils]: 79: Hoare triple {25165#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {25161#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:27:25,301 INFO L290 TraceCheckUtils]: 78: Hoare triple {25165#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {25165#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:27:25,327 INFO L290 TraceCheckUtils]: 77: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25165#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:27:25,327 INFO L290 TraceCheckUtils]: 76: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,327 INFO L290 TraceCheckUtils]: 75: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,327 INFO L290 TraceCheckUtils]: 74: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,327 INFO L290 TraceCheckUtils]: 73: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,327 INFO L290 TraceCheckUtils]: 72: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,327 INFO L290 TraceCheckUtils]: 71: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,327 INFO L290 TraceCheckUtils]: 70: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,327 INFO L290 TraceCheckUtils]: 69: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 68: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 67: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 66: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 65: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 64: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 63: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 62: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 61: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 60: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 59: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 58: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 57: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 56: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 55: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 53: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 52: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 51: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 50: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,328 INFO L290 TraceCheckUtils]: 49: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 48: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {24849#true} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24849#true} is VALID [2022-04-15 12:27:25,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {24849#true} assume !!(~x~0 % 4294967296 < 268435455); {24849#true} is VALID [2022-04-15 12:27:25,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {24849#true} ~x~0 := 0; {24849#true} is VALID [2022-04-15 12:27:25,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {24849#true} call #t~ret5 := main(); {24849#true} is VALID [2022-04-15 12:27:25,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24849#true} {24849#true} #40#return; {24849#true} is VALID [2022-04-15 12:27:25,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {24849#true} assume true; {24849#true} is VALID [2022-04-15 12:27:25,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {24849#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(13, 2);call #Ultimate.allocInit(12, 3); {24849#true} is VALID [2022-04-15 12:27:25,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {24849#true} call ULTIMATE.init(); {24849#true} is VALID [2022-04-15 12:27:25,331 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:27:25,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124513079] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:27:25,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:27:25,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 4, 4] total 44 [2022-04-15 12:27:25,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:27:25,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [227219256] [2022-04-15 12:27:25,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [227219256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:27:25,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:27:25,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 12:27:25,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836070410] [2022-04-15 12:27:25,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:27:25,332 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:27:25,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:27:25,333 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:27:26,616 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:27:26,616 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 12:27:26,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:26,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 12:27:26,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1625, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 12:27:26,617 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) [2022-04-15 12:29:01,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:01,258 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-15 12:29:01,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 12:29:01,258 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:29:01,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-04-15 12:29:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2022-04-15 12:29:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-04-15 12:29:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2022-04-15 12:29:01,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 97 transitions. [2022-04-15 12:29:03,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:29:03,019 INFO L225 Difference]: With dead ends: 96 [2022-04-15 12:29:03,019 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 12:29:03,019 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=629, Invalid=5851, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 12:29:03,019 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 2835 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:29:03,020 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 184 Invalid, 2910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2835 Invalid, 0 Unknown, 0 Unchecked, 36.8s Time] [2022-04-15 12:29:03,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 12:29:03,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-04-15 12:29:03,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:03,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:03,198 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:03,198 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:03,199 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2022-04-15 12:29:03,199 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-04-15 12:29:03,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:03,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:03,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 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 89 states. [2022-04-15 12:29:03,199 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 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 89 states. [2022-04-15 12:29:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:03,200 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2022-04-15 12:29:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-04-15 12:29:03,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:03,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:03,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:03,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2022-04-15 12:29:03,201 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 85 [2022-04-15 12:29:03,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:03,201 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2022-04-15 12:29:03,201 INFO L479 AbstractCegarLoop]: INTERPOLANT 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) [2022-04-15 12:29:03,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 91 transitions. [2022-04-15 12:29:04,523 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:29:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-04-15 12:29:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 12:29:04,524 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:04,524 INFO L499 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:04,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 12:29:04,724 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:29:04,725 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:29:04,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:04,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1152942994, now seen corresponding path program 73 times [2022-04-15 12:29:04,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:04,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1129903075] [2022-04-15 12:29:04,931 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:29:04,932 INFO L85 PathProgramCache]: Analyzing trace with hash 883722225, now seen corresponding path program 1 times [2022-04-15 12:29:04,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:04,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729043518] [2022-04-15 12:29:04,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:04,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:29:04,938 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:29:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:29:04,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:29:04,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1152942994, now seen corresponding path program 74 times [2022-04-15 12:29:04,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:04,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722819518] [2022-04-15 12:29:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:04,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:05,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:05,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {26070#(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(13, 2);call #Ultimate.allocInit(12, 3); {26027#true} is VALID [2022-04-15 12:29:05,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {26027#true} assume true; {26027#true} is VALID [2022-04-15 12:29:05,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26027#true} {26027#true} #40#return; {26027#true} is VALID [2022-04-15 12:29:05,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {26027#true} call ULTIMATE.init(); {26070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:29:05,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {26070#(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(13, 2);call #Ultimate.allocInit(12, 3); {26027#true} is VALID [2022-04-15 12:29:05,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {26027#true} assume true; {26027#true} is VALID [2022-04-15 12:29:05,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26027#true} {26027#true} #40#return; {26027#true} is VALID [2022-04-15 12:29:05,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {26027#true} call #t~ret5 := main(); {26027#true} is VALID [2022-04-15 12:29:05,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {26027#true} ~x~0 := 0; {26032#(= main_~x~0 0)} is VALID [2022-04-15 12:29:05,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {26032#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {26032#(= main_~x~0 0)} is VALID [2022-04-15 12:29:05,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {26032#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26033#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:29:05,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {26033#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {26033#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:29:05,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {26033#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26034#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:29:05,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {26034#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {26034#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:29:05,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {26034#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26035#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:29:05,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {26035#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26035#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:29:05,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {26035#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26036#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:29:05,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {26036#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26036#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:29:05,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {26036#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26037#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:29:05,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {26037#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {26037#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:29:05,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {26037#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26038#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:29:05,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {26038#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {26038#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:29:05,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {26038#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26039#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:29:05,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {26039#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26039#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:29:06,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {26039#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26040#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:29:06,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {26040#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26040#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:29:06,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {26040#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26041#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:29:06,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {26041#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26041#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:29:06,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {26041#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26042#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:29:06,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {26042#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26042#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:29:06,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {26042#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26043#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:29:06,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {26043#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26043#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:29:06,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {26043#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26044#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:29:06,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {26044#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26044#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:29:06,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {26044#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26045#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:29:06,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {26045#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26045#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:29:06,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {26045#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26046#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:29:06,115 INFO L290 TraceCheckUtils]: 34: Hoare triple {26046#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {26046#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:29:06,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {26046#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26047#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:29:06,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {26047#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {26047#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:29:06,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {26047#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26048#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:29:06,181 INFO L290 TraceCheckUtils]: 38: Hoare triple {26048#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26048#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:29:06,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {26048#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26049#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:29:06,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {26049#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {26049#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:29:06,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {26049#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26050#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:29:06,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {26050#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26050#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:29:06,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {26050#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26051#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:29:06,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {26051#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {26051#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:29:06,254 INFO L290 TraceCheckUtils]: 45: Hoare triple {26051#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26052#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:29:06,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {26052#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26052#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:29:06,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {26052#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26053#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:29:06,283 INFO L290 TraceCheckUtils]: 48: Hoare triple {26053#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {26053#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:29:06,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {26053#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26054#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:29:06,310 INFO L290 TraceCheckUtils]: 50: Hoare triple {26054#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {26054#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:29:06,337 INFO L290 TraceCheckUtils]: 51: Hoare triple {26054#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26055#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:29:06,338 INFO L290 TraceCheckUtils]: 52: Hoare triple {26055#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {26055#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:29:06,363 INFO L290 TraceCheckUtils]: 53: Hoare triple {26055#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26056#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:29:06,364 INFO L290 TraceCheckUtils]: 54: Hoare triple {26056#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26056#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:29:06,389 INFO L290 TraceCheckUtils]: 55: Hoare triple {26056#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26057#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:29:06,390 INFO L290 TraceCheckUtils]: 56: Hoare triple {26057#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26057#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:29:06,418 INFO L290 TraceCheckUtils]: 57: Hoare triple {26057#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26058#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:29:06,419 INFO L290 TraceCheckUtils]: 58: Hoare triple {26058#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26058#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:29:06,425 INFO L290 TraceCheckUtils]: 59: Hoare triple {26058#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26059#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:29:06,426 INFO L290 TraceCheckUtils]: 60: Hoare triple {26059#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {26059#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:29:06,430 INFO L290 TraceCheckUtils]: 61: Hoare triple {26059#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26060#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:29:06,430 INFO L290 TraceCheckUtils]: 62: Hoare triple {26060#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {26060#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:29:06,458 INFO L290 TraceCheckUtils]: 63: Hoare triple {26060#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26061#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:29:06,459 INFO L290 TraceCheckUtils]: 64: Hoare triple {26061#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26061#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:29:06,485 INFO L290 TraceCheckUtils]: 65: Hoare triple {26061#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26062#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:29:06,486 INFO L290 TraceCheckUtils]: 66: Hoare triple {26062#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455); {26062#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:29:06,512 INFO L290 TraceCheckUtils]: 67: Hoare triple {26062#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26063#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:29:06,512 INFO L290 TraceCheckUtils]: 68: Hoare triple {26063#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 268435455); {26063#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:29:06,539 INFO L290 TraceCheckUtils]: 69: Hoare triple {26063#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26064#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:29:06,540 INFO L290 TraceCheckUtils]: 70: Hoare triple {26064#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26064#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:29:06,574 INFO L290 TraceCheckUtils]: 71: Hoare triple {26064#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26065#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:29:06,574 INFO L290 TraceCheckUtils]: 72: Hoare triple {26065#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26065#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:29:06,609 INFO L290 TraceCheckUtils]: 73: Hoare triple {26065#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26066#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:29:06,610 INFO L290 TraceCheckUtils]: 74: Hoare triple {26066#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26066#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:29:06,643 INFO L290 TraceCheckUtils]: 75: Hoare triple {26066#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26067#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:29:06,644 INFO L290 TraceCheckUtils]: 76: Hoare triple {26067#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !!(~x~0 % 4294967296 < 268435455); {26067#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:29:06,648 INFO L290 TraceCheckUtils]: 77: Hoare triple {26067#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26068#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:29:06,648 INFO L290 TraceCheckUtils]: 78: Hoare triple {26068#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26068#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:29:06,683 INFO L290 TraceCheckUtils]: 79: Hoare triple {26068#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26069#(and (<= main_~x~0 37) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:29:06,683 INFO L290 TraceCheckUtils]: 80: Hoare triple {26069#(and (<= main_~x~0 37) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {26069#(and (<= main_~x~0 37) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:29:06,688 INFO L290 TraceCheckUtils]: 81: Hoare triple {26069#(and (<= main_~x~0 37) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {26028#false} is VALID [2022-04-15 12:29:06,688 INFO L290 TraceCheckUtils]: 82: Hoare triple {26028#false} assume !(~x~0 % 4294967296 < 268435455); {26028#false} is VALID [2022-04-15 12:29:06,688 INFO L272 TraceCheckUtils]: 83: Hoare triple {26028#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {26028#false} is VALID [2022-04-15 12:29:06,689 INFO L290 TraceCheckUtils]: 84: Hoare triple {26028#false} ~cond := #in~cond; {26028#false} is VALID [2022-04-15 12:29:06,689 INFO L290 TraceCheckUtils]: 85: Hoare triple {26028#false} assume 0 == ~cond; {26028#false} is VALID [2022-04-15 12:29:06,689 INFO L290 TraceCheckUtils]: 86: Hoare triple {26028#false} assume !false; {26028#false} is VALID [2022-04-15 12:29:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 38 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:29:06,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:06,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722819518] [2022-04-15 12:29:06,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722819518] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:29:06,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068486164] [2022-04-15 12:29:06,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:29:06,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:29:06,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:29:06,690 INFO L229 MonitoredProcess]: Starting monitored process 38 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:29:06,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 12:29:06,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:29:06,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:29:06,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-15 12:29:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:06,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:29:07,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {26027#true} call ULTIMATE.init(); {26027#true} is VALID [2022-04-15 12:29:07,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {26027#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(13, 2);call #Ultimate.allocInit(12, 3); {26027#true} is VALID [2022-04-15 12:29:07,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {26027#true} assume true; {26027#true} is VALID [2022-04-15 12:29:07,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26027#true} {26027#true} #40#return; {26027#true} is VALID [2022-04-15 12:29:07,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {26027#true} call #t~ret5 := main(); {26027#true} is VALID [2022-04-15 12:29:07,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {26027#true} ~x~0 := 0; {26032#(= main_~x~0 0)} is VALID [2022-04-15 12:29:07,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {26032#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {26032#(= main_~x~0 0)} is VALID [2022-04-15 12:29:07,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {26032#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26033#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:29:07,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {26033#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {26033#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:29:07,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {26033#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26034#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:29:07,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {26034#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {26034#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:29:07,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {26034#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26035#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:29:07,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {26035#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26035#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:29:07,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {26035#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26036#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:29:07,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {26036#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26036#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:29:07,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {26036#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26037#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:29:07,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {26037#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {26037#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:29:07,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {26037#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26038#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:29:07,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {26038#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {26038#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:29:07,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {26038#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26039#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:29:07,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {26039#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26039#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:29:07,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {26039#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26040#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:29:07,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {26040#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26040#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:29:07,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {26040#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26041#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:29:07,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {26041#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26041#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:29:07,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {26041#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26042#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:29:07,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {26042#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26042#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:29:07,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {26042#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26043#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:29:07,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {26043#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26043#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:29:07,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {26043#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26044#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:29:07,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {26044#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26044#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:29:07,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {26044#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26045#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:29:07,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {26045#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26045#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:29:07,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {26045#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26046#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:29:07,785 INFO L290 TraceCheckUtils]: 34: Hoare triple {26046#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {26046#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:29:07,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {26046#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26047#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:29:07,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {26047#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {26047#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:29:07,840 INFO L290 TraceCheckUtils]: 37: Hoare triple {26047#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26048#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:29:07,841 INFO L290 TraceCheckUtils]: 38: Hoare triple {26048#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26048#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:29:07,868 INFO L290 TraceCheckUtils]: 39: Hoare triple {26048#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26049#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:29:07,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {26049#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {26049#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:29:07,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {26049#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26050#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:29:07,873 INFO L290 TraceCheckUtils]: 42: Hoare triple {26050#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26050#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:29:07,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {26050#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26051#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:29:07,877 INFO L290 TraceCheckUtils]: 44: Hoare triple {26051#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {26051#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:29:07,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {26051#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26052#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:29:07,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {26052#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26052#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:29:07,939 INFO L290 TraceCheckUtils]: 47: Hoare triple {26052#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26053#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:29:07,939 INFO L290 TraceCheckUtils]: 48: Hoare triple {26053#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {26053#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:29:07,966 INFO L290 TraceCheckUtils]: 49: Hoare triple {26053#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26054#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:29:07,966 INFO L290 TraceCheckUtils]: 50: Hoare triple {26054#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {26054#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:29:07,994 INFO L290 TraceCheckUtils]: 51: Hoare triple {26054#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26055#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:29:07,995 INFO L290 TraceCheckUtils]: 52: Hoare triple {26055#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {26055#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:29:08,023 INFO L290 TraceCheckUtils]: 53: Hoare triple {26055#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26056#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:29:08,024 INFO L290 TraceCheckUtils]: 54: Hoare triple {26056#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26056#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:29:08,052 INFO L290 TraceCheckUtils]: 55: Hoare triple {26056#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26057#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:29:08,052 INFO L290 TraceCheckUtils]: 56: Hoare triple {26057#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26057#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:29:08,079 INFO L290 TraceCheckUtils]: 57: Hoare triple {26057#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26058#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:29:08,080 INFO L290 TraceCheckUtils]: 58: Hoare triple {26058#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26058#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:29:08,085 INFO L290 TraceCheckUtils]: 59: Hoare triple {26058#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26059#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:29:08,086 INFO L290 TraceCheckUtils]: 60: Hoare triple {26059#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {26059#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:29:08,090 INFO L290 TraceCheckUtils]: 61: Hoare triple {26059#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26060#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:29:08,090 INFO L290 TraceCheckUtils]: 62: Hoare triple {26060#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {26060#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:29:08,120 INFO L290 TraceCheckUtils]: 63: Hoare triple {26060#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26061#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:29:08,121 INFO L290 TraceCheckUtils]: 64: Hoare triple {26061#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26061#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:29:08,148 INFO L290 TraceCheckUtils]: 65: Hoare triple {26061#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26062#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:29:08,149 INFO L290 TraceCheckUtils]: 66: Hoare triple {26062#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455); {26062#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:29:08,176 INFO L290 TraceCheckUtils]: 67: Hoare triple {26062#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26063#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:29:08,177 INFO L290 TraceCheckUtils]: 68: Hoare triple {26063#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 268435455); {26063#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:29:08,204 INFO L290 TraceCheckUtils]: 69: Hoare triple {26063#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26064#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:29:08,204 INFO L290 TraceCheckUtils]: 70: Hoare triple {26064#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26064#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:29:08,231 INFO L290 TraceCheckUtils]: 71: Hoare triple {26064#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26065#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:29:08,232 INFO L290 TraceCheckUtils]: 72: Hoare triple {26065#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26065#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:29:08,259 INFO L290 TraceCheckUtils]: 73: Hoare triple {26065#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26066#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:29:08,259 INFO L290 TraceCheckUtils]: 74: Hoare triple {26066#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26066#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:29:08,286 INFO L290 TraceCheckUtils]: 75: Hoare triple {26066#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26067#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:29:08,287 INFO L290 TraceCheckUtils]: 76: Hoare triple {26067#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !!(~x~0 % 4294967296 < 268435455); {26067#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:29:08,291 INFO L290 TraceCheckUtils]: 77: Hoare triple {26067#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26068#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:29:08,291 INFO L290 TraceCheckUtils]: 78: Hoare triple {26068#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26068#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:29:08,318 INFO L290 TraceCheckUtils]: 79: Hoare triple {26068#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26311#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-15 12:29:08,319 INFO L290 TraceCheckUtils]: 80: Hoare triple {26311#(and (<= main_~x~0 37) (<= 37 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {26311#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-15 12:29:08,320 INFO L290 TraceCheckUtils]: 81: Hoare triple {26311#(and (<= main_~x~0 37) (<= 37 main_~x~0))} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {26318#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-15 12:29:08,325 INFO L290 TraceCheckUtils]: 82: Hoare triple {26318#(and (<= main_~x~0 39) (<= 39 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {26028#false} is VALID [2022-04-15 12:29:08,325 INFO L272 TraceCheckUtils]: 83: Hoare triple {26028#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {26028#false} is VALID [2022-04-15 12:29:08,326 INFO L290 TraceCheckUtils]: 84: Hoare triple {26028#false} ~cond := #in~cond; {26028#false} is VALID [2022-04-15 12:29:08,326 INFO L290 TraceCheckUtils]: 85: Hoare triple {26028#false} assume 0 == ~cond; {26028#false} is VALID [2022-04-15 12:29:08,326 INFO L290 TraceCheckUtils]: 86: Hoare triple {26028#false} assume !false; {26028#false} is VALID [2022-04-15 12:29:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:29:08,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:29:18,808 INFO L290 TraceCheckUtils]: 86: Hoare triple {26028#false} assume !false; {26028#false} is VALID [2022-04-15 12:29:18,808 INFO L290 TraceCheckUtils]: 85: Hoare triple {26028#false} assume 0 == ~cond; {26028#false} is VALID [2022-04-15 12:29:18,808 INFO L290 TraceCheckUtils]: 84: Hoare triple {26028#false} ~cond := #in~cond; {26028#false} is VALID [2022-04-15 12:29:18,808 INFO L272 TraceCheckUtils]: 83: Hoare triple {26028#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {26028#false} is VALID [2022-04-15 12:29:18,808 INFO L290 TraceCheckUtils]: 82: Hoare triple {26346#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {26028#false} is VALID [2022-04-15 12:29:18,811 INFO L290 TraceCheckUtils]: 81: Hoare triple {26350#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65521);~x~0 := 2 + ~x~0; {26346#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:29:18,812 INFO L290 TraceCheckUtils]: 80: Hoare triple {26350#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26350#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:29:18,840 INFO L290 TraceCheckUtils]: 79: Hoare triple {26357#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26350#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:29:18,841 INFO L290 TraceCheckUtils]: 78: Hoare triple {26357#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26357#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:29:18,865 INFO L290 TraceCheckUtils]: 77: Hoare triple {26364#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26357#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:29:18,865 INFO L290 TraceCheckUtils]: 76: Hoare triple {26364#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26364#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:29:18,871 INFO L290 TraceCheckUtils]: 75: Hoare triple {26371#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26364#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:29:18,871 INFO L290 TraceCheckUtils]: 74: Hoare triple {26371#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26371#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:29:18,873 INFO L290 TraceCheckUtils]: 73: Hoare triple {26378#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26371#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:29:18,874 INFO L290 TraceCheckUtils]: 72: Hoare triple {26378#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26378#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:29:18,906 INFO L290 TraceCheckUtils]: 71: Hoare triple {26385#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26378#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:29:18,906 INFO L290 TraceCheckUtils]: 70: Hoare triple {26385#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26385#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:29:18,937 INFO L290 TraceCheckUtils]: 69: Hoare triple {26392#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26385#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:29:18,938 INFO L290 TraceCheckUtils]: 68: Hoare triple {26392#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26392#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:29:18,971 INFO L290 TraceCheckUtils]: 67: Hoare triple {26399#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26392#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:29:18,972 INFO L290 TraceCheckUtils]: 66: Hoare triple {26399#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26399#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,003 INFO L290 TraceCheckUtils]: 65: Hoare triple {26406#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26399#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,004 INFO L290 TraceCheckUtils]: 64: Hoare triple {26406#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26406#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,029 INFO L290 TraceCheckUtils]: 63: Hoare triple {26413#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26406#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,029 INFO L290 TraceCheckUtils]: 62: Hoare triple {26413#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26413#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,035 INFO L290 TraceCheckUtils]: 61: Hoare triple {26420#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26413#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,035 INFO L290 TraceCheckUtils]: 60: Hoare triple {26420#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26420#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,062 INFO L290 TraceCheckUtils]: 59: Hoare triple {26427#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26420#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,062 INFO L290 TraceCheckUtils]: 58: Hoare triple {26427#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26427#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,068 INFO L290 TraceCheckUtils]: 57: Hoare triple {26434#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26427#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,068 INFO L290 TraceCheckUtils]: 56: Hoare triple {26434#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26434#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,070 INFO L290 TraceCheckUtils]: 55: Hoare triple {26441#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26434#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,070 INFO L290 TraceCheckUtils]: 54: Hoare triple {26441#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26441#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,104 INFO L290 TraceCheckUtils]: 53: Hoare triple {26448#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26441#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {26448#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26448#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,135 INFO L290 TraceCheckUtils]: 51: Hoare triple {26455#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26448#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,135 INFO L290 TraceCheckUtils]: 50: Hoare triple {26455#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26455#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {26462#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26455#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {26462#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26462#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,177 INFO L290 TraceCheckUtils]: 47: Hoare triple {26469#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26462#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,177 INFO L290 TraceCheckUtils]: 46: Hoare triple {26469#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26469#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,183 INFO L290 TraceCheckUtils]: 45: Hoare triple {26476#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26469#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,183 INFO L290 TraceCheckUtils]: 44: Hoare triple {26476#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26476#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {26483#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26476#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {26483#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26483#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {26490#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26483#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {26490#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26490#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,274 INFO L290 TraceCheckUtils]: 39: Hoare triple {26497#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26490#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,275 INFO L290 TraceCheckUtils]: 38: Hoare triple {26497#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26497#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {26504#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26497#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {26504#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26504#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {26511#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26504#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,283 INFO L290 TraceCheckUtils]: 34: Hoare triple {26511#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26511#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,285 INFO L290 TraceCheckUtils]: 33: Hoare triple {26518#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26511#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,285 INFO L290 TraceCheckUtils]: 32: Hoare triple {26518#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26518#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {26525#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26518#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {26525#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26525#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {26532#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26525#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {26532#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26532#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {26539#(< (mod (+ 29 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26532#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {26539#(< (mod (+ 29 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26539#(< (mod (+ 29 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {26546#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26539#(< (mod (+ 29 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {26546#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26546#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {26553#(< (mod (+ main_~x~0 31) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26546#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {26553#(< (mod (+ main_~x~0 31) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26553#(< (mod (+ main_~x~0 31) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {26560#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26553#(< (mod (+ main_~x~0 31) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {26560#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26560#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {26567#(< (mod (+ main_~x~0 33) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26560#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {26567#(< (mod (+ main_~x~0 33) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26567#(< (mod (+ main_~x~0 33) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {26574#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26567#(< (mod (+ main_~x~0 33) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {26574#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26574#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {26581#(< (mod (+ 35 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26574#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {26581#(< (mod (+ 35 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26581#(< (mod (+ 35 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {26588#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26581#(< (mod (+ 35 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {26588#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26588#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {26595#(< (mod (+ main_~x~0 37) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26588#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {26595#(< (mod (+ main_~x~0 37) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26595#(< (mod (+ main_~x~0 37) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {26602#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26595#(< (mod (+ main_~x~0 37) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {26602#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26602#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {26609#(< (mod (+ main_~x~0 39) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65521;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26602#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {26609#(< (mod (+ main_~x~0 39) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {26609#(< (mod (+ main_~x~0 39) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {26027#true} ~x~0 := 0; {26609#(< (mod (+ main_~x~0 39) 4294967296) 268435455)} is VALID [2022-04-15 12:29:19,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {26027#true} call #t~ret5 := main(); {26027#true} is VALID [2022-04-15 12:29:19,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26027#true} {26027#true} #40#return; {26027#true} is VALID [2022-04-15 12:29:19,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {26027#true} assume true; {26027#true} is VALID [2022-04-15 12:29:19,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {26027#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(13, 2);call #Ultimate.allocInit(12, 3); {26027#true} is VALID [2022-04-15 12:29:19,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {26027#true} call ULTIMATE.init(); {26027#true} is VALID [2022-04-15 12:29:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:29:19,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068486164] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:29:19,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:29:19,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 82 [2022-04-15 12:29:19,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:19,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1129903075] [2022-04-15 12:29:19,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1129903075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:19,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:19,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 12:29:19,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250404956] [2022-04-15 12:29:19,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:19,551 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 2 states have call successors, (3), 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 87 [2022-04-15 12:29:19,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:19,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:21,079 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:29:21,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 12:29:21,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:21,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 12:29:21,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1759, Invalid=4883, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 12:29:21,081 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)