/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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:17:22,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:17:22,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:17:22,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:17:22,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:17:22,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:17:22,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:17:22,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:17:22,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:17:22,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:17:22,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:17:22,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:17:22,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:17:22,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:17:22,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:17:22,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:17:22,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:17:22,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:17:22,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:17:22,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:17:22,771 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:17:22,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:17:22,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:17:22,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:17:22,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:17:22,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:17:22,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:17:22,789 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:17:22,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:17:22,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:17:22,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:17:22,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:17:22,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:17:22,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:17:22,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:17:22,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:17:22,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:17:22,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:17:22,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:17:22,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:17:22,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:17:22,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:17:22,800 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,811 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:17:22,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:17:22,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:17:22,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:17:22,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:17:22,813 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:17:22,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:17:22,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:17:22,814 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:17:22,814 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:17:22,814 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:17:22,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:17:22,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:17:22,815 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:17:22,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:17:22,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:17:22,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:17:22,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:17:22,815 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:17:22,815 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:17:22,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:17:22,815 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:17:22,815 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,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:17:23,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:17:23,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:17:23,043 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:17:23,043 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:17:23,044 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2022-04-15 12:17:23,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb0869cbb/e184a7b78dc94ec48d7aaaf7cfb77b28/FLAG792e31605 [2022-04-15 12:17:23,459 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:17:23,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2022-04-15 12:17:23,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb0869cbb/e184a7b78dc94ec48d7aaaf7cfb77b28/FLAG792e31605 [2022-04-15 12:17:23,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb0869cbb/e184a7b78dc94ec48d7aaaf7cfb77b28 [2022-04-15 12:17:23,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:17:23,478 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:17:23,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:17:23,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:17:23,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:17:23,488 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,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3921dcb7 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,490 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,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:17:23,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:17:23,636 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-1.c[322,335] [2022-04-15 12:17:23,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:17:23,652 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:17:23,665 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-1.c[322,335] [2022-04-15 12:17:23,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:17:23,683 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:17:23,683 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,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:17:23,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:17:23,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:17:23,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:17:23,691 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,692 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,695 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,696 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,704 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,708 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,710 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,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:17:23,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:17:23,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:17:23,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:17:23,715 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,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:17:23,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:23,745 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:23,750 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:23,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:17:23,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:17:23,775 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:17:23,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:17:23,775 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:17:23,776 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:17:23,776 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:17:23,776 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:17:23,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:17:23,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:17:23,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:17:23,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:17:23,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:17:23,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:17:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:17:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:17:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:17:23,824 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:17:23,825 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:17:23,911 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:17:23,916 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:17:23,916 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:17:23,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:17:23 BoogieIcfgContainer [2022-04-15 12:17:23,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:17:23,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:17:23,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:17:23,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:17:23,922 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:23,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a786d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:17:23, skipping insertion in model container [2022-04-15 12:17:23,922 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:23,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a786d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:17:23, skipping insertion in model container [2022-04-15 12:17:23,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:17:23" (3/3) ... [2022-04-15 12:17:23,923 INFO L111 eAbstractionObserver]: Analyzing ICFG phases_1-1.c [2022-04-15 12:17:23,927 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:17:23,927 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:17:23,963 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:17:23,967 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:23,967 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:17:23,980 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:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:17:23,985 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:23,985 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:23,985 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:23,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:23,989 INFO L85 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 1 times [2022-04-15 12:17:23,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:23,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1276354420] [2022-04-15 12:17:24,013 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:17:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 2 times [2022-04-15 12:17:24,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:24,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165632585] [2022-04-15 12:17:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:24,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:24,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:24,204 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,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:17:24,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #40#return; {22#true} is VALID [2022-04-15 12:17:24,207 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,207 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,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:17:24,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #40#return; {22#true} is VALID [2022-04-15 12:17:24,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret5 := main(); {22#true} is VALID [2022-04-15 12:17:24,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~x~0 := 0; {22#true} is VALID [2022-04-15 12:17:24,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-15 12:17:24,212 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,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-15 12:17:24,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-15 12:17:24,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-15 12:17:24,213 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,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:24,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165632585] [2022-04-15 12:17:24,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165632585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:24,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:24,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:17:24,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:24,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1276354420] [2022-04-15 12:17:24,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1276354420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:24,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:24,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:17:24,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159986235] [2022-04-15 12:17:24,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:24,224 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,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:24,228 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,247 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,247 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:17:24,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:24,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:17:24,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:17:24,274 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,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:24,355 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 12:17:24,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:17:24,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:17:24,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:24,357 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,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-15 12:17:24,366 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,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-15 12:17:24,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-15 12:17:24,431 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,436 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:17:24,437 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 12:17:24,439 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,441 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,442 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,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 12:17:24,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 12:17:24,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:24,485 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,486 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,486 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,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:24,487 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 12:17:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 12:17:24,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:24,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:24,488 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,488 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,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:24,490 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 12:17:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 12:17:24,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:24,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:24,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:24,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:24,491 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,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-15 12:17:24,493 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-15 12:17:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:24,494 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-15 12:17:24,496 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,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-15 12:17:24,515 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,516 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 12:17:24,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:17:24,516 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:24,516 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:24,517 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:17:24,517 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:24,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 1 times [2022-04-15 12:17:24,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:24,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [294517723] [2022-04-15 12:17:24,519 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:17:24,519 INFO L85 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 2 times [2022-04-15 12:17:24,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:24,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782011204] [2022-04-15 12:17:24,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:24,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:24,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:24,657 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:24,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-15 12:17:24,658 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #40#return; {142#true} is VALID [2022-04-15 12:17:24,659 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:24,659 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:24,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-15 12:17:24,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #40#return; {142#true} is VALID [2022-04-15 12:17:24,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret5 := main(); {142#true} is VALID [2022-04-15 12:17:24,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#true} ~x~0 := 0; {147#(= main_~x~0 0)} is VALID [2022-04-15 12:17:24,661 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:24,662 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:24,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2022-04-15 12:17:24,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2022-04-15 12:17:24,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2022-04-15 12:17:24,663 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,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:24,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782011204] [2022-04-15 12:17:24,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782011204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:24,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:24,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:24,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:24,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [294517723] [2022-04-15 12:17:24,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [294517723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:24,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:24,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:24,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636258855] [2022-04-15 12:17:24,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:24,668 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:24,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:24,669 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:24,681 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,682 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:17:24,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:24,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:17:24,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:17:24,684 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:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:24,748 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 12:17:24,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:17:24,749 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:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:24,749 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:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 12:17:24,756 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:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 12:17:24,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-15 12:17:24,782 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:24,784 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:17:24,785 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 12:17:24,785 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:24,788 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:24,788 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:24,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 12:17:24,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 12:17:24,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:24,795 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:24,795 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:24,796 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:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:24,797 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 12:17:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:17:24,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:24,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:24,798 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:24,799 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:24,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:24,800 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 12:17:24,800 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:17:24,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:24,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:24,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:24,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:24,801 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:24,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 12:17:24,802 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-15 12:17:24,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:24,802 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 12:17:24,804 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:24,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 12:17:24,820 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:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:17:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:17:24,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:24,822 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:24,822 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:17:24,822 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:24,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash 925229631, now seen corresponding path program 1 times [2022-04-15 12:17:24,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:24,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1187556981] [2022-04-15 12:17:24,932 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:24,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1303175503, now seen corresponding path program 1 times [2022-04-15 12:17:24,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:24,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300302538] [2022-04-15 12:17:24,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:24,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:25,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:25,030 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,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-15 12:17:25,030 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {257#true} {257#true} #40#return; {257#true} is VALID [2022-04-15 12:17:25,031 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,031 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,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-15 12:17:25,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #40#return; {257#true} is VALID [2022-04-15 12:17:25,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret5 := main(); {257#true} is VALID [2022-04-15 12:17:25,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#true} ~x~0 := 0; {262#(= main_~x~0 0)} is VALID [2022-04-15 12:17:25,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#(= main_~x~0 0)} [46] L16-2-->L15-2_primed: Formula: (or (= v_main_~x~0_In_1 v_main_~x~0_Out_2) (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) 65520))) 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 (= main_~x~0 0) (<= (+ main_~x~0 4294901776) (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296)))} is VALID [2022-04-15 12:17:25,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(or (= main_~x~0 0) (<= (+ main_~x~0 4294901776) (* (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,034 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,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {258#false} ~cond := #in~cond; {258#false} is VALID [2022-04-15 12:17:25,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {258#false} assume 0 == ~cond; {258#false} is VALID [2022-04-15 12:17:25,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {258#false} assume !false; {258#false} is VALID [2022-04-15 12:17:25,035 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,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:25,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300302538] [2022-04-15 12:17:25,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300302538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:25,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:25,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:17:25,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:25,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1187556981] [2022-04-15 12:17:25,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1187556981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:25,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:25,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:17:25,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142717175] [2022-04-15 12:17:25,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:25,136 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,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:25,136 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,152 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,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:17:25,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:25,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:17:25,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:17:25,154 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,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:25,305 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 12:17:25,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:17:25,306 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,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:25,306 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,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 12:17:25,307 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,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 12:17:25,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-15 12:17:25,335 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:25,336 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:17:25,336 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:17:25,337 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:25,337 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:25,338 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.0s Time] [2022-04-15 12:17:25,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:17:25,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:17:25,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:25,348 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:25,348 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:25,349 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:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:25,349 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:17:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:17:25,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:25,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:25,350 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:25,350 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:25,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:25,351 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:17:25,351 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:17:25,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:25,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:25,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:25,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:25,361 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:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 12:17:25,362 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-15 12:17:25,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:25,362 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 12:17:25,362 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:25,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 12:17:25,385 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:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:17:25,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:17:25,386 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:25,386 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:25,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:17:25,387 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:25,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:25,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1220035546, now seen corresponding path program 1 times [2022-04-15 12:17:25,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:25,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1035903056] [2022-04-15 12:17:25,628 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:25,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1244070159, now seen corresponding path program 1 times [2022-04-15 12:17:25,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:25,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258704144] [2022-04-15 12:17:25,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:25,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:25,648 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:25,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:25,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1220035546, now seen corresponding path program 2 times [2022-04-15 12:17:25,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:25,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059866252] [2022-04-15 12:17:25,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:25,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:25,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:25,762 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:25,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 12:17:25,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-15 12:17:25,763 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:25,764 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:25,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 12:17:25,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-15 12:17:25,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-15 12:17:25,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} ~x~0 := 0; {390#(= main_~x~0 0)} is VALID [2022-04-15 12:17:25,767 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:25,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#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:25,770 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:25,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {386#false} is VALID [2022-04-15 12:17:25,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {386#false} assume !(~x~0 % 4294967296 < 268435455); {386#false} is VALID [2022-04-15 12:17:25,770 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:25,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 12:17:25,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 12:17:25,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 12:17:25,771 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:25,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:25,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059866252] [2022-04-15 12:17:25,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059866252] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:25,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511632400] [2022-04-15 12:17:25,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:25,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:25,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:25,788 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:25,789 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:25,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:25,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:25,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 12:17:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:25,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:25,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-15 12:17:25,900 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:25,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 12:17:25,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-15 12:17:25,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-15 12:17:25,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} ~x~0 := 0; {390#(= main_~x~0 0)} is VALID [2022-04-15 12:17:25,920 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:25,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#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:25,921 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:25,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#(= (+ (- 1) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {424#(= main_~x~0 3)} is VALID [2022-04-15 12:17:25,922 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:25,922 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:25,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 12:17:25,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 12:17:25,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 12:17:25,922 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:25,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:25,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 12:17:25,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 12:17:25,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 12:17:25,992 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:25,993 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:25,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {456#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {452#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:25,994 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:25,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#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:25,995 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:25,995 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:25,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-15 12:17:25,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-15 12:17:25,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 12:17:25,996 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:25,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-15 12:17:25,996 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:25,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511632400] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:25,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:25,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-04-15 12:17:25,997 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:25,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1035903056] [2022-04-15 12:17:25,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1035903056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:25,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:25,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:17:25,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136274230] [2022-04-15 12:17:25,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:25,998 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:25,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:25,998 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,009 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,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:17:26,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:26,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:17:26,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:17:26,010 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,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:26,082 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 12:17:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:17:26,082 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,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:26,083 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,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-15 12:17:26,084 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,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-15 12:17:26,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-15 12:17:26,104 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,104 INFO L225 Difference]: With dead ends: 26 [2022-04-15 12:17:26,105 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 12:17:26,105 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,106 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,106 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,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 12:17:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 12:17:26,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:26,122 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,122 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,122 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,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:26,123 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 12:17:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:17:26,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:26,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:26,124 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,124 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,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:26,124 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 12:17:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:17:26,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:26,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:26,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:26,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:26,125 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,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 12:17:26,126 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-15 12:17:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:26,126 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 12:17:26,126 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,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 12:17:26,168 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,168 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:17:26,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:17:26,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:26,168 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,189 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:26,383 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:26,384 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:26,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:26,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1870024951, now seen corresponding path program 3 times [2022-04-15 12:17:26,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:26,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [583685551] [2022-04-15 12:17:26,568 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:26,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1184964815, now seen corresponding path program 1 times [2022-04-15 12:17:26,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:26,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742917819] [2022-04-15 12:17:26,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:26,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:26,595 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:26,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:26,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1870024951, now seen corresponding path program 4 times [2022-04-15 12:17:26,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:26,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534415605] [2022-04-15 12:17:26,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:26,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:26,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:26,684 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:26,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-15 12:17:26,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {619#true} {619#true} #40#return; {619#true} is VALID [2022-04-15 12:17:26,684 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:26,685 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:26,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-15 12:17:26,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {619#true} #40#return; {619#true} is VALID [2022-04-15 12:17:26,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {619#true} call #t~ret5 := main(); {619#true} is VALID [2022-04-15 12:17:26,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {619#true} ~x~0 := 0; {624#(= main_~x~0 0)} is VALID [2022-04-15 12:17:26,686 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:26,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {624#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#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:26,686 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:26,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {625#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#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:26,688 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:26,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {626#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {620#false} is VALID [2022-04-15 12:17:26,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {620#false} assume !(~x~0 % 4294967296 < 268435455); {620#false} is VALID [2022-04-15 12:17:26,688 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:26,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {620#false} ~cond := #in~cond; {620#false} is VALID [2022-04-15 12:17:26,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {620#false} assume 0 == ~cond; {620#false} is VALID [2022-04-15 12:17:26,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {620#false} assume !false; {620#false} is VALID [2022-04-15 12:17:26,689 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:26,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:26,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534415605] [2022-04-15 12:17:26,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534415605] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:26,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628295945] [2022-04-15 12:17:26,690 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:26,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:26,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:26,691 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:26,723 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:26,735 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:26,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:26,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:17:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:26,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:26,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {619#true} call ULTIMATE.init(); {619#true} is VALID [2022-04-15 12:17:26,979 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:26,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-15 12:17:26,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {619#true} #40#return; {619#true} is VALID [2022-04-15 12:17:26,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {619#true} call #t~ret5 := main(); {619#true} is VALID [2022-04-15 12:17:26,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {619#true} ~x~0 := 0; {624#(= main_~x~0 0)} is VALID [2022-04-15 12:17:26,986 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:26,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {624#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#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:26,987 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:26,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {625#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#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:26,988 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:26,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {665#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:26,989 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:26,990 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:26,990 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:26,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {620#false} is VALID [2022-04-15 12:17:26,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {620#false} assume !false; {620#false} is VALID [2022-04-15 12:17:26,991 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:26,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:27,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {620#false} assume !false; {620#false} is VALID [2022-04-15 12:17:27,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {620#false} is VALID [2022-04-15 12:17:27,123 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,124 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:27,124 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:27,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {692#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {692#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:27,125 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:27,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {705#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#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:27,126 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:27,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {692#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#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:27,127 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:27,128 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:27,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {619#true} call #t~ret5 := main(); {619#true} is VALID [2022-04-15 12:17:27,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {619#true} #40#return; {619#true} is VALID [2022-04-15 12:17:27,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-15 12:17:27,128 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,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {619#true} call ULTIMATE.init(); {619#true} is VALID [2022-04-15 12:17:27,128 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:27,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628295945] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:27,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:27,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2022-04-15 12:17:27,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:27,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [583685551] [2022-04-15 12:17:27,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [583685551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:27,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:27,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:17:27,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120563198] [2022-04-15 12:17:27,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:27,130 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:27,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:27,130 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:27,145 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:27,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:17:27,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:27,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:17:27,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:17:27,146 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:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:27,263 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 12:17:27,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:17:27,264 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:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:27,264 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:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-15 12:17:27,265 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:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-15 12:17:27,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2022-04-15 12:17:27,292 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:27,293 INFO L225 Difference]: With dead ends: 28 [2022-04-15 12:17:27,293 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:17:27,293 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:27,294 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:27,294 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:27,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:17:27,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 12:17:27,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:27,313 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:27,313 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:27,313 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:27,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:27,314 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 12:17:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:17:27,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:27,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:27,314 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:27,315 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:27,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:27,315 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 12:17:27,315 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:17:27,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:27,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:27,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:27,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:27,316 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:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-15 12:17:27,316 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-04-15 12:17:27,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:27,317 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-15 12:17:27,317 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:27,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-15 12:17:27,355 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:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:17:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:17:27,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:27,356 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:27,391 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:27,557 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:27,557 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:27,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:27,558 INFO L85 PathProgramCache]: Analyzing trace with hash -555382060, now seen corresponding path program 5 times [2022-04-15 12:17:27,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:27,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1427981465] [2022-04-15 12:17:27,764 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:27,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1125859471, now seen corresponding path program 1 times [2022-04-15 12:17:27,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:27,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037714864] [2022-04-15 12:17:27,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:27,779 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:27,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash -555382060, now seen corresponding path program 6 times [2022-04-15 12:17:27,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:27,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982522594] [2022-04-15 12:17:27,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:27,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:27,863 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:27,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 12:17:27,864 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {881#true} {881#true} #40#return; {881#true} is VALID [2022-04-15 12:17:27,864 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:27,864 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:27,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 12:17:27,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {881#true} #40#return; {881#true} is VALID [2022-04-15 12:17:27,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {881#true} call #t~ret5 := main(); {881#true} is VALID [2022-04-15 12:17:27,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#true} ~x~0 := 0; {886#(= main_~x~0 0)} is VALID [2022-04-15 12:17:27,865 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:27,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {886#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#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:27,866 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:27,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {887#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#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:27,867 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:27,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {888#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:27,868 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:27,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {889#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {882#false} is VALID [2022-04-15 12:17:27,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {882#false} assume !(~x~0 % 4294967296 < 268435455); {882#false} is VALID [2022-04-15 12:17:27,869 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:27,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {882#false} ~cond := #in~cond; {882#false} is VALID [2022-04-15 12:17:27,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {882#false} assume 0 == ~cond; {882#false} is VALID [2022-04-15 12:17:27,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {882#false} assume !false; {882#false} is VALID [2022-04-15 12:17:27,869 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:27,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:27,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982522594] [2022-04-15 12:17:27,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982522594] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:27,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145172726] [2022-04-15 12:17:27,869 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:27,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:27,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:27,880 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:27,881 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:27,929 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 12:17:27,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:27,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:17:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:27,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:28,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {881#true} call ULTIMATE.init(); {881#true} is VALID [2022-04-15 12:17:28,150 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:28,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 12:17:28,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {881#true} #40#return; {881#true} is VALID [2022-04-15 12:17:28,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {881#true} call #t~ret5 := main(); {881#true} is VALID [2022-04-15 12:17:28,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#true} ~x~0 := 0; {881#true} is VALID [2022-04-15 12:17:28,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#true} assume !!(~x~0 % 4294967296 < 268435455); {881#true} is VALID [2022-04-15 12:17:28,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {881#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {881#true} is VALID [2022-04-15 12:17:28,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {881#true} assume !!(~x~0 % 4294967296 < 268435455); {881#true} is VALID [2022-04-15 12:17:28,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {881#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {881#true} is VALID [2022-04-15 12:17:28,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {881#true} assume !!(~x~0 % 4294967296 < 268435455); {881#true} is VALID [2022-04-15 12:17:28,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {881#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {927#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:17:28,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {927#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {927#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:17:28,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {927#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {934#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2022-04-15 12:17:28,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {934#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 268435455); {882#false} is VALID [2022-04-15 12:17:28,156 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,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {882#false} ~cond := #in~cond; {882#false} is VALID [2022-04-15 12:17:28,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {882#false} assume 0 == ~cond; {882#false} is VALID [2022-04-15 12:17:28,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {882#false} assume !false; {882#false} is VALID [2022-04-15 12:17:28,157 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:28,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:28,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {882#false} assume !false; {882#false} is VALID [2022-04-15 12:17:28,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {882#false} assume 0 == ~cond; {882#false} is VALID [2022-04-15 12:17:28,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {882#false} ~cond := #in~cond; {882#false} is VALID [2022-04-15 12:17:28,389 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,390 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:28,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {966#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {962#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:28,391 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:28,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {881#true} assume ~x~0 % 4294967296 < 65520;#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:28,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {881#true} assume !!(~x~0 % 4294967296 < 268435455); {881#true} is VALID [2022-04-15 12:17:28,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {881#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {881#true} is VALID [2022-04-15 12:17:28,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {881#true} assume !!(~x~0 % 4294967296 < 268435455); {881#true} is VALID [2022-04-15 12:17:28,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {881#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {881#true} is VALID [2022-04-15 12:17:28,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#true} assume !!(~x~0 % 4294967296 < 268435455); {881#true} is VALID [2022-04-15 12:17:28,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {881#true} ~x~0 := 0; {881#true} is VALID [2022-04-15 12:17:28,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {881#true} call #t~ret5 := main(); {881#true} is VALID [2022-04-15 12:17:28,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {881#true} {881#true} #40#return; {881#true} is VALID [2022-04-15 12:17:28,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {881#true} assume true; {881#true} is VALID [2022-04-15 12:17:28,393 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:28,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {881#true} call ULTIMATE.init(); {881#true} is VALID [2022-04-15 12:17:28,393 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:28,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145172726] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:28,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:28,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2022-04-15 12:17:28,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:28,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1427981465] [2022-04-15 12:17:28,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1427981465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:28,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:28,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:17:28,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092320515] [2022-04-15 12:17:28,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:28,394 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:28,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:28,395 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:28,413 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:28,413 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:17:28,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:28,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:17:28,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:17:28,414 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:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:28,567 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 12:17:28,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:17:28,567 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:28,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:28,567 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:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 12:17:28,568 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:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 12:17:28,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-15 12:17:28,596 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:28,597 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:17:28,597 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:17:28,597 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:28,598 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:28,598 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:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:17:28,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 12:17:28,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:28,625 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:28,625 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:28,625 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:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:28,626 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 12:17:28,626 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:17:28,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:28,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:28,626 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:28,626 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:28,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:28,627 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 12:17:28,627 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:17:28,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:28,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:28,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:28,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:28,627 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:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-15 12:17:28,628 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2022-04-15 12:17:28,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:28,628 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-15 12:17:28,628 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:28,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-15 12:17:28,673 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:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:17:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:17:28,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:28,674 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:28,682 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:28,874 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:28,875 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:28,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:28,875 INFO L85 PathProgramCache]: Analyzing trace with hash 795722097, now seen corresponding path program 7 times [2022-04-15 12:17:28,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:28,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [724235541] [2022-04-15 12:17:29,135 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1066754127, now seen corresponding path program 1 times [2022-04-15 12:17:29,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:29,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045361046] [2022-04-15 12:17:29,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:29,148 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:29,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:29,159 INFO L85 PathProgramCache]: Analyzing trace with hash 795722097, now seen corresponding path program 8 times [2022-04-15 12:17:29,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:29,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819025173] [2022-04-15 12:17:29,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:29,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:29,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:29,248 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:29,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {1168#true} assume true; {1168#true} is VALID [2022-04-15 12:17:29,248 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1168#true} {1168#true} #40#return; {1168#true} is VALID [2022-04-15 12:17:29,248 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:29,248 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:29,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {1168#true} assume true; {1168#true} is VALID [2022-04-15 12:17:29,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1168#true} {1168#true} #40#return; {1168#true} is VALID [2022-04-15 12:17:29,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {1168#true} call #t~ret5 := main(); {1168#true} is VALID [2022-04-15 12:17:29,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {1168#true} ~x~0 := 0; {1173#(= main_~x~0 0)} is VALID [2022-04-15 12:17:29,249 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:29,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#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:29,250 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:29,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {1174#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#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:29,251 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:29,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {1175#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:29,252 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:29,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {1176#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:29,253 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:29,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {1177#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1169#false} is VALID [2022-04-15 12:17:29,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {1169#false} assume !(~x~0 % 4294967296 < 268435455); {1169#false} is VALID [2022-04-15 12:17:29,254 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:29,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {1169#false} ~cond := #in~cond; {1169#false} is VALID [2022-04-15 12:17:29,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {1169#false} assume 0 == ~cond; {1169#false} is VALID [2022-04-15 12:17:29,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {1169#false} assume !false; {1169#false} is VALID [2022-04-15 12:17:29,254 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:29,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:29,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819025173] [2022-04-15 12:17:29,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819025173] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:29,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470750500] [2022-04-15 12:17:29,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:29,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:29,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:29,255 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:29,275 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:29,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:29,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:29,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 12:17:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:29,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:29,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {1168#true} call ULTIMATE.init(); {1168#true} is VALID [2022-04-15 12:17:29,532 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:29,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {1168#true} assume true; {1168#true} is VALID [2022-04-15 12:17:29,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1168#true} {1168#true} #40#return; {1168#true} is VALID [2022-04-15 12:17:29,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {1168#true} call #t~ret5 := main(); {1168#true} is VALID [2022-04-15 12:17:29,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {1168#true} ~x~0 := 0; {1173#(= main_~x~0 0)} is VALID [2022-04-15 12:17:29,533 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:29,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#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:29,534 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:29,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {1174#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#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:29,535 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:29,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {1175#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:29,541 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:29,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {1176#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:29,543 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:29,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {1221#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1228#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:29,544 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:29,544 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:29,545 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:29,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {1239#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1169#false} is VALID [2022-04-15 12:17:29,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {1169#false} assume !false; {1169#false} is VALID [2022-04-15 12:17:29,545 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:29,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:29,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {1169#false} assume !false; {1169#false} is VALID [2022-04-15 12:17:29,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {1239#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1169#false} is VALID [2022-04-15 12:17:29,664 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:29,664 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:29,665 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:29,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {1255#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1255#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:29,666 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:29,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {1268#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#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:29,667 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:29,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {1255#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#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:29,668 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:29,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {1268#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#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:29,669 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:29,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {1255#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#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:29,669 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:29,670 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:29,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {1168#true} call #t~ret5 := main(); {1168#true} is VALID [2022-04-15 12:17:29,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1168#true} {1168#true} #40#return; {1168#true} is VALID [2022-04-15 12:17:29,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {1168#true} assume true; {1168#true} is VALID [2022-04-15 12:17:29,670 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:29,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {1168#true} call ULTIMATE.init(); {1168#true} is VALID [2022-04-15 12:17:29,670 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:29,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470750500] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:29,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:29,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 14 [2022-04-15 12:17:29,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:29,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [724235541] [2022-04-15 12:17:29,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [724235541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:29,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:29,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:17:29,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639803960] [2022-04-15 12:17:29,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:29,671 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:29,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:29,672 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:29,688 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:29,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:17:29,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:29,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:17:29,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:17:29,689 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:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:29,873 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 12:17:29,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:17:29,873 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:29,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:29,874 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:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-15 12:17:29,874 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:29,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-15 12:17:29,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2022-04-15 12:17:29,900 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:29,901 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:17:29,901 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:17:29,901 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:29,901 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:29,902 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:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:17:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 12:17:29,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:29,933 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:29,934 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:29,934 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:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:29,935 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 12:17:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:17:29,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:29,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:29,935 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:29,935 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:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:29,936 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 12:17:29,936 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:17:29,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:29,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:29,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:29,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:29,936 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:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 12:17:29,937 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-04-15 12:17:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:29,937 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 12:17:29,937 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:29,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-15 12:17:29,988 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:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:17:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:17:29,989 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:29,989 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,008 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:30,203 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:30,203 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:30,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:30,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2126693582, now seen corresponding path program 9 times [2022-04-15 12:17:30,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:30,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1293323887] [2022-04-15 12:17:30,375 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:30,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1007648783, now seen corresponding path program 1 times [2022-04-15 12:17:30,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:30,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347805614] [2022-04-15 12:17:30,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:30,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:30,388 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:30,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:30,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2126693582, now seen corresponding path program 10 times [2022-04-15 12:17:30,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:30,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115148873] [2022-04-15 12:17:30,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:30,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:30,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:30,491 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:30,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-15 12:17:30,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1484#true} {1484#true} #40#return; {1484#true} is VALID [2022-04-15 12:17:30,492 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:30,492 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:30,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-15 12:17:30,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1484#true} #40#return; {1484#true} is VALID [2022-04-15 12:17:30,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {1484#true} call #t~ret5 := main(); {1484#true} is VALID [2022-04-15 12:17:30,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {1484#true} ~x~0 := 0; {1489#(= main_~x~0 0)} is VALID [2022-04-15 12:17:30,493 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:30,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {1489#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#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:30,494 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:30,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {1490#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#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:30,495 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:30,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {1491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:30,496 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:30,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {1492#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:30,497 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:30,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {1493#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:30,498 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:30,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {1494#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1485#false} is VALID [2022-04-15 12:17:30,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {1485#false} assume !(~x~0 % 4294967296 < 268435455); {1485#false} is VALID [2022-04-15 12:17:30,498 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:30,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {1485#false} ~cond := #in~cond; {1485#false} is VALID [2022-04-15 12:17:30,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {1485#false} assume 0 == ~cond; {1485#false} is VALID [2022-04-15 12:17:30,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {1485#false} assume !false; {1485#false} is VALID [2022-04-15 12:17:30,499 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:30,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:30,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115148873] [2022-04-15 12:17:30,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115148873] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:30,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004689741] [2022-04-15 12:17:30,499 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:30,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:30,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:30,500 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:30,501 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:30,530 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:30,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:30,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:17:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:30,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:30,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {1484#true} call ULTIMATE.init(); {1484#true} is VALID [2022-04-15 12:17:30,786 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:30,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-15 12:17:30,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1484#true} #40#return; {1484#true} is VALID [2022-04-15 12:17:30,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {1484#true} call #t~ret5 := main(); {1484#true} is VALID [2022-04-15 12:17:30,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {1484#true} ~x~0 := 0; {1489#(= main_~x~0 0)} is VALID [2022-04-15 12:17:30,787 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:30,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {1489#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#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:30,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:30,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {1490#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#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:30,790 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:30,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {1491#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:30,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:30,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {1492#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:30,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:30,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {1493#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:30,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:30,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {1544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1485#false} is VALID [2022-04-15 12:17:30,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {1485#false} assume !(~x~0 % 4294967296 < 268435455); {1485#false} is VALID [2022-04-15 12:17:30,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:30,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {1485#false} ~cond := #in~cond; {1485#false} is VALID [2022-04-15 12:17:30,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {1485#false} assume 0 == ~cond; {1485#false} is VALID [2022-04-15 12:17:30,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {1485#false} assume !false; {1485#false} is VALID [2022-04-15 12:17:30,794 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:30,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:31,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {1485#false} assume !false; {1485#false} is VALID [2022-04-15 12:17:31,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {1485#false} assume 0 == ~cond; {1485#false} is VALID [2022-04-15 12:17:31,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {1485#false} ~cond := #in~cond; {1485#false} is VALID [2022-04-15 12:17:31,041 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,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {1485#false} assume !(~x~0 % 4294967296 < 268435455); {1485#false} is VALID [2022-04-15 12:17:31,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {1581#(< (mod main_~x~0 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1485#false} is VALID [2022-04-15 12:17:31,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {1585#(or (< (mod main_~x~0 4294967296) 65520) (not (< (mod main_~x~0 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {1581#(< (mod main_~x~0 4294967296) 65520)} is VALID [2022-04-15 12:17:31,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {1589#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1585#(or (< (mod main_~x~0 4294967296) 65520) (not (< (mod main_~x~0 4294967296) 268435455)))} is VALID [2022-04-15 12:17:31,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {1589#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {1589#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} is VALID [2022-04-15 12:17:31,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {1596#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#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) 65520))} is VALID [2022-04-15 12:17:31,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {1596#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {1596#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} is VALID [2022-04-15 12:17:31,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {1603#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#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) 65520))} is VALID [2022-04-15 12:17:31,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {1603#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {1603#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} is VALID [2022-04-15 12:17:31,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {1610#(or (< (mod (+ main_~x~0 4) 4294967296) 65520) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65520;#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) 65520))} is VALID [2022-04-15 12:17:31,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {1610#(or (< (mod (+ main_~x~0 4) 4294967296) 65520) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {1610#(or (< (mod (+ main_~x~0 4) 4294967296) 65520) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-15 12:17:31,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {1617#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1610#(or (< (mod (+ main_~x~0 4) 4294967296) 65520) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-15 12:17:31,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {1617#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {1617#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65520))} is VALID [2022-04-15 12:17:31,049 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) 65520))} is VALID [2022-04-15 12:17:31,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {1484#true} call #t~ret5 := main(); {1484#true} is VALID [2022-04-15 12:17:31,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1484#true} #40#return; {1484#true} is VALID [2022-04-15 12:17:31,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-15 12:17:31,049 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,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {1484#true} call ULTIMATE.init(); {1484#true} is VALID [2022-04-15 12:17:31,050 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,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004689741] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:31,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:31,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2022-04-15 12:17:31,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:31,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1293323887] [2022-04-15 12:17:31,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1293323887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:31,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:31,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:17:31,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611385275] [2022-04-15 12:17:31,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:31,051 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:31,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:31,051 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:31,069 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:31,069 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:17:31,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:31,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:17:31,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:17:31,070 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:31,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:31,306 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 12:17:31,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:17:31,307 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:31,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:31,307 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:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-15 12:17:31,310 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:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-15 12:17:31,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-15 12:17:31,351 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:31,352 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:17:31,352 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:17:31,352 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:31,353 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:31,353 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:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:17:31,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 12:17:31,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:31,386 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:31,386 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:31,386 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:31,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:31,387 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:17:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:17:31,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:31,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:31,388 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:31,388 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:31,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:31,388 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:17:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:17:31,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:31,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:31,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:31,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:31,389 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:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-15 12:17:31,389 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2022-04-15 12:17:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:31,390 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-15 12:17:31,390 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:31,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-15 12:17:31,427 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:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:17:31,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:17:31,428 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:31,428 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:31,445 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:31,634 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:31,634 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:31,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:31,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1290036459, now seen corresponding path program 11 times [2022-04-15 12:17:31,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:31,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1023283924] [2022-04-15 12:17:31,850 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:31,852 INFO L85 PathProgramCache]: Analyzing trace with hash -948543439, now seen corresponding path program 1 times [2022-04-15 12:17:31,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:31,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858904461] [2022-04-15 12:17:31,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:31,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:31,862 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:31,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:31,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1290036459, now seen corresponding path program 12 times [2022-04-15 12:17:31,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:31,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397953981] [2022-04-15 12:17:31,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:31,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:31,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:31,970 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:31,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {1829#true} assume true; {1829#true} is VALID [2022-04-15 12:17:31,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1829#true} {1829#true} #40#return; {1829#true} is VALID [2022-04-15 12:17:31,971 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:31,971 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:31,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {1829#true} assume true; {1829#true} is VALID [2022-04-15 12:17:31,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1829#true} {1829#true} #40#return; {1829#true} is VALID [2022-04-15 12:17:31,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {1829#true} call #t~ret5 := main(); {1829#true} is VALID [2022-04-15 12:17:31,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {1829#true} ~x~0 := 0; {1834#(= main_~x~0 0)} is VALID [2022-04-15 12:17:31,972 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:31,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {1834#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#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:31,973 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:31,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {1835#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#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:31,974 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:31,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {1836#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#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:31,975 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:31,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {1837#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:31,976 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:31,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {1838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#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:31,977 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:31,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {1839#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#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:31,978 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:31,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {1840#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1830#false} is VALID [2022-04-15 12:17:31,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {1830#false} assume !(~x~0 % 4294967296 < 268435455); {1830#false} is VALID [2022-04-15 12:17:31,979 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:31,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {1830#false} ~cond := #in~cond; {1830#false} is VALID [2022-04-15 12:17:31,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {1830#false} assume 0 == ~cond; {1830#false} is VALID [2022-04-15 12:17:31,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {1830#false} assume !false; {1830#false} is VALID [2022-04-15 12:17:31,979 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:31,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:31,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397953981] [2022-04-15 12:17:31,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397953981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:31,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712115106] [2022-04-15 12:17:31,979 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:31,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:31,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:31,991 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:31,992 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:32,060 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:17:32,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:32,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:17:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:32,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:32,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {1829#true} call ULTIMATE.init(); {1829#true} is VALID [2022-04-15 12:17:32,444 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:32,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {1829#true} assume true; {1829#true} is VALID [2022-04-15 12:17:32,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1829#true} {1829#true} #40#return; {1829#true} is VALID [2022-04-15 12:17:32,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {1829#true} call #t~ret5 := main(); {1829#true} is VALID [2022-04-15 12:17:32,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {1829#true} ~x~0 := 0; {1829#true} is VALID [2022-04-15 12:17:32,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:32,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1829#true} is VALID [2022-04-15 12:17:32,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:32,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1829#true} is VALID [2022-04-15 12:17:32,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:32,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1829#true} is VALID [2022-04-15 12:17:32,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:32,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1884#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:17:32,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {1884#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {1884#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:17:32,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {1884#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1891#(< (mod (+ main_~x~0 4294967294) 4294967296) 65520)} is VALID [2022-04-15 12:17:32,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {1891#(< (mod (+ main_~x~0 4294967294) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {1891#(< (mod (+ main_~x~0 4294967294) 4294967296) 65520)} is VALID [2022-04-15 12:17:32,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {1891#(< (mod (+ main_~x~0 4294967294) 4294967296) 65520)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1898#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2022-04-15 12:17:32,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {1898#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {1898#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2022-04-15 12:17:32,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {1898#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1905#(and (< (mod (+ 4294967291 main_~x~0) 4294967296) 65520) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)))} is VALID [2022-04-15 12:17:32,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {1905#(and (< (mod (+ 4294967291 main_~x~0) 4294967296) 65520) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)))} assume !(~x~0 % 4294967296 < 268435455); {1830#false} is VALID [2022-04-15 12:17:32,459 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:32,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {1830#false} ~cond := #in~cond; {1830#false} is VALID [2022-04-15 12:17:32,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {1830#false} assume 0 == ~cond; {1830#false} is VALID [2022-04-15 12:17:32,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {1830#false} assume !false; {1830#false} is VALID [2022-04-15 12:17:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 12:17:32,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:32,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {1830#false} assume !false; {1830#false} is VALID [2022-04-15 12:17:32,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {1830#false} assume 0 == ~cond; {1830#false} is VALID [2022-04-15 12:17:32,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {1830#false} ~cond := #in~cond; {1830#false} is VALID [2022-04-15 12:17:32,988 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:32,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {1933#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {1830#false} is VALID [2022-04-15 12:17:32,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {1937#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {1933#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:32,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {1941#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455); {1937#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:32,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {1945#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 268435455))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1941#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 12:17:32,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {1945#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455); {1945#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 268435455))} is VALID [2022-04-15 12:17:32,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {1952#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1945#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 268435455))} is VALID [2022-04-15 12:17:32,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {1952#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455); {1952#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 12:17:32,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1952#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-15 12:17:32,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:32,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1829#true} is VALID [2022-04-15 12:17:32,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:32,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1829#true} is VALID [2022-04-15 12:17:32,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:32,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {1829#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1829#true} is VALID [2022-04-15 12:17:32,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 268435455); {1829#true} is VALID [2022-04-15 12:17:32,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {1829#true} ~x~0 := 0; {1829#true} is VALID [2022-04-15 12:17:32,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {1829#true} call #t~ret5 := main(); {1829#true} is VALID [2022-04-15 12:17:32,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1829#true} {1829#true} #40#return; {1829#true} is VALID [2022-04-15 12:17:32,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {1829#true} assume true; {1829#true} is VALID [2022-04-15 12:17:32,995 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:32,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {1829#true} call ULTIMATE.init(); {1829#true} is VALID [2022-04-15 12:17:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 12:17:32,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712115106] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:32,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:32,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 7] total 19 [2022-04-15 12:17:32,995 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:32,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1023283924] [2022-04-15 12:17:32,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1023283924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:32,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:32,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:17:32,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913634970] [2022-04-15 12:17:32,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:32,997 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:32,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:32,998 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:33,018 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:33,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:17:33,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:33,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:17:33,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:17:33,019 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:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:33,354 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-15 12:17:33,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:17:33,354 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:33,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:33,354 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:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-15 12:17:33,355 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:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-15 12:17:33,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 37 transitions. [2022-04-15 12:17:33,388 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:33,389 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:17:33,389 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:17:33,389 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:17:33,390 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:33,390 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:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:17:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 12:17:33,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:33,430 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:33,430 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:33,430 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:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:33,431 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 12:17:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:17:33,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:33,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:33,432 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:33,432 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:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:33,432 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 12:17:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:17:33,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:33,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:33,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:33,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:33,433 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:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-15 12:17:33,434 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2022-04-15 12:17:33,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:33,434 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-15 12:17:33,434 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:33,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-15 12:17:33,487 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:33,487 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:17:33,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:17:33,488 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:33,488 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:33,496 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:33,688 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:33,688 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:33,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:33,689 INFO L85 PathProgramCache]: Analyzing trace with hash 421425608, now seen corresponding path program 13 times [2022-04-15 12:17:33,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:33,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [434492931] [2022-04-15 12:17:33,875 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:33,877 INFO L85 PathProgramCache]: Analyzing trace with hash -889438095, now seen corresponding path program 1 times [2022-04-15 12:17:33,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:33,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064351180] [2022-04-15 12:17:33,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:33,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:33,887 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:33,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash 421425608, now seen corresponding path program 14 times [2022-04-15 12:17:33,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:33,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707732026] [2022-04-15 12:17:33,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:33,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:34,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:34,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {2215#(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); {2202#true} is VALID [2022-04-15 12:17:34,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {2202#true} assume true; {2202#true} is VALID [2022-04-15 12:17:34,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2202#true} {2202#true} #40#return; {2202#true} is VALID [2022-04-15 12:17:34,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {2202#true} call ULTIMATE.init(); {2215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:34,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {2215#(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); {2202#true} is VALID [2022-04-15 12:17:34,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {2202#true} assume true; {2202#true} is VALID [2022-04-15 12:17:34,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2202#true} {2202#true} #40#return; {2202#true} is VALID [2022-04-15 12:17:34,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {2202#true} call #t~ret5 := main(); {2202#true} is VALID [2022-04-15 12:17:34,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {2202#true} ~x~0 := 0; {2207#(= main_~x~0 0)} is VALID [2022-04-15 12:17:34,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {2207#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {2207#(= main_~x~0 0)} is VALID [2022-04-15 12:17:34,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {2207#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:34,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {2208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {2208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:34,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {2208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:34,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {2209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:34,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {2209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:34,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {2210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:34,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {2210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:34,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {2211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:34,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {2211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:34,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {2212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:34,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {2212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:34,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {2213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {2213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:34,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {2213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2214#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-15 12:17:34,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {2214#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !!(~x~0 % 4294967296 < 268435455); {2214#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-15 12:17:34,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {2214#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2203#false} is VALID [2022-04-15 12:17:34,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {2203#false} assume !(~x~0 % 4294967296 < 268435455); {2203#false} is VALID [2022-04-15 12:17:34,036 INFO L272 TraceCheckUtils]: 23: Hoare triple {2203#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)); {2203#false} is VALID [2022-04-15 12:17:34,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {2203#false} ~cond := #in~cond; {2203#false} is VALID [2022-04-15 12:17:34,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {2203#false} assume 0 == ~cond; {2203#false} is VALID [2022-04-15 12:17:34,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {2203#false} assume !false; {2203#false} is VALID [2022-04-15 12:17:34,036 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:34,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:34,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707732026] [2022-04-15 12:17:34,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707732026] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:34,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440139656] [2022-04-15 12:17:34,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:34,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:34,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:34,044 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:34,052 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:34,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:34,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:34,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 12:17:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:34,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:34,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {2202#true} call ULTIMATE.init(); {2202#true} is VALID [2022-04-15 12:17:34,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {2202#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); {2202#true} is VALID [2022-04-15 12:17:34,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {2202#true} assume true; {2202#true} is VALID [2022-04-15 12:17:34,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2202#true} {2202#true} #40#return; {2202#true} is VALID [2022-04-15 12:17:34,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {2202#true} call #t~ret5 := main(); {2202#true} is VALID [2022-04-15 12:17:34,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {2202#true} ~x~0 := 0; {2207#(= main_~x~0 0)} is VALID [2022-04-15 12:17:34,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {2207#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {2207#(= main_~x~0 0)} is VALID [2022-04-15 12:17:34,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {2207#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:34,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {2208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {2208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:34,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {2208#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:34,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {2209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:34,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {2209#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:34,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {2210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:34,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {2210#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:34,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {2211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:34,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {2211#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:34,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {2212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:34,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {2212#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:34,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {2213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {2213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:34,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {2213#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2276#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:34,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {2276#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2276#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:34,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {2276#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2283#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:34,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {2283#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2203#false} is VALID [2022-04-15 12:17:34,378 INFO L272 TraceCheckUtils]: 23: Hoare triple {2203#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)); {2203#false} is VALID [2022-04-15 12:17:34,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {2203#false} ~cond := #in~cond; {2203#false} is VALID [2022-04-15 12:17:34,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {2203#false} assume 0 == ~cond; {2203#false} is VALID [2022-04-15 12:17:34,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {2203#false} assume !false; {2203#false} is VALID [2022-04-15 12:17:34,378 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:34,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:34,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {2203#false} assume !false; {2203#false} is VALID [2022-04-15 12:17:34,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {2203#false} assume 0 == ~cond; {2203#false} is VALID [2022-04-15 12:17:34,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {2203#false} ~cond := #in~cond; {2203#false} is VALID [2022-04-15 12:17:34,656 INFO L272 TraceCheckUtils]: 23: Hoare triple {2203#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)); {2203#false} is VALID [2022-04-15 12:17:34,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {2311#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {2203#false} is VALID [2022-04-15 12:17:34,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {2315#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2311#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {2315#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2315#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {2322#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2315#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {2322#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2322#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {2329#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2322#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {2329#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2329#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {2336#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2329#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {2336#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2336#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {2343#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2336#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {2343#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2343#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {2350#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2343#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {2350#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2350#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {2357#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2350#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {2357#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2357#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {2364#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2357#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {2364#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {2364#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {2202#true} ~x~0 := 0; {2364#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:17:34,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {2202#true} call #t~ret5 := main(); {2202#true} is VALID [2022-04-15 12:17:34,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2202#true} {2202#true} #40#return; {2202#true} is VALID [2022-04-15 12:17:34,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {2202#true} assume true; {2202#true} is VALID [2022-04-15 12:17:34,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {2202#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); {2202#true} is VALID [2022-04-15 12:17:34,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {2202#true} call ULTIMATE.init(); {2202#true} is VALID [2022-04-15 12:17:34,666 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:34,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440139656] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:34,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:34,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-04-15 12:17:34,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:34,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [434492931] [2022-04-15 12:17:34,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [434492931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:34,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:34,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:17:34,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341451936] [2022-04-15 12:17:34,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:34,668 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:34,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:34,669 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:34,688 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:34,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:17:34,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:34,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:17:34,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:17:34,689 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:35,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:35,083 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-15 12:17:35,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:17:35,084 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,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:35,084 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:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-15 12:17:35,085 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:35,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-15 12:17:35,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 39 transitions. [2022-04-15 12:17:35,120 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:35,121 INFO L225 Difference]: With dead ends: 38 [2022-04-15 12:17:35,121 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 12:17:35,122 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:35,122 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:35,122 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:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 12:17:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 12:17:35,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:35,167 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:35,167 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:35,167 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:35,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:35,168 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 12:17:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 12:17:35,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:35,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:35,169 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:35,175 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:35,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:35,176 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 12:17:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 12:17:35,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:35,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:35,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:35,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:35,177 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:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-15 12:17:35,184 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2022-04-15 12:17:35,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:35,184 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-15 12:17:35,184 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:35,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-15 12:17:35,230 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:35,230 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 12:17:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:17:35,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:35,230 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:35,248 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:35,437 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:35,437 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:35,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:35,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1089946779, now seen corresponding path program 15 times [2022-04-15 12:17:35,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:35,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1268896234] [2022-04-15 12:17:35,603 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash -830332751, now seen corresponding path program 1 times [2022-04-15 12:17:35,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:35,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716770658] [2022-04-15 12:17:35,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:35,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:35,615 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:35,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:35,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1089946779, now seen corresponding path program 16 times [2022-04-15 12:17:35,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:35,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787236885] [2022-04-15 12:17:35,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:35,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:35,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:35,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {2618#(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); {2604#true} is VALID [2022-04-15 12:17:35,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {2604#true} assume true; {2604#true} is VALID [2022-04-15 12:17:35,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2604#true} {2604#true} #40#return; {2604#true} is VALID [2022-04-15 12:17:35,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {2604#true} call ULTIMATE.init(); {2618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:35,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {2618#(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); {2604#true} is VALID [2022-04-15 12:17:35,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {2604#true} assume true; {2604#true} is VALID [2022-04-15 12:17:35,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2604#true} {2604#true} #40#return; {2604#true} is VALID [2022-04-15 12:17:35,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {2604#true} call #t~ret5 := main(); {2604#true} is VALID [2022-04-15 12:17:35,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {2604#true} ~x~0 := 0; {2609#(= main_~x~0 0)} is VALID [2022-04-15 12:17:35,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {2609#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {2609#(= main_~x~0 0)} is VALID [2022-04-15 12:17:35,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {2609#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2610#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:35,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {2610#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {2610#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:35,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {2610#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:35,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {2611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:35,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {2611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:35,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {2612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:35,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {2612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:35,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {2613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:35,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {2613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:35,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {2614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:35,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {2614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2615#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:35,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {2615#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {2615#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:35,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {2615#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:35,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {2616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:35,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {2616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2617#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:35,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {2617#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {2617#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:35,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {2617#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2605#false} is VALID [2022-04-15 12:17:35,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {2605#false} assume !(~x~0 % 4294967296 < 268435455); {2605#false} is VALID [2022-04-15 12:17:35,809 INFO L272 TraceCheckUtils]: 25: Hoare triple {2605#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)); {2605#false} is VALID [2022-04-15 12:17:35,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {2605#false} ~cond := #in~cond; {2605#false} is VALID [2022-04-15 12:17:35,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {2605#false} assume 0 == ~cond; {2605#false} is VALID [2022-04-15 12:17:35,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {2605#false} assume !false; {2605#false} is VALID [2022-04-15 12:17:35,810 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:35,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:35,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787236885] [2022-04-15 12:17:35,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787236885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:35,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032168505] [2022-04-15 12:17:35,810 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:35,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:35,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:35,811 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:35,812 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:35,847 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:35,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:35,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 12:17:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:35,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:36,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {2604#true} call ULTIMATE.init(); {2604#true} is VALID [2022-04-15 12:17:36,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {2604#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); {2604#true} is VALID [2022-04-15 12:17:36,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {2604#true} assume true; {2604#true} is VALID [2022-04-15 12:17:36,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2604#true} {2604#true} #40#return; {2604#true} is VALID [2022-04-15 12:17:36,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {2604#true} call #t~ret5 := main(); {2604#true} is VALID [2022-04-15 12:17:36,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {2604#true} ~x~0 := 0; {2609#(= main_~x~0 0)} is VALID [2022-04-15 12:17:36,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {2609#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {2609#(= main_~x~0 0)} is VALID [2022-04-15 12:17:36,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {2609#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2610#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:36,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {2610#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {2610#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:36,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {2610#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:36,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {2611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:36,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {2611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:36,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {2612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:36,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {2612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:36,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {2613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:36,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {2613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:36,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {2614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {2614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:36,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {2614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2615#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:36,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {2615#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {2615#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:36,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {2615#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:36,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {2616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:36,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {2616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2685#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:36,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {2685#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2685#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:36,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {2685#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2692#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:36,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {2692#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2692#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:36,170 INFO L272 TraceCheckUtils]: 25: Hoare triple {2692#(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)); {2699#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:36,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {2699#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2703#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:36,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {2703#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2605#false} is VALID [2022-04-15 12:17:36,171 INFO L290 TraceCheckUtils]: 28: Hoare triple {2605#false} assume !false; {2605#false} is VALID [2022-04-15 12:17:36,171 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:36,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:36,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {2605#false} assume !false; {2605#false} is VALID [2022-04-15 12:17:36,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {2703#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2605#false} is VALID [2022-04-15 12:17:36,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {2699#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2703#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:36,314 INFO L272 TraceCheckUtils]: 25: Hoare triple {2719#(= (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)); {2699#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:36,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {2719#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {2719#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:36,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {2719#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {2719#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:36,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {2719#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2719#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:36,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {2732#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2719#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:36,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {2732#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2732#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:36,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {2719#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2732#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:36,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {2719#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2719#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:36,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {2732#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2719#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:36,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {2732#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2732#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:36,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {2719#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2732#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:36,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {2719#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2719#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:36,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {2732#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2719#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:36,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {2732#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2732#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:36,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {2719#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2732#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:36,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {2719#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2719#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:36,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {2732#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2719#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:36,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {2732#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2732#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:36,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {2719#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2732#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:36,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {2719#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {2719#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:36,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {2604#true} ~x~0 := 0; {2719#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:36,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {2604#true} call #t~ret5 := main(); {2604#true} is VALID [2022-04-15 12:17:36,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2604#true} {2604#true} #40#return; {2604#true} is VALID [2022-04-15 12:17:36,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {2604#true} assume true; {2604#true} is VALID [2022-04-15 12:17:36,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {2604#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); {2604#true} is VALID [2022-04-15 12:17:36,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {2604#true} call ULTIMATE.init(); {2604#true} is VALID [2022-04-15 12:17:36,323 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:36,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032168505] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:36,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:36,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 6] total 18 [2022-04-15 12:17:36,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:36,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1268896234] [2022-04-15 12:17:36,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1268896234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:36,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:36,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:17:36,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720663346] [2022-04-15 12:17:36,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:36,324 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:36,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:36,324 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:36,347 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:36,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:17:36,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:36,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:17:36,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:17:36,348 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:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:36,820 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-15 12:17:36,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:17:36,820 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:36,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:36,820 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:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2022-04-15 12:17:36,821 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:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2022-04-15 12:17:36,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2022-04-15 12:17:36,853 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:36,854 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:17:36,854 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:17:36,855 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:36,856 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:36,856 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 24 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:17:36,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:17:36,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 12:17:36,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:36,917 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:36,917 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:36,917 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:36,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:36,918 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 12:17:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:17:36,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:36,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:36,918 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:36,918 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:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:36,919 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 12:17:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:17:36,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:36,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:36,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:36,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:36,919 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:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-15 12:17:36,920 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-15 12:17:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:36,920 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-15 12:17:36,920 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:36,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-15 12:17:36,983 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:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:17:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:17:36,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:36,984 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:37,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-15 12:17:37,195 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:37,195 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:37,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1819864638, now seen corresponding path program 17 times [2022-04-15 12:17:37,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:37,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [317063706] [2022-04-15 12:17:37,346 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:37,347 INFO L85 PathProgramCache]: Analyzing trace with hash -771227407, now seen corresponding path program 1 times [2022-04-15 12:17:37,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:37,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381950453] [2022-04-15 12:17:37,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:37,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:37,358 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:37,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:37,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1819864638, now seen corresponding path program 18 times [2022-04-15 12:17:37,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:37,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355412987] [2022-04-15 12:17:37,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:37,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:37,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:37,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {3043#(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); {3028#true} is VALID [2022-04-15 12:17:37,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {3028#true} assume true; {3028#true} is VALID [2022-04-15 12:17:37,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3028#true} {3028#true} #40#return; {3028#true} is VALID [2022-04-15 12:17:37,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {3028#true} call ULTIMATE.init(); {3043#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:37,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {3043#(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); {3028#true} is VALID [2022-04-15 12:17:37,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {3028#true} assume true; {3028#true} is VALID [2022-04-15 12:17:37,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3028#true} {3028#true} #40#return; {3028#true} is VALID [2022-04-15 12:17:37,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {3028#true} call #t~ret5 := main(); {3028#true} is VALID [2022-04-15 12:17:37,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {3028#true} ~x~0 := 0; {3033#(= main_~x~0 0)} is VALID [2022-04-15 12:17:37,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {3033#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3033#(= main_~x~0 0)} is VALID [2022-04-15 12:17:37,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {3033#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3034#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:37,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {3034#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {3034#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:37,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {3034#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3035#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:37,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {3035#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3035#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:37,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {3035#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3036#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:37,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {3036#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3036#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:37,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {3036#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3037#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:37,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {3037#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3037#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:37,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {3037#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3038#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:37,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {3038#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3038#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:37,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {3038#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3039#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:37,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {3039#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3039#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:37,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {3039#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3040#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:37,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {3040#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3040#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:37,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {3040#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3041#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:37,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {3041#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3041#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:37,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {3041#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3042#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:37,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {3042#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {3042#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:37,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {3042#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3029#false} is VALID [2022-04-15 12:17:37,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {3029#false} assume !(~x~0 % 4294967296 < 268435455); {3029#false} is VALID [2022-04-15 12:17:37,525 INFO L272 TraceCheckUtils]: 27: Hoare triple {3029#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)); {3029#false} is VALID [2022-04-15 12:17:37,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {3029#false} ~cond := #in~cond; {3029#false} is VALID [2022-04-15 12:17:37,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {3029#false} assume 0 == ~cond; {3029#false} is VALID [2022-04-15 12:17:37,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {3029#false} assume !false; {3029#false} is VALID [2022-04-15 12:17:37,526 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:37,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:37,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355412987] [2022-04-15 12:17:37,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355412987] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:37,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535861831] [2022-04-15 12:17:37,526 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:37,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:37,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:37,527 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:37,528 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:37,569 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:17:37,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:37,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:17:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:37,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:37,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {3028#true} call ULTIMATE.init(); {3028#true} is VALID [2022-04-15 12:17:37,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {3028#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); {3028#true} is VALID [2022-04-15 12:17:37,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {3028#true} assume true; {3028#true} is VALID [2022-04-15 12:17:37,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3028#true} {3028#true} #40#return; {3028#true} is VALID [2022-04-15 12:17:37,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {3028#true} call #t~ret5 := main(); {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {3028#true} ~x~0 := 0; {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:37,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3028#true} is VALID [2022-04-15 12:17:37,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:37,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3116#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:17:37,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {3116#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {3116#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:17:37,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {3116#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3123#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2022-04-15 12:17:37,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {3123#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 268435455); {3029#false} is VALID [2022-04-15 12:17:37,808 INFO L272 TraceCheckUtils]: 27: Hoare triple {3029#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)); {3029#false} is VALID [2022-04-15 12:17:37,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {3029#false} ~cond := #in~cond; {3029#false} is VALID [2022-04-15 12:17:37,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {3029#false} assume 0 == ~cond; {3029#false} is VALID [2022-04-15 12:17:37,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {3029#false} assume !false; {3029#false} is VALID [2022-04-15 12:17:37,808 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:37,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:38,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {3029#false} assume !false; {3029#false} is VALID [2022-04-15 12:17:38,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {3029#false} assume 0 == ~cond; {3029#false} is VALID [2022-04-15 12:17:38,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {3029#false} ~cond := #in~cond; {3029#false} is VALID [2022-04-15 12:17:38,038 INFO L272 TraceCheckUtils]: 27: Hoare triple {3029#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)); {3029#false} is VALID [2022-04-15 12:17:38,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {3151#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {3029#false} is VALID [2022-04-15 12:17:38,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {3155#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3151#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:38,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {3155#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {3155#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:38,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3155#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:38,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:38,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3028#true} is VALID [2022-04-15 12:17:38,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:38,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3028#true} is VALID [2022-04-15 12:17:38,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:38,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3028#true} is VALID [2022-04-15 12:17:38,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:38,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3028#true} is VALID [2022-04-15 12:17:38,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:38,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3028#true} is VALID [2022-04-15 12:17:38,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:38,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3028#true} is VALID [2022-04-15 12:17:38,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:38,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3028#true} is VALID [2022-04-15 12:17:38,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:38,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {3028#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3028#true} is VALID [2022-04-15 12:17:38,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {3028#true} assume !!(~x~0 % 4294967296 < 268435455); {3028#true} is VALID [2022-04-15 12:17:38,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {3028#true} ~x~0 := 0; {3028#true} is VALID [2022-04-15 12:17:38,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {3028#true} call #t~ret5 := main(); {3028#true} is VALID [2022-04-15 12:17:38,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3028#true} {3028#true} #40#return; {3028#true} is VALID [2022-04-15 12:17:38,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {3028#true} assume true; {3028#true} is VALID [2022-04-15 12:17:38,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {3028#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); {3028#true} is VALID [2022-04-15 12:17:38,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {3028#true} call ULTIMATE.init(); {3028#true} is VALID [2022-04-15 12:17:38,043 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:38,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535861831] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:38,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:38,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 17 [2022-04-15 12:17:38,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:38,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [317063706] [2022-04-15 12:17:38,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [317063706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:38,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:38,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:17:38,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958592295] [2022-04-15 12:17:38,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:38,044 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:38,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:38,044 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:38,068 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:38,068 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:17:38,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:38,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:17:38,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:17:38,069 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:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:38,599 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 12:17:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:17:38,599 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:38,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:38,600 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:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 43 transitions. [2022-04-15 12:17:38,601 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:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 43 transitions. [2022-04-15 12:17:38,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 43 transitions. [2022-04-15 12:17:38,642 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:38,642 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:17:38,642 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:17:38,643 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:38,643 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:38,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 39 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:17:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 12:17:38,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:38,711 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:38,711 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:38,712 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:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:38,712 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 12:17:38,712 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:17:38,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:38,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:38,713 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:38,713 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:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:38,713 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 12:17:38,713 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:17:38,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:38,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:38,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:38,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:38,714 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:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-15 12:17:38,714 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 31 [2022-04-15 12:17:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:38,715 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-15 12:17:38,715 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:38,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2022-04-15 12:17:38,764 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:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:17:38,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:17:38,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:38,765 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:38,784 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:38,979 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:38,979 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1103709407, now seen corresponding path program 19 times [2022-04-15 12:17:38,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:38,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [197610325] [2022-04-15 12:17:39,125 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:39,136 INFO L85 PathProgramCache]: Analyzing trace with hash -712122063, now seen corresponding path program 1 times [2022-04-15 12:17:39,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:39,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004523829] [2022-04-15 12:17:39,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:39,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:39,147 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:39,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:39,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1103709407, now seen corresponding path program 20 times [2022-04-15 12:17:39,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:39,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631611330] [2022-04-15 12:17:39,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:39,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:39,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:39,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {3493#(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); {3477#true} is VALID [2022-04-15 12:17:39,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {3477#true} assume true; {3477#true} is VALID [2022-04-15 12:17:39,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3477#true} {3477#true} #40#return; {3477#true} is VALID [2022-04-15 12:17:39,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {3477#true} call ULTIMATE.init(); {3493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:39,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {3493#(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); {3477#true} is VALID [2022-04-15 12:17:39,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {3477#true} assume true; {3477#true} is VALID [2022-04-15 12:17:39,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3477#true} {3477#true} #40#return; {3477#true} is VALID [2022-04-15 12:17:39,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {3477#true} call #t~ret5 := main(); {3477#true} is VALID [2022-04-15 12:17:39,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {3477#true} ~x~0 := 0; {3482#(= main_~x~0 0)} is VALID [2022-04-15 12:17:39,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {3482#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3482#(= main_~x~0 0)} is VALID [2022-04-15 12:17:39,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {3482#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3483#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:39,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {3483#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {3483#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:39,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {3483#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:39,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {3484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:39,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {3484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:39,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {3485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:39,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {3485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3486#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:39,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {3486#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3486#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:39,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {3486#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3487#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:39,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {3487#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3487#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:39,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {3487#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3488#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:39,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {3488#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3488#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:39,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {3488#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3489#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:39,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {3489#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3489#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:39,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {3489#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3490#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:39,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {3490#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3490#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:39,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {3490#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3491#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:39,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {3491#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3491#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:39,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {3491#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3492#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:39,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {3492#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {3492#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:39,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {3492#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3478#false} is VALID [2022-04-15 12:17:39,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {3478#false} assume !(~x~0 % 4294967296 < 268435455); {3478#false} is VALID [2022-04-15 12:17:39,341 INFO L272 TraceCheckUtils]: 29: Hoare triple {3478#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)); {3478#false} is VALID [2022-04-15 12:17:39,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {3478#false} ~cond := #in~cond; {3478#false} is VALID [2022-04-15 12:17:39,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {3478#false} assume 0 == ~cond; {3478#false} is VALID [2022-04-15 12:17:39,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {3478#false} assume !false; {3478#false} is VALID [2022-04-15 12:17:39,342 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:39,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:39,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631611330] [2022-04-15 12:17:39,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631611330] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:39,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082423132] [2022-04-15 12:17:39,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:39,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:39,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:39,345 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:39,350 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:39,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:39,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:39,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:17:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:39,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:39,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {3477#true} call ULTIMATE.init(); {3477#true} is VALID [2022-04-15 12:17:39,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {3477#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); {3477#true} is VALID [2022-04-15 12:17:39,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {3477#true} assume true; {3477#true} is VALID [2022-04-15 12:17:39,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3477#true} {3477#true} #40#return; {3477#true} is VALID [2022-04-15 12:17:39,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {3477#true} call #t~ret5 := main(); {3477#true} is VALID [2022-04-15 12:17:39,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {3477#true} ~x~0 := 0; {3482#(= main_~x~0 0)} is VALID [2022-04-15 12:17:39,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {3482#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3482#(= main_~x~0 0)} is VALID [2022-04-15 12:17:39,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {3482#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3483#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:39,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {3483#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {3483#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:39,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {3483#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:39,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {3484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:39,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {3484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:39,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {3485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:39,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {3485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3486#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:39,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {3486#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3486#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:39,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {3486#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3487#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:39,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {3487#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3487#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:39,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {3487#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3488#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:39,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {3488#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3488#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:39,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {3488#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3489#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:39,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {3489#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3489#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:39,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {3489#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3490#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:39,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {3490#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3490#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:39,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {3490#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3491#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:39,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {3491#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3491#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:39,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {3491#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3572#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:39,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {3572#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3572#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:39,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {3572#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3579#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:39,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {3579#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3579#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:39,764 INFO L272 TraceCheckUtils]: 29: Hoare triple {3579#(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)); {3586#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:39,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {3586#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3590#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:39,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {3590#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3478#false} is VALID [2022-04-15 12:17:39,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {3478#false} assume !false; {3478#false} is VALID [2022-04-15 12:17:39,767 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:39,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:39,939 INFO L290 TraceCheckUtils]: 32: Hoare triple {3478#false} assume !false; {3478#false} is VALID [2022-04-15 12:17:39,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {3590#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3478#false} is VALID [2022-04-15 12:17:39,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {3586#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3590#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:39,941 INFO L272 TraceCheckUtils]: 29: Hoare triple {3606#(= (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)); {3586#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:39,942 INFO L290 TraceCheckUtils]: 28: Hoare triple {3606#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {3606#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:39,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {3606#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3606#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:39,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {3606#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3606#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:39,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {3619#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3606#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:39,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {3619#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3619#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:39,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {3606#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3619#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:39,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {3606#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3606#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:39,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {3619#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3606#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:39,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {3619#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3619#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:39,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {3606#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3619#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:39,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {3606#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3606#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:39,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {3619#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3606#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:39,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {3619#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3619#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:39,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {3606#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3619#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:39,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {3606#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3606#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:39,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3606#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:39,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {3619#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3619#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:39,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {3606#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3619#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:39,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {3606#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3606#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:39,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {3619#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3606#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:39,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {3619#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3619#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:39,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {3606#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3619#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:39,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {3606#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {3606#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:39,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {3477#true} ~x~0 := 0; {3606#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:39,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {3477#true} call #t~ret5 := main(); {3477#true} is VALID [2022-04-15 12:17:39,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3477#true} {3477#true} #40#return; {3477#true} is VALID [2022-04-15 12:17:39,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {3477#true} assume true; {3477#true} is VALID [2022-04-15 12:17:39,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {3477#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); {3477#true} is VALID [2022-04-15 12:17:39,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {3477#true} call ULTIMATE.init(); {3477#true} is VALID [2022-04-15 12:17:39,955 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:39,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082423132] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:39,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:39,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 6] total 20 [2022-04-15 12:17:39,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:39,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [197610325] [2022-04-15 12:17:39,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [197610325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:39,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:39,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:17:39,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722371009] [2022-04-15 12:17:39,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:39,956 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:39,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:39,956 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:39,984 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:39,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:17:39,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:39,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:17:39,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:17:39,985 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:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:40,626 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-15 12:17:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:17:40,626 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:40,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:40,626 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:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2022-04-15 12:17:40,627 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:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2022-04-15 12:17:40,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 45 transitions. [2022-04-15 12:17:40,675 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:40,675 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:17:40,676 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 12:17:40,676 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:40,676 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:40,677 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 34 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:17:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 12:17:40,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 12:17:40,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:40,733 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:40,733 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:40,733 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:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:40,738 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 12:17:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 12:17:40,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:40,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:40,738 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:40,738 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:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:40,739 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 12:17:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 12:17:40,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:40,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:40,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:40,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:40,739 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:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-15 12:17:40,740 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 33 [2022-04-15 12:17:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:40,740 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-15 12:17:40,745 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:40,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-15 12:17:40,802 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:40,802 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 12:17:40,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:17:40,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:40,803 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:40,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 12:17:41,003 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:41,003 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:41,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:41,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1749755068, now seen corresponding path program 21 times [2022-04-15 12:17:41,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:41,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1344636046] [2022-04-15 12:17:41,168 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:41,170 INFO L85 PathProgramCache]: Analyzing trace with hash -653016719, now seen corresponding path program 1 times [2022-04-15 12:17:41,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:41,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790736386] [2022-04-15 12:17:41,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:41,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:41,182 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:41,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:41,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1749755068, now seen corresponding path program 22 times [2022-04-15 12:17:41,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:41,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45477465] [2022-04-15 12:17:41,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:41,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:41,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:41,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {3972#(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); {3955#true} is VALID [2022-04-15 12:17:41,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {3955#true} assume true; {3955#true} is VALID [2022-04-15 12:17:41,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3955#true} {3955#true} #40#return; {3955#true} is VALID [2022-04-15 12:17:41,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {3955#true} call ULTIMATE.init(); {3972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:41,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {3972#(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); {3955#true} is VALID [2022-04-15 12:17:41,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {3955#true} assume true; {3955#true} is VALID [2022-04-15 12:17:41,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3955#true} {3955#true} #40#return; {3955#true} is VALID [2022-04-15 12:17:41,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {3955#true} call #t~ret5 := main(); {3955#true} is VALID [2022-04-15 12:17:41,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {3955#true} ~x~0 := 0; {3960#(= main_~x~0 0)} is VALID [2022-04-15 12:17:41,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {3960#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3960#(= main_~x~0 0)} is VALID [2022-04-15 12:17:41,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {3960#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3961#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:41,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {3961#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {3961#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:41,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {3961#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3962#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:41,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {3962#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3962#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:41,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {3962#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3963#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:41,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {3963#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3963#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:41,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {3963#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3964#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:41,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {3964#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3964#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:41,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {3964#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3965#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:41,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {3965#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3965#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:41,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {3965#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3966#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:41,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {3966#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3966#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:41,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {3966#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3967#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:41,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {3967#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3967#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:41,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {3967#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3968#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:41,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {3968#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3968#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:41,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {3968#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3969#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:41,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {3969#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3969#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:41,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {3969#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3970#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:41,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {3970#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3970#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:41,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {3970#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3971#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:41,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {3971#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {3971#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:41,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {3971#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {3956#false} is VALID [2022-04-15 12:17:41,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {3956#false} assume !(~x~0 % 4294967296 < 268435455); {3956#false} is VALID [2022-04-15 12:17:41,420 INFO L272 TraceCheckUtils]: 31: Hoare triple {3956#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)); {3956#false} is VALID [2022-04-15 12:17:41,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {3956#false} ~cond := #in~cond; {3956#false} is VALID [2022-04-15 12:17:41,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {3956#false} assume 0 == ~cond; {3956#false} is VALID [2022-04-15 12:17:41,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {3956#false} assume !false; {3956#false} is VALID [2022-04-15 12:17:41,421 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:41,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:41,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45477465] [2022-04-15 12:17:41,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45477465] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:41,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111107112] [2022-04-15 12:17:41,421 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:41,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:41,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:41,422 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:41,422 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:41,461 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:41,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:41,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:17:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:41,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:41,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {3955#true} call ULTIMATE.init(); {3955#true} is VALID [2022-04-15 12:17:41,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {3955#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); {3955#true} is VALID [2022-04-15 12:17:41,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {3955#true} assume true; {3955#true} is VALID [2022-04-15 12:17:41,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3955#true} {3955#true} #40#return; {3955#true} is VALID [2022-04-15 12:17:41,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {3955#true} call #t~ret5 := main(); {3955#true} is VALID [2022-04-15 12:17:41,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {3955#true} ~x~0 := 0; {3960#(= main_~x~0 0)} is VALID [2022-04-15 12:17:41,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {3960#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {3960#(= main_~x~0 0)} is VALID [2022-04-15 12:17:41,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {3960#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3961#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:41,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {3961#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {3961#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:41,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {3961#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3962#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:41,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {3962#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3962#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:41,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {3962#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3963#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:41,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {3963#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3963#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:41,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {3963#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3964#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:41,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {3964#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3964#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:41,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {3964#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3965#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:41,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {3965#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {3965#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:41,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {3965#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3966#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:41,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {3966#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {3966#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:41,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {3966#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3967#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:41,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {3967#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3967#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:41,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {3967#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3968#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:41,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {3968#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3968#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:41,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {3968#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3969#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:41,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {3969#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3969#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:41,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {3969#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3970#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:41,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {3970#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3970#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:41,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {3970#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4057#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:41,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {4057#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4057#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:41,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {4057#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4064#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:41,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {4064#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3956#false} is VALID [2022-04-15 12:17:41,788 INFO L272 TraceCheckUtils]: 31: Hoare triple {3956#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)); {3956#false} is VALID [2022-04-15 12:17:41,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {3956#false} ~cond := #in~cond; {3956#false} is VALID [2022-04-15 12:17:41,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {3956#false} assume 0 == ~cond; {3956#false} is VALID [2022-04-15 12:17:41,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {3956#false} assume !false; {3956#false} is VALID [2022-04-15 12:17:41,789 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:41,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:42,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {3956#false} assume !false; {3956#false} is VALID [2022-04-15 12:17:42,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {3956#false} assume 0 == ~cond; {3956#false} is VALID [2022-04-15 12:17:42,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {3956#false} ~cond := #in~cond; {3956#false} is VALID [2022-04-15 12:17:42,215 INFO L272 TraceCheckUtils]: 31: Hoare triple {3956#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)); {3956#false} is VALID [2022-04-15 12:17:42,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {4092#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {3956#false} is VALID [2022-04-15 12:17:42,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {4096#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4092#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {4096#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4096#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {4103#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4096#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {4103#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4103#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {4110#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4103#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {4110#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4110#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {4117#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4110#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {4117#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4117#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {4124#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4117#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {4124#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4124#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {4131#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4124#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {4131#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4131#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {4138#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4131#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {4138#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4138#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {4145#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4138#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {4145#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4145#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {4152#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4145#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {4152#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4152#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {4159#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4152#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {4159#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4159#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {4166#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4159#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {4166#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4166#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {4173#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4166#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {4173#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {4173#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {3955#true} ~x~0 := 0; {4173#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:17:42,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {3955#true} call #t~ret5 := main(); {3955#true} is VALID [2022-04-15 12:17:42,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3955#true} {3955#true} #40#return; {3955#true} is VALID [2022-04-15 12:17:42,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {3955#true} assume true; {3955#true} is VALID [2022-04-15 12:17:42,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {3955#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); {3955#true} is VALID [2022-04-15 12:17:42,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {3955#true} call ULTIMATE.init(); {3955#true} is VALID [2022-04-15 12:17:42,238 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:42,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111107112] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:42,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:42,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2022-04-15 12:17:42,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:42,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1344636046] [2022-04-15 12:17:42,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1344636046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:42,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:42,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:17:42,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131269472] [2022-04-15 12:17:42,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:42,239 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:42,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:42,239 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:42,267 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:42,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:17:42,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:42,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:17:42,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=619, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:17:42,269 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:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:43,026 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-15 12:17:43,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:17:43,027 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,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:43,027 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:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-15 12:17:43,028 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:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-15 12:17:43,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 47 transitions. [2022-04-15 12:17:43,069 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:43,070 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:17:43,070 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:17:43,071 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=477, Invalid=1245, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:17:43,071 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:43,071 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 64 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:43,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:17:43,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 12:17:43,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:43,142 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:43,142 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:43,142 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:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:43,143 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 12:17:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:17:43,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:43,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:43,143 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:43,144 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:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:43,144 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 12:17:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:17:43,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:43,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:43,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:43,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:43,144 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:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-15 12:17:43,145 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 35 [2022-04-15 12:17:43,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:43,145 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-15 12:17:43,145 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:43,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-15 12:17:43,212 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:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:17:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 12:17:43,213 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:43,213 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:43,230 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:43,413 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:43,414 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:43,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:43,414 INFO L85 PathProgramCache]: Analyzing trace with hash -170622631, now seen corresponding path program 23 times [2022-04-15 12:17:43,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:43,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1172660342] [2022-04-15 12:17:43,586 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:43,588 INFO L85 PathProgramCache]: Analyzing trace with hash -593911375, now seen corresponding path program 1 times [2022-04-15 12:17:43,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:43,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806612787] [2022-04-15 12:17:43,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:43,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:43,595 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:43,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:43,600 INFO L85 PathProgramCache]: Analyzing trace with hash -170622631, now seen corresponding path program 24 times [2022-04-15 12:17:43,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:43,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734106415] [2022-04-15 12:17:43,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:43,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:43,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:43,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {4487#(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); {4469#true} is VALID [2022-04-15 12:17:43,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {4469#true} assume true; {4469#true} is VALID [2022-04-15 12:17:43,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4469#true} {4469#true} #40#return; {4469#true} is VALID [2022-04-15 12:17:43,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {4469#true} call ULTIMATE.init(); {4487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:43,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {4487#(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); {4469#true} is VALID [2022-04-15 12:17:43,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {4469#true} assume true; {4469#true} is VALID [2022-04-15 12:17:43,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4469#true} {4469#true} #40#return; {4469#true} is VALID [2022-04-15 12:17:43,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {4469#true} call #t~ret5 := main(); {4469#true} is VALID [2022-04-15 12:17:43,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {4469#true} ~x~0 := 0; {4474#(= main_~x~0 0)} is VALID [2022-04-15 12:17:43,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {4474#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {4474#(= main_~x~0 0)} is VALID [2022-04-15 12:17:43,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {4474#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4475#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:43,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {4475#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {4475#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:43,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {4475#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4476#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:43,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {4476#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4476#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:43,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {4476#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4477#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:43,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {4477#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4477#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:43,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {4477#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4478#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:43,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {4478#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4478#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:43,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {4478#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4479#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:43,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {4479#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {4479#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:43,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {4479#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4480#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:43,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {4480#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {4480#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:43,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {4480#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4481#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:43,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {4481#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4481#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:43,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {4481#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4482#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:43,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {4482#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4482#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:43,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {4482#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4483#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:43,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {4483#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4483#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:43,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {4483#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4484#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:43,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {4484#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4484#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:43,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {4484#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4485#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:43,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {4485#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4485#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:43,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {4485#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4486#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:43,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {4486#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {4486#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:43,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {4486#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4470#false} is VALID [2022-04-15 12:17:43,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {4470#false} assume !(~x~0 % 4294967296 < 268435455); {4470#false} is VALID [2022-04-15 12:17:43,875 INFO L272 TraceCheckUtils]: 33: Hoare triple {4470#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)); {4470#false} is VALID [2022-04-15 12:17:43,875 INFO L290 TraceCheckUtils]: 34: Hoare triple {4470#false} ~cond := #in~cond; {4470#false} is VALID [2022-04-15 12:17:43,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {4470#false} assume 0 == ~cond; {4470#false} is VALID [2022-04-15 12:17:43,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {4470#false} assume !false; {4470#false} is VALID [2022-04-15 12:17:43,876 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:43,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:43,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734106415] [2022-04-15 12:17:43,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734106415] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:43,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651406126] [2022-04-15 12:17:43,876 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:43,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:43,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:43,877 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:43,878 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:43,937 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:17:43,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:43,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:17:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:43,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:44,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {4469#true} call ULTIMATE.init(); {4469#true} is VALID [2022-04-15 12:17:44,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {4469#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); {4469#true} is VALID [2022-04-15 12:17:44,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {4469#true} assume true; {4469#true} is VALID [2022-04-15 12:17:44,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4469#true} {4469#true} #40#return; {4469#true} is VALID [2022-04-15 12:17:44,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {4469#true} call #t~ret5 := main(); {4469#true} is VALID [2022-04-15 12:17:44,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {4469#true} ~x~0 := 0; {4469#true} is VALID [2022-04-15 12:17:44,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4578#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:17:44,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {4578#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {4578#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:17:44,310 INFO L290 TraceCheckUtils]: 31: Hoare triple {4578#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4585#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65520))} is VALID [2022-04-15 12:17:44,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {4585#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65520))} assume !(~x~0 % 4294967296 < 268435455); {4470#false} is VALID [2022-04-15 12:17:44,314 INFO L272 TraceCheckUtils]: 33: Hoare triple {4470#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)); {4470#false} is VALID [2022-04-15 12:17:44,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {4470#false} ~cond := #in~cond; {4470#false} is VALID [2022-04-15 12:17:44,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {4470#false} assume 0 == ~cond; {4470#false} is VALID [2022-04-15 12:17:44,314 INFO L290 TraceCheckUtils]: 36: Hoare triple {4470#false} assume !false; {4470#false} is VALID [2022-04-15 12:17:44,314 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:44,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:44,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {4470#false} assume !false; {4470#false} is VALID [2022-04-15 12:17:44,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {4470#false} assume 0 == ~cond; {4470#false} is VALID [2022-04-15 12:17:44,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {4470#false} ~cond := #in~cond; {4470#false} is VALID [2022-04-15 12:17:44,762 INFO L272 TraceCheckUtils]: 33: Hoare triple {4470#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)); {4470#false} is VALID [2022-04-15 12:17:44,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {4613#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {4470#false} is VALID [2022-04-15 12:17:44,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {4617#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {4613#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:44,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {4621#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455); {4617#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:44,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4621#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 12:17:44,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {4469#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4469#true} is VALID [2022-04-15 12:17:44,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {4469#true} assume !!(~x~0 % 4294967296 < 268435455); {4469#true} is VALID [2022-04-15 12:17:44,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {4469#true} ~x~0 := 0; {4469#true} is VALID [2022-04-15 12:17:44,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {4469#true} call #t~ret5 := main(); {4469#true} is VALID [2022-04-15 12:17:44,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4469#true} {4469#true} #40#return; {4469#true} is VALID [2022-04-15 12:17:44,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {4469#true} assume true; {4469#true} is VALID [2022-04-15 12:17:44,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {4469#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); {4469#true} is VALID [2022-04-15 12:17:44,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {4469#true} call ULTIMATE.init(); {4469#true} is VALID [2022-04-15 12:17:44,771 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:44,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651406126] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:44,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:44,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4, 5] total 21 [2022-04-15 12:17:44,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:44,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1172660342] [2022-04-15 12:17:44,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1172660342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:44,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:44,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:17:44,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805095547] [2022-04-15 12:17:44,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:44,773 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:44,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:44,773 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:44,811 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:44,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:17:44,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:44,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:17:44,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:17:44,813 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:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:45,660 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-15 12:17:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:17:45,661 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,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:45,661 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:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-15 12:17:45,663 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:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-15 12:17:45,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 49 transitions. [2022-04-15 12:17:45,709 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:45,710 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:17:45,710 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 12:17:45,711 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:17:45,711 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:45,711 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 44 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 12:17:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 12:17:45,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:45,791 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:45,791 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:45,791 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:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:45,792 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 12:17:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 12:17:45,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:45,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:45,792 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:45,792 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:45,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:45,793 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 12:17:45,793 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 12:17:45,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:45,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:45,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:45,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:45,793 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:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-04-15 12:17:45,794 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 37 [2022-04-15 12:17:45,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:45,794 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-04-15 12:17:45,794 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:45,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 43 transitions. [2022-04-15 12:17:45,884 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:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 12:17:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 12:17:45,885 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:45,885 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:45,892 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:46,090 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:46,090 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:46,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1182345910, now seen corresponding path program 25 times [2022-04-15 12:17:46,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:46,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1455406672] [2022-04-15 12:17:46,285 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:46,286 INFO L85 PathProgramCache]: Analyzing trace with hash -534806031, now seen corresponding path program 1 times [2022-04-15 12:17:46,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:46,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780955682] [2022-04-15 12:17:46,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:46,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:46,295 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:46,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1182345910, now seen corresponding path program 26 times [2022-04-15 12:17:46,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:46,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77624468] [2022-04-15 12:17:46,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:46,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:46,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:46,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {5019#(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); {5000#true} is VALID [2022-04-15 12:17:46,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {5000#true} assume true; {5000#true} is VALID [2022-04-15 12:17:46,559 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5000#true} {5000#true} #40#return; {5000#true} is VALID [2022-04-15 12:17:46,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {5000#true} call ULTIMATE.init(); {5019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:46,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {5019#(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); {5000#true} is VALID [2022-04-15 12:17:46,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {5000#true} assume true; {5000#true} is VALID [2022-04-15 12:17:46,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5000#true} {5000#true} #40#return; {5000#true} is VALID [2022-04-15 12:17:46,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {5000#true} call #t~ret5 := main(); {5000#true} is VALID [2022-04-15 12:17:46,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {5000#true} ~x~0 := 0; {5005#(= main_~x~0 0)} is VALID [2022-04-15 12:17:46,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {5005#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {5005#(= main_~x~0 0)} is VALID [2022-04-15 12:17:46,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {5005#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5006#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:46,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {5006#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {5006#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:46,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {5006#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:46,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {5007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {5007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:46,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {5007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5008#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:46,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {5008#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5008#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:46,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {5008#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5009#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:46,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {5009#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5009#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:46,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {5009#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5010#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:46,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {5010#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {5010#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:46,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {5010#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:46,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {5011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {5011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:46,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {5011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5012#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:46,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {5012#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5012#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:46,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {5012#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5013#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:46,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {5013#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5013#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:46,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {5013#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5014#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:46,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {5014#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5014#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:46,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {5014#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5015#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:46,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {5015#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5015#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:46,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {5015#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5016#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:46,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {5016#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5016#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:46,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {5016#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5017#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:46,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {5017#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5017#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:46,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {5017#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5018#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:46,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {5018#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {5018#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:46,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {5018#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {5001#false} is VALID [2022-04-15 12:17:46,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {5001#false} assume !(~x~0 % 4294967296 < 268435455); {5001#false} is VALID [2022-04-15 12:17:46,578 INFO L272 TraceCheckUtils]: 35: Hoare triple {5001#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)); {5001#false} is VALID [2022-04-15 12:17:46,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {5001#false} ~cond := #in~cond; {5001#false} is VALID [2022-04-15 12:17:46,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {5001#false} assume 0 == ~cond; {5001#false} is VALID [2022-04-15 12:17:46,579 INFO L290 TraceCheckUtils]: 38: Hoare triple {5001#false} assume !false; {5001#false} is VALID [2022-04-15 12:17:46,579 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:46,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:46,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77624468] [2022-04-15 12:17:46,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77624468] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:46,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122256960] [2022-04-15 12:17:46,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:46,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:46,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:46,580 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:46,588 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:46,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:46,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:46,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 12:17:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:46,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:46,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {5000#true} call ULTIMATE.init(); {5000#true} is VALID [2022-04-15 12:17:46,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {5000#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); {5000#true} is VALID [2022-04-15 12:17:46,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {5000#true} assume true; {5000#true} is VALID [2022-04-15 12:17:46,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5000#true} {5000#true} #40#return; {5000#true} is VALID [2022-04-15 12:17:46,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {5000#true} call #t~ret5 := main(); {5000#true} is VALID [2022-04-15 12:17:46,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {5000#true} ~x~0 := 0; {5005#(= main_~x~0 0)} is VALID [2022-04-15 12:17:46,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {5005#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {5005#(= main_~x~0 0)} is VALID [2022-04-15 12:17:46,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {5005#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5006#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:46,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {5006#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {5006#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:46,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {5006#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:46,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {5007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {5007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:46,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {5007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5008#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:46,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {5008#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5008#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:46,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {5008#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5009#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:46,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {5009#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5009#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:46,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {5009#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5010#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:46,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {5010#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {5010#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:46,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {5010#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:46,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {5011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {5011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:46,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {5011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5012#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:46,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {5012#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5012#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:47,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {5012#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5013#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:47,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {5013#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5013#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:47,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {5013#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5014#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:47,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {5014#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5014#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:47,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {5014#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5015#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:47,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {5015#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5015#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:47,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {5015#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5016#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:47,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {5016#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5016#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:47,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {5016#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5017#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:47,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {5017#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5017#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:47,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {5017#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5116#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:47,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {5116#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5116#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:47,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {5116#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {5123#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:47,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {5123#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 < 268435455); {5001#false} is VALID [2022-04-15 12:17:47,007 INFO L272 TraceCheckUtils]: 35: Hoare triple {5001#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)); {5001#false} is VALID [2022-04-15 12:17:47,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {5001#false} ~cond := #in~cond; {5001#false} is VALID [2022-04-15 12:17:47,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {5001#false} assume 0 == ~cond; {5001#false} is VALID [2022-04-15 12:17:47,007 INFO L290 TraceCheckUtils]: 38: Hoare triple {5001#false} assume !false; {5001#false} is VALID [2022-04-15 12:17:47,007 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:47,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:47,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {5001#false} assume !false; {5001#false} is VALID [2022-04-15 12:17:47,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {5001#false} assume 0 == ~cond; {5001#false} is VALID [2022-04-15 12:17:47,575 INFO L290 TraceCheckUtils]: 36: Hoare triple {5001#false} ~cond := #in~cond; {5001#false} is VALID [2022-04-15 12:17:47,575 INFO L272 TraceCheckUtils]: 35: Hoare triple {5001#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)); {5001#false} is VALID [2022-04-15 12:17:47,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {5151#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {5001#false} is VALID [2022-04-15 12:17:47,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {5155#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {5151#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {5155#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5155#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {5162#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5155#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {5162#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5162#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {5169#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5162#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {5169#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5169#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {5176#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5169#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {5176#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5176#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {5183#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5176#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {5183#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5183#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {5190#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5183#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {5190#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5190#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {5197#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5190#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {5197#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5197#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {5204#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5197#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {5204#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5204#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {5211#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5204#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {5211#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5211#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {5218#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5211#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {5218#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5218#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {5225#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5218#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {5225#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5225#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {5232#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5225#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {5232#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5232#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {5239#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5232#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {5239#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5239#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {5246#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5239#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {5246#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {5246#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {5000#true} ~x~0 := 0; {5246#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:17:47,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {5000#true} call #t~ret5 := main(); {5000#true} is VALID [2022-04-15 12:17:47,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5000#true} {5000#true} #40#return; {5000#true} is VALID [2022-04-15 12:17:47,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {5000#true} assume true; {5000#true} is VALID [2022-04-15 12:17:47,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {5000#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); {5000#true} is VALID [2022-04-15 12:17:47,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {5000#true} call ULTIMATE.init(); {5000#true} is VALID [2022-04-15 12:17:47,597 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:47,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122256960] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:47,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:47,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-04-15 12:17:47,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:47,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1455406672] [2022-04-15 12:17:47,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1455406672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:47,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:47,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:17:47,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542557448] [2022-04-15 12:17:47,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:47,599 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:47,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:47,599 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:47,634 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:47,635 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:17:47,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:47,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:17:47,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=803, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:17:47,636 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:48,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:48,604 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-15 12:17:48,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:17:48,604 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,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:48,604 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:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2022-04-15 12:17:48,605 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:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2022-04-15 12:17:48,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 51 transitions. [2022-04-15 12:17:48,674 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:48,675 INFO L225 Difference]: With dead ends: 50 [2022-04-15 12:17:48,675 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 12:17:48,676 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=611, Invalid=1645, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:17:48,676 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:48,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 19 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:17:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 12:17:48,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 12:17:48,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:48,762 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:48,762 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:48,762 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:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:48,763 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-04-15 12:17:48,763 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-15 12:17:48,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:48,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:48,763 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:48,763 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:48,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:48,764 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-04-15 12:17:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-15 12:17:48,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:48,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:48,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:48,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:48,764 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:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-04-15 12:17:48,765 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 39 [2022-04-15 12:17:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:48,765 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-04-15 12:17:48,765 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:48,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 45 transitions. [2022-04-15 12:17:48,855 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:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-15 12:17:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 12:17:48,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:48,855 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:48,874 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:49,056 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:49,056 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:49,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash 10023123, now seen corresponding path program 27 times [2022-04-15 12:17:49,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:49,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1363215170] [2022-04-15 12:17:49,228 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash -475700687, now seen corresponding path program 1 times [2022-04-15 12:17:49,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:49,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877012176] [2022-04-15 12:17:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:49,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:49,236 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:49,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:49,243 INFO L85 PathProgramCache]: Analyzing trace with hash 10023123, now seen corresponding path program 28 times [2022-04-15 12:17:49,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:49,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109304183] [2022-04-15 12:17:49,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:49,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:49,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {5590#(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); {5570#true} is VALID [2022-04-15 12:17:49,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {5570#true} assume true; {5570#true} is VALID [2022-04-15 12:17:49,484 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5570#true} {5570#true} #40#return; {5570#true} is VALID [2022-04-15 12:17:49,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {5570#true} call ULTIMATE.init(); {5590#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:49,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {5590#(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); {5570#true} is VALID [2022-04-15 12:17:49,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {5570#true} assume true; {5570#true} is VALID [2022-04-15 12:17:49,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5570#true} {5570#true} #40#return; {5570#true} is VALID [2022-04-15 12:17:49,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {5570#true} call #t~ret5 := main(); {5570#true} is VALID [2022-04-15 12:17:49,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {5570#true} ~x~0 := 0; {5575#(= main_~x~0 0)} is VALID [2022-04-15 12:17:49,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {5575#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {5575#(= main_~x~0 0)} is VALID [2022-04-15 12:17:49,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {5575#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5576#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:49,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {5576#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {5576#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:49,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {5576#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5577#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:49,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {5577#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {5577#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:49,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {5577#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5578#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:49,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {5578#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5578#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:49,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {5578#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5579#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:49,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {5579#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5579#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:49,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {5579#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5580#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:49,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {5580#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {5580#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:49,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {5580#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5581#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:49,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {5581#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {5581#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:49,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {5581#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5582#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:49,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {5582#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5582#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:49,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {5582#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5583#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:49,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {5583#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5583#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:49,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {5583#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5584#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:49,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {5584#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5584#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:49,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {5584#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5585#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:49,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {5585#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5585#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:49,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {5585#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5586#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:49,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {5586#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5586#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:49,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {5586#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5587#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:49,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {5587#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5587#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:49,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {5587#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5588#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:49,501 INFO L290 TraceCheckUtils]: 32: Hoare triple {5588#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5588#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:49,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {5588#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5589#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:49,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {5589#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {5589#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:49,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {5589#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {5571#false} is VALID [2022-04-15 12:17:49,503 INFO L290 TraceCheckUtils]: 36: Hoare triple {5571#false} assume !(~x~0 % 4294967296 < 268435455); {5571#false} is VALID [2022-04-15 12:17:49,503 INFO L272 TraceCheckUtils]: 37: Hoare triple {5571#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)); {5571#false} is VALID [2022-04-15 12:17:49,503 INFO L290 TraceCheckUtils]: 38: Hoare triple {5571#false} ~cond := #in~cond; {5571#false} is VALID [2022-04-15 12:17:49,503 INFO L290 TraceCheckUtils]: 39: Hoare triple {5571#false} assume 0 == ~cond; {5571#false} is VALID [2022-04-15 12:17:49,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {5571#false} assume !false; {5571#false} is VALID [2022-04-15 12:17:49,504 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:49,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:49,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109304183] [2022-04-15 12:17:49,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109304183] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:49,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455429841] [2022-04-15 12:17:49,504 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:49,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:49,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:49,505 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:49,506 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:49,541 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:49,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:49,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 12:17:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:49,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:49,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {5570#true} call ULTIMATE.init(); {5570#true} is VALID [2022-04-15 12:17:49,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {5570#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); {5570#true} is VALID [2022-04-15 12:17:49,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {5570#true} assume true; {5570#true} is VALID [2022-04-15 12:17:49,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5570#true} {5570#true} #40#return; {5570#true} is VALID [2022-04-15 12:17:49,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {5570#true} call #t~ret5 := main(); {5570#true} is VALID [2022-04-15 12:17:49,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {5570#true} ~x~0 := 0; {5575#(= main_~x~0 0)} is VALID [2022-04-15 12:17:49,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {5575#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {5575#(= main_~x~0 0)} is VALID [2022-04-15 12:17:49,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {5575#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5576#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:49,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {5576#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {5576#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:49,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {5576#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5577#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:49,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {5577#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {5577#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:49,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {5577#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5578#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:49,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {5578#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5578#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:49,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {5578#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5579#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:49,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {5579#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5579#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:49,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {5579#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5580#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:49,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {5580#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {5580#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:49,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {5580#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5581#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:49,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {5581#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {5581#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:49,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {5581#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5582#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:49,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {5582#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5582#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:49,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {5582#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5583#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:49,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {5583#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5583#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:49,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {5583#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5584#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:49,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {5584#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5584#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:49,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {5584#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5585#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:49,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {5585#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5585#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:49,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {5585#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5586#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:49,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {5586#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5586#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:49,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {5586#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5587#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:49,919 INFO L290 TraceCheckUtils]: 30: Hoare triple {5587#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5587#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:49,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {5587#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5588#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:49,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {5588#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5588#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:49,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {5588#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5693#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:49,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {5693#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {5693#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:49,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {5693#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {5700#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:49,922 INFO L290 TraceCheckUtils]: 36: Hoare triple {5700#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {5700#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:49,923 INFO L272 TraceCheckUtils]: 37: Hoare triple {5700#(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)); {5707#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:49,923 INFO L290 TraceCheckUtils]: 38: Hoare triple {5707#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5711#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:49,923 INFO L290 TraceCheckUtils]: 39: Hoare triple {5711#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5571#false} is VALID [2022-04-15 12:17:49,923 INFO L290 TraceCheckUtils]: 40: Hoare triple {5571#false} assume !false; {5571#false} is VALID [2022-04-15 12:17:49,924 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:49,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:50,108 INFO L290 TraceCheckUtils]: 40: Hoare triple {5571#false} assume !false; {5571#false} is VALID [2022-04-15 12:17:50,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {5711#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5571#false} is VALID [2022-04-15 12:17:50,109 INFO L290 TraceCheckUtils]: 38: Hoare triple {5707#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5711#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:50,109 INFO L272 TraceCheckUtils]: 37: Hoare triple {5727#(= (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)); {5707#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:50,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {5740#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {5740#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5740#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:50,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5740#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:50,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {5740#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,115 INFO L290 TraceCheckUtils]: 28: Hoare triple {5740#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5740#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:50,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5740#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:50,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {5740#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {5740#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5740#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:50,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5740#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:50,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {5740#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {5740#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5740#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:50,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5740#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:50,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {5740#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {5740#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5740#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:50,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5740#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:50,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {5740#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {5740#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5740#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:50,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5740#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:50,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {5740#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {5740#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5740#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:50,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5740#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:50,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {5727#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {5570#true} ~x~0 := 0; {5727#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:50,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {5570#true} call #t~ret5 := main(); {5570#true} is VALID [2022-04-15 12:17:50,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5570#true} {5570#true} #40#return; {5570#true} is VALID [2022-04-15 12:17:50,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {5570#true} assume true; {5570#true} is VALID [2022-04-15 12:17:50,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {5570#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); {5570#true} is VALID [2022-04-15 12:17:50,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {5570#true} call ULTIMATE.init(); {5570#true} is VALID [2022-04-15 12:17:50,128 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:50,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455429841] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:50,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:50,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 6] total 24 [2022-04-15 12:17:50,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:50,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1363215170] [2022-04-15 12:17:50,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1363215170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:50,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:50,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:17:50,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269585198] [2022-04-15 12:17:50,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:50,129 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:50,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:50,130 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:50,170 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:50,171 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:17:50,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:50,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:17:50,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:17:50,171 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:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:51,463 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-15 12:17:51,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:17:51,463 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,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:51,463 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:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2022-04-15 12:17:51,464 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:51,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2022-04-15 12:17:51,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 53 transitions. [2022-04-15 12:17:51,526 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:51,527 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:17:51,527 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 12:17:51,528 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:51,528 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:51,528 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 29 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:17:51,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 12:17:51,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 12:17:51,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:51,605 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:51,606 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:51,606 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:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:51,606 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-15 12:17:51,606 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 12:17:51,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:51,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:51,607 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:51,607 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:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:51,607 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-15 12:17:51,607 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 12:17:51,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:51,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:51,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:51,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:51,608 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:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-15 12:17:51,608 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 41 [2022-04-15 12:17:51,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:51,609 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-15 12:17:51,609 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:51,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 47 transitions. [2022-04-15 12:17:51,705 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:51,705 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 12:17:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 12:17:51,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:51,706 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:51,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-15 12:17:51,906 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:51,906 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:51,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1310743632, now seen corresponding path program 29 times [2022-04-15 12:17:51,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:51,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [88649106] [2022-04-15 12:17:52,048 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:52,050 INFO L85 PathProgramCache]: Analyzing trace with hash -416595343, now seen corresponding path program 1 times [2022-04-15 12:17:52,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:52,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384198260] [2022-04-15 12:17:52,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:52,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:52,057 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:52,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:52,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1310743632, now seen corresponding path program 30 times [2022-04-15 12:17:52,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:52,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121198436] [2022-04-15 12:17:52,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:52,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:52,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:52,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {6177#(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); {6156#true} is VALID [2022-04-15 12:17:52,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {6156#true} assume true; {6156#true} is VALID [2022-04-15 12:17:52,368 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6156#true} {6156#true} #40#return; {6156#true} is VALID [2022-04-15 12:17:52,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {6156#true} call ULTIMATE.init(); {6177#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:52,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {6177#(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); {6156#true} is VALID [2022-04-15 12:17:52,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {6156#true} assume true; {6156#true} is VALID [2022-04-15 12:17:52,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6156#true} {6156#true} #40#return; {6156#true} is VALID [2022-04-15 12:17:52,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {6156#true} call #t~ret5 := main(); {6156#true} is VALID [2022-04-15 12:17:52,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {6156#true} ~x~0 := 0; {6161#(= main_~x~0 0)} is VALID [2022-04-15 12:17:52,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {6161#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {6161#(= main_~x~0 0)} is VALID [2022-04-15 12:17:52,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {6161#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6162#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:52,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {6162#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {6162#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:52,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {6162#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6163#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:52,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {6163#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {6163#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:52,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {6163#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6164#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:52,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {6164#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6164#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:52,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {6164#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6165#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:52,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {6165#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6165#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:52,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {6165#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6166#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:52,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {6166#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {6166#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:52,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {6166#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6167#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:52,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {6167#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {6167#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:52,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {6167#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6168#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:52,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {6168#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6168#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:52,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {6168#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6169#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:52,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {6169#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6169#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:52,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {6169#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6170#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:52,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {6170#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6170#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:52,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {6170#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6171#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:52,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {6171#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6171#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:52,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {6171#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6172#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:52,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {6172#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6172#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:52,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {6172#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6173#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:52,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {6173#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6173#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:52,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {6173#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6174#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:52,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {6174#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6174#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:52,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {6174#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6175#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:52,390 INFO L290 TraceCheckUtils]: 34: Hoare triple {6175#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {6175#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:52,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {6175#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6176#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:52,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {6176#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {6176#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:52,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {6176#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {6157#false} is VALID [2022-04-15 12:17:52,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {6157#false} assume !(~x~0 % 4294967296 < 268435455); {6157#false} is VALID [2022-04-15 12:17:52,393 INFO L272 TraceCheckUtils]: 39: Hoare triple {6157#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)); {6157#false} is VALID [2022-04-15 12:17:52,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {6157#false} ~cond := #in~cond; {6157#false} is VALID [2022-04-15 12:17:52,393 INFO L290 TraceCheckUtils]: 41: Hoare triple {6157#false} assume 0 == ~cond; {6157#false} is VALID [2022-04-15 12:17:52,393 INFO L290 TraceCheckUtils]: 42: Hoare triple {6157#false} assume !false; {6157#false} is VALID [2022-04-15 12:17:52,394 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:52,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:52,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121198436] [2022-04-15 12:17:52,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121198436] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:52,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104401369] [2022-04-15 12:17:52,394 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:17:52,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:52,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:52,395 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:52,396 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:52,465 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:17:52,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:52,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:17:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:52,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:52,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {6156#true} call ULTIMATE.init(); {6156#true} is VALID [2022-04-15 12:17:52,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {6156#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); {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {6156#true} assume true; {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6156#true} {6156#true} #40#return; {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {6156#true} call #t~ret5 := main(); {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {6156#true} ~x~0 := 0; {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:52,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:52,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:52,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:52,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:52,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:52,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:52,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:52,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:52,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:52,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:52,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:52,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:52,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:52,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:52,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:52,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:52,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:52,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6286#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:17:52,919 INFO L290 TraceCheckUtils]: 36: Hoare triple {6286#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {6286#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:17:52,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {6286#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {6293#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65520))} is VALID [2022-04-15 12:17:52,922 INFO L290 TraceCheckUtils]: 38: Hoare triple {6293#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65520))} assume !(~x~0 % 4294967296 < 268435455); {6157#false} is VALID [2022-04-15 12:17:52,922 INFO L272 TraceCheckUtils]: 39: Hoare triple {6157#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)); {6157#false} is VALID [2022-04-15 12:17:52,922 INFO L290 TraceCheckUtils]: 40: Hoare triple {6157#false} ~cond := #in~cond; {6157#false} is VALID [2022-04-15 12:17:52,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {6157#false} assume 0 == ~cond; {6157#false} is VALID [2022-04-15 12:17:52,923 INFO L290 TraceCheckUtils]: 42: Hoare triple {6157#false} assume !false; {6157#false} is VALID [2022-04-15 12:17:52,923 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:52,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:53,322 INFO L290 TraceCheckUtils]: 42: Hoare triple {6157#false} assume !false; {6157#false} is VALID [2022-04-15 12:17:53,322 INFO L290 TraceCheckUtils]: 41: Hoare triple {6157#false} assume 0 == ~cond; {6157#false} is VALID [2022-04-15 12:17:53,322 INFO L290 TraceCheckUtils]: 40: Hoare triple {6157#false} ~cond := #in~cond; {6157#false} is VALID [2022-04-15 12:17:53,322 INFO L272 TraceCheckUtils]: 39: Hoare triple {6157#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)); {6157#false} is VALID [2022-04-15 12:17:53,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {6321#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {6157#false} is VALID [2022-04-15 12:17:53,324 INFO L290 TraceCheckUtils]: 37: Hoare triple {6325#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {6321#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:17:53,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {6329#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455); {6325#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:17:53,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6329#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-15 12:17:53,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:53,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:53,338 INFO L290 TraceCheckUtils]: 32: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:53,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:53,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:53,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:53,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:53,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:53,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:53,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:53,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:53,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:53,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:53,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:53,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {6156#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {6156#true} assume !!(~x~0 % 4294967296 < 268435455); {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {6156#true} ~x~0 := 0; {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {6156#true} call #t~ret5 := main(); {6156#true} is VALID [2022-04-15 12:17:53,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6156#true} {6156#true} #40#return; {6156#true} is VALID [2022-04-15 12:17:53,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {6156#true} assume true; {6156#true} is VALID [2022-04-15 12:17:53,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {6156#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); {6156#true} is VALID [2022-04-15 12:17:53,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {6156#true} call ULTIMATE.init(); {6156#true} is VALID [2022-04-15 12:17:53,340 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,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104401369] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:53,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:53,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 4, 5] total 24 [2022-04-15 12:17:53,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:53,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [88649106] [2022-04-15 12:17:53,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [88649106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:53,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:53,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:17:53,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399214952] [2022-04-15 12:17:53,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:53,341 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:53,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:53,341 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:53,390 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:53,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:17:53,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:53,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:17:53,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:17:53,391 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:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:54,771 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-15 12:17:54,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:17:54,772 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,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:54,772 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:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2022-04-15 12:17:54,773 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:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2022-04-15 12:17:54,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 55 transitions. [2022-04-15 12:17:54,841 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:54,841 INFO L225 Difference]: With dead ends: 54 [2022-04-15 12:17:54,841 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 12:17:54,842 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=285, Invalid=1275, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:17:54,842 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:54,843 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 24 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:17:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 12:17:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 12:17:54,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:54,926 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:54,926 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:54,926 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:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:54,927 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 12:17:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 12:17:54,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:54,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:54,927 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:54,927 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:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:54,928 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 12:17:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 12:17:54,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:54,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:54,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:54,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:54,928 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:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-15 12:17:54,929 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 43 [2022-04-15 12:17:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:54,929 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-15 12:17:54,929 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:54,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2022-04-15 12:17:55,033 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,033 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 12:17:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 12:17:55,034 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:55,034 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,040 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:55,234 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:55,234 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:55,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash 742724429, now seen corresponding path program 31 times [2022-04-15 12:17:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:55,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1732166799] [2022-04-15 12:17:55,379 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:55,381 INFO L85 PathProgramCache]: Analyzing trace with hash -357489999, now seen corresponding path program 1 times [2022-04-15 12:17:55,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:55,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660033160] [2022-04-15 12:17:55,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:55,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:55,391 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:55,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:55,398 INFO L85 PathProgramCache]: Analyzing trace with hash 742724429, now seen corresponding path program 32 times [2022-04-15 12:17:55,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:55,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039456219] [2022-04-15 12:17:55,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:55,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:55,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:55,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {6790#(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); {6768#true} is VALID [2022-04-15 12:17:55,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {6768#true} assume true; {6768#true} is VALID [2022-04-15 12:17:55,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6768#true} {6768#true} #40#return; {6768#true} is VALID [2022-04-15 12:17:55,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {6768#true} call ULTIMATE.init(); {6790#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:55,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {6790#(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); {6768#true} is VALID [2022-04-15 12:17:55,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {6768#true} assume true; {6768#true} is VALID [2022-04-15 12:17:55,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6768#true} {6768#true} #40#return; {6768#true} is VALID [2022-04-15 12:17:55,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {6768#true} call #t~ret5 := main(); {6768#true} is VALID [2022-04-15 12:17:55,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {6768#true} ~x~0 := 0; {6773#(= main_~x~0 0)} is VALID [2022-04-15 12:17:55,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {6773#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {6773#(= main_~x~0 0)} is VALID [2022-04-15 12:17:55,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {6773#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6774#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:55,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {6774#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {6774#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:55,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {6774#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6775#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:55,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {6775#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {6775#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:55,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {6775#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6776#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:55,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {6776#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6776#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:55,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {6776#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6777#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:55,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {6777#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6777#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:55,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {6777#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6778#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:55,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {6778#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {6778#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:55,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {6778#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6779#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:55,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {6779#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {6779#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:55,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {6779#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6780#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:55,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {6780#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6780#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:55,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {6780#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6781#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:55,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {6781#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6781#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:55,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {6781#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6782#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:55,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {6782#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6782#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:55,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {6782#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6783#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:55,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {6783#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6783#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:55,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {6783#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6784#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:55,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {6784#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6784#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:55,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {6784#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6785#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:55,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {6785#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6785#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:55,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {6785#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6786#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:55,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {6786#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6786#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:55,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {6786#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6787#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:55,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {6787#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {6787#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:55,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {6787#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6788#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:55,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {6788#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {6788#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:55,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {6788#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6789#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:55,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {6789#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {6789#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:17:55,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {6789#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {6769#false} is VALID [2022-04-15 12:17:55,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {6769#false} assume !(~x~0 % 4294967296 < 268435455); {6769#false} is VALID [2022-04-15 12:17:55,725 INFO L272 TraceCheckUtils]: 41: Hoare triple {6769#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)); {6769#false} is VALID [2022-04-15 12:17:55,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {6769#false} ~cond := #in~cond; {6769#false} is VALID [2022-04-15 12:17:55,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {6769#false} assume 0 == ~cond; {6769#false} is VALID [2022-04-15 12:17:55,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {6769#false} assume !false; {6769#false} is VALID [2022-04-15 12:17:55,725 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:55,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:55,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039456219] [2022-04-15 12:17:55,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039456219] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:55,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423907033] [2022-04-15 12:17:55,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:17:55,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:55,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:55,727 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:55,728 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:55,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:17:55,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:55,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 12:17:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:55,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:56,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {6768#true} call ULTIMATE.init(); {6768#true} is VALID [2022-04-15 12:17:56,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {6768#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); {6768#true} is VALID [2022-04-15 12:17:56,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {6768#true} assume true; {6768#true} is VALID [2022-04-15 12:17:56,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6768#true} {6768#true} #40#return; {6768#true} is VALID [2022-04-15 12:17:56,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {6768#true} call #t~ret5 := main(); {6768#true} is VALID [2022-04-15 12:17:56,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {6768#true} ~x~0 := 0; {6773#(= main_~x~0 0)} is VALID [2022-04-15 12:17:56,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {6773#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {6773#(= main_~x~0 0)} is VALID [2022-04-15 12:17:56,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {6773#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6774#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:56,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {6774#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {6774#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:56,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {6774#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6775#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:56,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {6775#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {6775#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:56,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {6775#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6776#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:56,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {6776#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6776#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:56,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {6776#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6777#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:56,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {6777#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6777#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:56,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {6777#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6778#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:56,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {6778#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {6778#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:56,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {6778#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6779#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:56,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {6779#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {6779#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:56,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {6779#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6780#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:56,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {6780#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6780#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:56,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {6780#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6781#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:56,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {6781#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6781#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:56,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {6781#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6782#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:56,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {6782#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6782#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:56,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {6782#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6783#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:56,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {6783#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6783#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:56,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {6783#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6784#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:56,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {6784#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6784#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:56,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {6784#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6785#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:56,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {6785#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6785#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:56,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {6785#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6786#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:56,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {6786#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6786#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:56,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {6786#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6787#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:56,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {6787#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {6787#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:56,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {6787#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6788#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:56,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {6788#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {6788#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:56,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {6788#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6905#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:56,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {6905#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6905#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:56,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {6905#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {6912#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:17:56,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {6912#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {6912#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:17:56,209 INFO L272 TraceCheckUtils]: 41: Hoare triple {6912#(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)); {6919#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:56,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {6919#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6923#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:56,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {6923#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6769#false} is VALID [2022-04-15 12:17:56,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {6769#false} assume !false; {6769#false} is VALID [2022-04-15 12:17:56,210 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:56,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:17:56,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {6769#false} assume !false; {6769#false} is VALID [2022-04-15 12:17:56,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {6923#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6769#false} is VALID [2022-04-15 12:17:56,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {6919#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6923#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:56,404 INFO L272 TraceCheckUtils]: 41: Hoare triple {6939#(= (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)); {6919#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:56,405 INFO L290 TraceCheckUtils]: 40: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {6952#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,409 INFO L290 TraceCheckUtils]: 36: Hoare triple {6952#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6952#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:56,410 INFO L290 TraceCheckUtils]: 35: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6952#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:56,410 INFO L290 TraceCheckUtils]: 34: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {6952#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {6952#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6952#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:56,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6952#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:56,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {6952#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {6952#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6952#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:56,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6952#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:56,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {6952#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {6952#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6952#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:56,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6952#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:56,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {6952#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {6952#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6952#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:56,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6952#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:56,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {6952#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {6952#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6952#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:56,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6952#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:56,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {6952#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {6952#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6952#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:56,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6952#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:56,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {6952#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {6952#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6952#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:56,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6952#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:17:56,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {6939#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {6768#true} ~x~0 := 0; {6939#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:17:56,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {6768#true} call #t~ret5 := main(); {6768#true} is VALID [2022-04-15 12:17:56,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6768#true} {6768#true} #40#return; {6768#true} is VALID [2022-04-15 12:17:56,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {6768#true} assume true; {6768#true} is VALID [2022-04-15 12:17:56,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {6768#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); {6768#true} is VALID [2022-04-15 12:17:56,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {6768#true} call ULTIMATE.init(); {6768#true} is VALID [2022-04-15 12:17:56,433 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:56,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423907033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:17:56,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:17:56,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 6] total 26 [2022-04-15 12:17:56,433 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:56,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1732166799] [2022-04-15 12:17:56,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1732166799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:56,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:56,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:17:56,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686763359] [2022-04-15 12:17:56,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:56,434 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:56,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:56,434 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:56,490 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:56,490 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:17:56,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:56,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:17:56,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:17:56,491 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:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:58,344 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-04-15 12:17:58,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:17:58,344 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:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:58,345 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:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2022-04-15 12:17:58,346 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:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2022-04-15 12:17:58,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 57 transitions. [2022-04-15 12:17:58,420 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:58,420 INFO L225 Difference]: With dead ends: 56 [2022-04-15 12:17:58,420 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 12:17:58,421 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:58,421 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:58,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 74 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 12:17:58,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 12:17:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-15 12:17:58,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:58,518 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:58,519 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:58,519 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:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:58,519 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-04-15 12:17:58,519 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-04-15 12:17:58,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:58,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:58,520 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:58,520 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:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:58,521 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-04-15 12:17:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-04-15 12:17:58,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:58,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:58,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:58,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:58,521 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:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2022-04-15 12:17:58,521 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 45 [2022-04-15 12:17:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:58,522 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2022-04-15 12:17:58,522 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:58,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 51 transitions. [2022-04-15 12:17:58,632 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:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-04-15 12:17:58,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 12:17:58,633 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:58,633 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:58,649 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:58,833 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:58,834 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:58,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:58,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1559425110, now seen corresponding path program 33 times [2022-04-15 12:17:58,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:58,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1284782380] [2022-04-15 12:17:59,006 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:17:59,008 INFO L85 PathProgramCache]: Analyzing trace with hash -298384655, now seen corresponding path program 1 times [2022-04-15 12:17:59,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:59,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610348049] [2022-04-15 12:17:59,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:59,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:59,039 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:17:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:17:59,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:17:59,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1559425110, now seen corresponding path program 34 times [2022-04-15 12:17:59,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:59,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442527364] [2022-04-15 12:17:59,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:59,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:59,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:59,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {7431#(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); {7408#true} is VALID [2022-04-15 12:17:59,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {7408#true} assume true; {7408#true} is VALID [2022-04-15 12:17:59,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7408#true} {7408#true} #40#return; {7408#true} is VALID [2022-04-15 12:17:59,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {7408#true} call ULTIMATE.init(); {7431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:59,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {7431#(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); {7408#true} is VALID [2022-04-15 12:17:59,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {7408#true} assume true; {7408#true} is VALID [2022-04-15 12:17:59,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7408#true} {7408#true} #40#return; {7408#true} is VALID [2022-04-15 12:17:59,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {7408#true} call #t~ret5 := main(); {7408#true} is VALID [2022-04-15 12:17:59,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {7408#true} ~x~0 := 0; {7413#(= main_~x~0 0)} is VALID [2022-04-15 12:17:59,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {7413#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {7413#(= main_~x~0 0)} is VALID [2022-04-15 12:17:59,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {7413#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7414#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:59,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {7414#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {7414#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:59,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {7414#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7415#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:59,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {7415#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {7415#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:59,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {7415#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7416#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:59,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {7416#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7416#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:59,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {7416#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7417#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:59,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {7417#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7417#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:59,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {7417#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7418#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:59,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {7418#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {7418#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:59,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {7418#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7419#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:59,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {7419#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {7419#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:59,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {7419#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7420#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:59,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {7420#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7420#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:59,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {7420#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7421#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:59,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {7421#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7421#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:59,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {7421#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7422#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:59,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {7422#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7422#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:59,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {7422#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7423#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:59,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {7423#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7423#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:59,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {7423#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7424#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:59,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {7424#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7424#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:59,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {7424#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7425#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:59,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {7425#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7425#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:59,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {7425#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7426#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:59,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {7426#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7426#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:59,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {7426#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7427#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:59,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {7427#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {7427#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:59,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {7427#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7428#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:59,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {7428#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {7428#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:59,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {7428#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7429#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:59,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {7429#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7429#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:59,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {7429#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7430#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-15 12:17:59,383 INFO L290 TraceCheckUtils]: 40: Hoare triple {7430#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {7430#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-15 12:17:59,384 INFO L290 TraceCheckUtils]: 41: Hoare triple {7430#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {7409#false} is VALID [2022-04-15 12:17:59,384 INFO L290 TraceCheckUtils]: 42: Hoare triple {7409#false} assume !(~x~0 % 4294967296 < 268435455); {7409#false} is VALID [2022-04-15 12:17:59,384 INFO L272 TraceCheckUtils]: 43: Hoare triple {7409#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)); {7409#false} is VALID [2022-04-15 12:17:59,384 INFO L290 TraceCheckUtils]: 44: Hoare triple {7409#false} ~cond := #in~cond; {7409#false} is VALID [2022-04-15 12:17:59,384 INFO L290 TraceCheckUtils]: 45: Hoare triple {7409#false} assume 0 == ~cond; {7409#false} is VALID [2022-04-15 12:17:59,384 INFO L290 TraceCheckUtils]: 46: Hoare triple {7409#false} assume !false; {7409#false} is VALID [2022-04-15 12:17:59,384 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:17:59,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:59,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442527364] [2022-04-15 12:17:59,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442527364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:17:59,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597649915] [2022-04-15 12:17:59,385 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:17:59,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:59,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:59,393 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:17:59,454 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:17:59,466 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:17:59,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:17:59,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 12:17:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:59,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:59,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {7408#true} call ULTIMATE.init(); {7408#true} is VALID [2022-04-15 12:17:59,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {7408#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); {7408#true} is VALID [2022-04-15 12:17:59,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {7408#true} assume true; {7408#true} is VALID [2022-04-15 12:17:59,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7408#true} {7408#true} #40#return; {7408#true} is VALID [2022-04-15 12:17:59,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {7408#true} call #t~ret5 := main(); {7408#true} is VALID [2022-04-15 12:17:59,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {7408#true} ~x~0 := 0; {7413#(= main_~x~0 0)} is VALID [2022-04-15 12:17:59,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {7413#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {7413#(= main_~x~0 0)} is VALID [2022-04-15 12:17:59,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {7413#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7414#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:59,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {7414#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {7414#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:17:59,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {7414#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7415#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:59,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {7415#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {7415#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:17:59,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {7415#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7416#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:59,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {7416#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7416#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:17:59,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {7416#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7417#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:59,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {7417#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7417#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:17:59,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {7417#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7418#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:59,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {7418#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {7418#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:17:59,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {7418#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7419#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:59,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {7419#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {7419#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:17:59,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {7419#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7420#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:59,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {7420#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7420#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:17:59,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {7420#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7421#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:59,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {7421#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7421#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:17:59,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {7421#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7422#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:59,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {7422#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7422#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:17:59,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {7422#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7423#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:59,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {7423#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7423#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:17:59,895 INFO L290 TraceCheckUtils]: 27: Hoare triple {7423#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7424#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:59,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {7424#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7424#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:17:59,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {7424#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7425#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:59,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {7425#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7425#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:17:59,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {7425#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7426#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:59,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {7426#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7426#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:17:59,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {7426#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7427#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:59,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {7427#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {7427#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:17:59,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {7427#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7428#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:59,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {7428#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {7428#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:17:59,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {7428#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7429#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:59,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {7429#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {7429#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:17:59,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {7429#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7552#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:17:59,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {7552#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {7552#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:17:59,905 INFO L290 TraceCheckUtils]: 41: Hoare triple {7552#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {7409#false} is VALID [2022-04-15 12:17:59,905 INFO L290 TraceCheckUtils]: 42: Hoare triple {7409#false} assume !(~x~0 % 4294967296 < 268435455); {7409#false} is VALID [2022-04-15 12:17:59,905 INFO L272 TraceCheckUtils]: 43: Hoare triple {7409#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)); {7409#false} is VALID [2022-04-15 12:17:59,906 INFO L290 TraceCheckUtils]: 44: Hoare triple {7409#false} ~cond := #in~cond; {7409#false} is VALID [2022-04-15 12:17:59,906 INFO L290 TraceCheckUtils]: 45: Hoare triple {7409#false} assume 0 == ~cond; {7409#false} is VALID [2022-04-15 12:17:59,906 INFO L290 TraceCheckUtils]: 46: Hoare triple {7409#false} assume !false; {7409#false} is VALID [2022-04-15 12:17:59,906 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:17:59,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:01,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {7409#false} assume !false; {7409#false} is VALID [2022-04-15 12:18:01,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {7409#false} assume 0 == ~cond; {7409#false} is VALID [2022-04-15 12:18:01,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {7409#false} ~cond := #in~cond; {7409#false} is VALID [2022-04-15 12:18:01,057 INFO L272 TraceCheckUtils]: 43: Hoare triple {7409#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)); {7409#false} is VALID [2022-04-15 12:18:01,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {7409#false} assume !(~x~0 % 4294967296 < 268435455); {7409#false} is VALID [2022-04-15 12:18:01,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {7589#(< (mod main_~x~0 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {7409#false} is VALID [2022-04-15 12:18:01,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {7593#(or (< (mod main_~x~0 4294967296) 65520) (not (< (mod main_~x~0 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {7589#(< (mod main_~x~0 4294967296) 65520)} is VALID [2022-04-15 12:18:01,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {7597#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7593#(or (< (mod main_~x~0 4294967296) 65520) (not (< (mod main_~x~0 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,061 INFO L290 TraceCheckUtils]: 38: Hoare triple {7597#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {7597#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {7604#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7597#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {7604#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {7604#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {7611#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7604#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {7611#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {7611#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {7618#(or (< (mod (+ main_~x~0 4) 4294967296) 65520) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7611#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,067 INFO L290 TraceCheckUtils]: 32: Hoare triple {7618#(or (< (mod (+ main_~x~0 4) 4294967296) 65520) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {7618#(or (< (mod (+ main_~x~0 4) 4294967296) 65520) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {7625#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7618#(or (< (mod (+ main_~x~0 4) 4294967296) 65520) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {7625#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {7625#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {7632#(or (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)) (< (mod (+ main_~x~0 6) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7625#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 268435455)) (< (mod (+ 5 main_~x~0) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {7632#(or (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)) (< (mod (+ main_~x~0 6) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {7632#(or (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)) (< (mod (+ main_~x~0 6) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {7639#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 268435455)) (< (mod (+ 7 main_~x~0) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7632#(or (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)) (< (mod (+ main_~x~0 6) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {7639#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 268435455)) (< (mod (+ 7 main_~x~0) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {7639#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 268435455)) (< (mod (+ 7 main_~x~0) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {7646#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7639#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 268435455)) (< (mod (+ 7 main_~x~0) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {7646#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {7646#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {7653#(or (not (< (mod (+ main_~x~0 9) 4294967296) 268435455)) (< (mod (+ main_~x~0 9) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7646#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {7653#(or (not (< (mod (+ main_~x~0 9) 4294967296) 268435455)) (< (mod (+ main_~x~0 9) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {7653#(or (not (< (mod (+ main_~x~0 9) 4294967296) 268435455)) (< (mod (+ main_~x~0 9) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {7660#(or (< (mod (+ main_~x~0 10) 4294967296) 65520) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7653#(or (not (< (mod (+ main_~x~0 9) 4294967296) 268435455)) (< (mod (+ main_~x~0 9) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {7660#(or (< (mod (+ main_~x~0 10) 4294967296) 65520) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {7660#(or (< (mod (+ main_~x~0 10) 4294967296) 65520) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {7667#(or (< (mod (+ main_~x~0 11) 4294967296) 65520) (not (< (mod (+ main_~x~0 11) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7660#(or (< (mod (+ main_~x~0 10) 4294967296) 65520) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {7667#(or (< (mod (+ main_~x~0 11) 4294967296) 65520) (not (< (mod (+ main_~x~0 11) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {7667#(or (< (mod (+ main_~x~0 11) 4294967296) 65520) (not (< (mod (+ main_~x~0 11) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {7674#(or (< (mod (+ main_~x~0 12) 4294967296) 65520) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7667#(or (< (mod (+ main_~x~0 11) 4294967296) 65520) (not (< (mod (+ main_~x~0 11) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {7674#(or (< (mod (+ main_~x~0 12) 4294967296) 65520) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {7674#(or (< (mod (+ main_~x~0 12) 4294967296) 65520) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {7681#(or (< (mod (+ main_~x~0 13) 4294967296) 65520) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7674#(or (< (mod (+ main_~x~0 12) 4294967296) 65520) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {7681#(or (< (mod (+ main_~x~0 13) 4294967296) 65520) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {7681#(or (< (mod (+ main_~x~0 13) 4294967296) 65520) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {7688#(or (< (mod (+ main_~x~0 14) 4294967296) 65520) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7681#(or (< (mod (+ main_~x~0 13) 4294967296) 65520) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {7688#(or (< (mod (+ main_~x~0 14) 4294967296) 65520) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {7688#(or (< (mod (+ main_~x~0 14) 4294967296) 65520) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {7695#(or (< (mod (+ main_~x~0 15) 4294967296) 65520) (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7688#(or (< (mod (+ main_~x~0 14) 4294967296) 65520) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {7695#(or (< (mod (+ main_~x~0 15) 4294967296) 65520) (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455); {7695#(or (< (mod (+ main_~x~0 15) 4294967296) 65520) (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {7702#(or (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (< (mod (+ main_~x~0 16) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7695#(or (< (mod (+ main_~x~0 15) 4294967296) 65520) (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)))} is VALID [2022-04-15 12:18:01,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {7702#(or (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (< (mod (+ main_~x~0 16) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {7702#(or (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (< (mod (+ main_~x~0 16) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {7709#(or (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)) (< (mod (+ main_~x~0 17) 4294967296) 65520))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7702#(or (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (< (mod (+ main_~x~0 16) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {7709#(or (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)) (< (mod (+ main_~x~0 17) 4294967296) 65520))} assume !!(~x~0 % 4294967296 < 268435455); {7709#(or (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)) (< (mod (+ main_~x~0 17) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {7408#true} ~x~0 := 0; {7709#(or (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)) (< (mod (+ main_~x~0 17) 4294967296) 65520))} is VALID [2022-04-15 12:18:01,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {7408#true} call #t~ret5 := main(); {7408#true} is VALID [2022-04-15 12:18:01,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7408#true} {7408#true} #40#return; {7408#true} is VALID [2022-04-15 12:18:01,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {7408#true} assume true; {7408#true} is VALID [2022-04-15 12:18:01,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {7408#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); {7408#true} is VALID [2022-04-15 12:18:01,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {7408#true} call ULTIMATE.init(); {7408#true} is VALID [2022-04-15 12:18:01,100 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,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597649915] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:01,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:01,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 41 [2022-04-15 12:18:01,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:01,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1284782380] [2022-04-15 12:18:01,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1284782380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:01,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:01,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:18:01,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000305280] [2022-04-15 12:18:01,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:01,101 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,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:01,101 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,164 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,164 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:18:01,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:01,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:18:01,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=1181, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:18:01,165 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,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:03,044 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-15 12:18:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:18:03,045 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,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:03,045 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,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2022-04-15 12:18:03,046 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,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2022-04-15 12:18:03,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 59 transitions. [2022-04-15 12:18:03,139 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,139 INFO L225 Difference]: With dead ends: 58 [2022-04-15 12:18:03,139 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 12:18:03,140 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=907, Invalid=2515, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 12:18:03,141 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:03,141 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 34 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 12:18:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 12:18:03,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 12:18:03,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:03,230 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,230 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,230 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,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:03,231 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-04-15 12:18:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-04-15 12:18:03,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:03,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:03,231 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,232 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,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:03,232 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-04-15 12:18:03,232 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-04-15 12:18:03,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:03,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:03,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:03,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:03,232 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,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-04-15 12:18:03,233 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 47 [2022-04-15 12:18:03,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:03,233 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-04-15 12:18:03,233 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,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 53 transitions. [2022-04-15 12:18:03,358 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,359 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-04-15 12:18:03,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 12:18:03,359 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:03,359 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,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:03,559 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:03,560 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:03,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:03,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2016974649, now seen corresponding path program 35 times [2022-04-15 12:18:03,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:03,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [684603422] [2022-04-15 12:18:03,750 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:18:03,755 INFO L85 PathProgramCache]: Analyzing trace with hash -239279311, now seen corresponding path program 1 times [2022-04-15 12:18:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:03,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833065515] [2022-04-15 12:18:03,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:03,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:03,762 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:03,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:03,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2016974649, now seen corresponding path program 36 times [2022-04-15 12:18:03,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:03,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801831095] [2022-04-15 12:18:03,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:03,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:04,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:04,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {8113#(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); {8089#true} is VALID [2022-04-15 12:18:04,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {8089#true} assume true; {8089#true} is VALID [2022-04-15 12:18:04,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8089#true} {8089#true} #40#return; {8089#true} is VALID [2022-04-15 12:18:04,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {8089#true} call ULTIMATE.init(); {8113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:04,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {8113#(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); {8089#true} is VALID [2022-04-15 12:18:04,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {8089#true} assume true; {8089#true} is VALID [2022-04-15 12:18:04,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8089#true} {8089#true} #40#return; {8089#true} is VALID [2022-04-15 12:18:04,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {8089#true} call #t~ret5 := main(); {8089#true} is VALID [2022-04-15 12:18:04,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {8089#true} ~x~0 := 0; {8094#(= main_~x~0 0)} is VALID [2022-04-15 12:18:04,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {8094#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {8094#(= main_~x~0 0)} is VALID [2022-04-15 12:18:04,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {8094#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8095#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:04,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {8095#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {8095#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:04,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {8095#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8096#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:04,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {8096#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {8096#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:04,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {8096#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8097#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:04,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {8097#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8097#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:04,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {8097#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8098#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:04,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {8098#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8098#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:04,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {8098#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8099#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:04,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {8099#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {8099#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:04,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {8099#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8100#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:04,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {8100#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {8100#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:04,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {8100#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8101#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:04,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {8101#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8101#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:04,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {8101#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8102#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:04,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {8102#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8102#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:04,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {8102#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8103#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:04,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {8103#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8103#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:04,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {8103#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8104#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:04,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {8104#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8104#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:04,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {8104#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8105#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:04,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {8105#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8105#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:04,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {8105#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8106#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:04,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {8106#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8106#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:04,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {8106#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8107#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:04,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {8107#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8107#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:04,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {8107#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8108#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:04,125 INFO L290 TraceCheckUtils]: 34: Hoare triple {8108#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {8108#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:04,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {8108#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8109#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:04,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {8109#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {8109#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:04,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {8109#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8110#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:04,130 INFO L290 TraceCheckUtils]: 38: Hoare triple {8110#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8110#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:04,131 INFO L290 TraceCheckUtils]: 39: Hoare triple {8110#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8111#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:04,131 INFO L290 TraceCheckUtils]: 40: Hoare triple {8111#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {8111#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:04,133 INFO L290 TraceCheckUtils]: 41: Hoare triple {8111#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8112#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:04,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {8112#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {8112#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:04,134 INFO L290 TraceCheckUtils]: 43: Hoare triple {8112#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {8090#false} is VALID [2022-04-15 12:18:04,134 INFO L290 TraceCheckUtils]: 44: Hoare triple {8090#false} assume !(~x~0 % 4294967296 < 268435455); {8090#false} is VALID [2022-04-15 12:18:04,134 INFO L272 TraceCheckUtils]: 45: Hoare triple {8090#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)); {8090#false} is VALID [2022-04-15 12:18:04,134 INFO L290 TraceCheckUtils]: 46: Hoare triple {8090#false} ~cond := #in~cond; {8090#false} is VALID [2022-04-15 12:18:04,134 INFO L290 TraceCheckUtils]: 47: Hoare triple {8090#false} assume 0 == ~cond; {8090#false} is VALID [2022-04-15 12:18:04,134 INFO L290 TraceCheckUtils]: 48: Hoare triple {8090#false} assume !false; {8090#false} is VALID [2022-04-15 12:18:04,135 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,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:04,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801831095] [2022-04-15 12:18:04,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801831095] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:04,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120760701] [2022-04-15 12:18:04,135 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:04,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:04,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:04,136 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,137 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,188 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:18:04,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:04,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:18:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:04,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:04,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {8089#true} call ULTIMATE.init(); {8089#true} is VALID [2022-04-15 12:18:04,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {8089#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); {8089#true} is VALID [2022-04-15 12:18:04,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {8089#true} assume true; {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8089#true} {8089#true} #40#return; {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {8089#true} call #t~ret5 := main(); {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {8089#true} ~x~0 := 0; {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 28: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 30: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 31: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 32: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 35: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,464 INFO L290 TraceCheckUtils]: 40: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8240#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:18:04,469 INFO L290 TraceCheckUtils]: 42: Hoare triple {8240#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {8240#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:18:04,475 INFO L290 TraceCheckUtils]: 43: Hoare triple {8240#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {8247#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2022-04-15 12:18:04,476 INFO L290 TraceCheckUtils]: 44: Hoare triple {8247#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 268435455); {8090#false} is VALID [2022-04-15 12:18:04,477 INFO L272 TraceCheckUtils]: 45: Hoare triple {8090#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)); {8090#false} is VALID [2022-04-15 12:18:04,477 INFO L290 TraceCheckUtils]: 46: Hoare triple {8090#false} ~cond := #in~cond; {8090#false} is VALID [2022-04-15 12:18:04,477 INFO L290 TraceCheckUtils]: 47: Hoare triple {8090#false} assume 0 == ~cond; {8090#false} is VALID [2022-04-15 12:18:04,477 INFO L290 TraceCheckUtils]: 48: Hoare triple {8090#false} assume !false; {8090#false} is VALID [2022-04-15 12:18:04,477 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:04,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:04,778 INFO L290 TraceCheckUtils]: 48: Hoare triple {8090#false} assume !false; {8090#false} is VALID [2022-04-15 12:18:04,779 INFO L290 TraceCheckUtils]: 47: Hoare triple {8090#false} assume 0 == ~cond; {8090#false} is VALID [2022-04-15 12:18:04,779 INFO L290 TraceCheckUtils]: 46: Hoare triple {8090#false} ~cond := #in~cond; {8090#false} is VALID [2022-04-15 12:18:04,779 INFO L272 TraceCheckUtils]: 45: Hoare triple {8090#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)); {8090#false} is VALID [2022-04-15 12:18:04,779 INFO L290 TraceCheckUtils]: 44: Hoare triple {8275#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {8090#false} is VALID [2022-04-15 12:18:04,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {8279#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {8275#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:04,781 INFO L290 TraceCheckUtils]: 42: Hoare triple {8279#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {8279#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:04,784 INFO L290 TraceCheckUtils]: 41: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8279#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:04,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,784 INFO L290 TraceCheckUtils]: 38: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,784 INFO L290 TraceCheckUtils]: 36: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,784 INFO L290 TraceCheckUtils]: 35: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,784 INFO L290 TraceCheckUtils]: 34: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {8089#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8089#true} is VALID [2022-04-15 12:18:04,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {8089#true} assume !!(~x~0 % 4294967296 < 268435455); {8089#true} is VALID [2022-04-15 12:18:04,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {8089#true} ~x~0 := 0; {8089#true} is VALID [2022-04-15 12:18:04,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {8089#true} call #t~ret5 := main(); {8089#true} is VALID [2022-04-15 12:18:04,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8089#true} {8089#true} #40#return; {8089#true} is VALID [2022-04-15 12:18:04,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {8089#true} assume true; {8089#true} is VALID [2022-04-15 12:18:04,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {8089#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); {8089#true} is VALID [2022-04-15 12:18:04,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {8089#true} call ULTIMATE.init(); {8089#true} is VALID [2022-04-15 12:18:04,786 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:04,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120760701] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:04,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:04,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 4, 4] total 26 [2022-04-15 12:18:04,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:04,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [684603422] [2022-04-15 12:18:04,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [684603422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:04,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:04,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:18:04,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18767886] [2022-04-15 12:18:04,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:04,787 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:04,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:04,788 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:04,857 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:04,857 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:18:04,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:04,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:18:04,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:18:04,858 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,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:07,076 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 12:18:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:18:07,076 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,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:07,076 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,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 61 transitions. [2022-04-15 12:18:07,077 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,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 61 transitions. [2022-04-15 12:18:07,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 61 transitions. [2022-04-15 12:18:07,183 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,184 INFO L225 Difference]: With dead ends: 60 [2022-04-15 12:18:07,184 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 12:18:07,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=323, Invalid=1657, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:18:07,186 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:07,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 19 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:18:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 12:18:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-15 12:18:07,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:07,281 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,281 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,281 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,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:07,282 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2022-04-15 12:18:07,282 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-04-15 12:18:07,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:07,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:07,282 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,283 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,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:07,283 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2022-04-15 12:18:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-04-15 12:18:07,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:07,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:07,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:07,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:07,284 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,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-04-15 12:18:07,284 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 49 [2022-04-15 12:18:07,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:07,284 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-04-15 12:18:07,284 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,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 55 transitions. [2022-04-15 12:18:07,437 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,438 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-04-15 12:18:07,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 12:18:07,438 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:07,438 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,444 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,638 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,639 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:07,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash 659549860, now seen corresponding path program 37 times [2022-04-15 12:18:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:07,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1592171562] [2022-04-15 12:18:07,809 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:18:07,811 INFO L85 PathProgramCache]: Analyzing trace with hash -180173967, now seen corresponding path program 1 times [2022-04-15 12:18:07,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:07,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379043384] [2022-04-15 12:18:07,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:07,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:07,818 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:07,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:07,826 INFO L85 PathProgramCache]: Analyzing trace with hash 659549860, now seen corresponding path program 38 times [2022-04-15 12:18:07,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:07,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316476153] [2022-04-15 12:18:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:07,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:08,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:08,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {8806#(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); {8781#true} is VALID [2022-04-15 12:18:08,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:18:08,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8781#true} {8781#true} #40#return; {8781#true} is VALID [2022-04-15 12:18:08,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {8781#true} call ULTIMATE.init(); {8806#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:08,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {8806#(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); {8781#true} is VALID [2022-04-15 12:18:08,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:18:08,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #40#return; {8781#true} is VALID [2022-04-15 12:18:08,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret5 := main(); {8781#true} is VALID [2022-04-15 12:18:08,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {8781#true} ~x~0 := 0; {8786#(= main_~x~0 0)} is VALID [2022-04-15 12:18:08,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {8786#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {8786#(= main_~x~0 0)} is VALID [2022-04-15 12:18:08,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {8786#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8787#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:08,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {8787#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {8787#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:08,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {8787#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8788#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:08,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {8788#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {8788#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:08,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {8788#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8789#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:08,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {8789#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8789#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:08,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {8789#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8790#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:08,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {8790#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8790#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:08,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {8790#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8791#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:08,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {8791#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {8791#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:08,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {8791#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8792#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:08,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {8792#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {8792#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:08,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {8792#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8793#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:08,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {8793#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8793#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:08,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {8793#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8794#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:08,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {8794#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8794#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:08,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {8794#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8795#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:08,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {8795#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8795#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:08,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {8795#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8796#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:08,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {8796#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8796#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:08,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {8796#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8797#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:08,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {8797#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8797#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:08,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {8797#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8798#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:08,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {8798#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8798#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:08,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {8798#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8799#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:08,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {8799#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8799#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:08,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {8799#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8800#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:08,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {8800#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {8800#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:08,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {8800#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8801#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:08,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {8801#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {8801#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:08,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {8801#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8802#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:08,199 INFO L290 TraceCheckUtils]: 38: Hoare triple {8802#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8802#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:08,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {8802#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8803#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:08,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {8803#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {8803#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:08,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {8803#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:08,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {8804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:08,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {8804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8805#(and (<= main_~x~0 19) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:08,204 INFO L290 TraceCheckUtils]: 44: Hoare triple {8805#(and (<= main_~x~0 19) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {8805#(and (<= main_~x~0 19) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:08,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {8805#(and (<= main_~x~0 19) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {8782#false} is VALID [2022-04-15 12:18:08,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {8782#false} assume !(~x~0 % 4294967296 < 268435455); {8782#false} is VALID [2022-04-15 12:18:08,205 INFO L272 TraceCheckUtils]: 47: Hoare triple {8782#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)); {8782#false} is VALID [2022-04-15 12:18:08,205 INFO L290 TraceCheckUtils]: 48: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-15 12:18:08,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-15 12:18:08,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-15 12:18:08,205 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,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:08,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316476153] [2022-04-15 12:18:08,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316476153] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:08,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65744817] [2022-04-15 12:18:08,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:08,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:08,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:08,207 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,208 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,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:08,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:08,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 12:18:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:08,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:08,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {8781#true} call ULTIMATE.init(); {8781#true} is VALID [2022-04-15 12:18:08,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#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); {8781#true} is VALID [2022-04-15 12:18:08,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:18:08,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #40#return; {8781#true} is VALID [2022-04-15 12:18:08,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret5 := main(); {8781#true} is VALID [2022-04-15 12:18:08,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {8781#true} ~x~0 := 0; {8786#(= main_~x~0 0)} is VALID [2022-04-15 12:18:08,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {8786#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {8786#(= main_~x~0 0)} is VALID [2022-04-15 12:18:08,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {8786#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8787#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:08,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {8787#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {8787#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:08,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {8787#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8788#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:08,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {8788#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {8788#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:08,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {8788#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8789#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:08,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {8789#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8789#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:08,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {8789#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8790#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:08,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {8790#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8790#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:08,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {8790#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8791#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:08,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {8791#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {8791#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:08,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {8791#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8792#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:08,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {8792#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {8792#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:08,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {8792#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8793#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:08,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {8793#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8793#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:08,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {8793#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8794#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:08,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {8794#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8794#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:08,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {8794#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8795#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:08,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {8795#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8795#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:08,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {8795#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8796#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:08,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {8796#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8796#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:08,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {8796#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8797#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:08,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {8797#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8797#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:08,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {8797#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8798#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:08,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {8798#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8798#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:08,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {8798#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8799#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:08,705 INFO L290 TraceCheckUtils]: 32: Hoare triple {8799#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8799#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:08,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {8799#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8800#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:08,706 INFO L290 TraceCheckUtils]: 34: Hoare triple {8800#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {8800#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:08,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {8800#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8801#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:08,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {8801#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {8801#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:08,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {8801#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8802#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:08,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {8802#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8802#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:08,714 INFO L290 TraceCheckUtils]: 39: Hoare triple {8802#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8803#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:08,715 INFO L290 TraceCheckUtils]: 40: Hoare triple {8803#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {8803#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:08,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {8803#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:08,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {8804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {8804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:08,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {8804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8939#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:08,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {8939#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {8939#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:08,720 INFO L290 TraceCheckUtils]: 45: Hoare triple {8939#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {8946#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:08,721 INFO L290 TraceCheckUtils]: 46: Hoare triple {8946#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !(~x~0 % 4294967296 < 268435455); {8782#false} is VALID [2022-04-15 12:18:08,721 INFO L272 TraceCheckUtils]: 47: Hoare triple {8782#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)); {8782#false} is VALID [2022-04-15 12:18:08,721 INFO L290 TraceCheckUtils]: 48: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-15 12:18:08,721 INFO L290 TraceCheckUtils]: 49: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-15 12:18:08,721 INFO L290 TraceCheckUtils]: 50: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-15 12:18:08,721 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:08,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:09,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-15 12:18:09,922 INFO L290 TraceCheckUtils]: 49: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-15 12:18:09,922 INFO L290 TraceCheckUtils]: 48: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-15 12:18:09,922 INFO L272 TraceCheckUtils]: 47: Hoare triple {8782#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)); {8782#false} is VALID [2022-04-15 12:18:09,922 INFO L290 TraceCheckUtils]: 46: Hoare triple {8974#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {8782#false} is VALID [2022-04-15 12:18:09,924 INFO L290 TraceCheckUtils]: 45: Hoare triple {8978#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {8974#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,925 INFO L290 TraceCheckUtils]: 44: Hoare triple {8978#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {8978#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {8985#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8978#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {8985#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {8985#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {8992#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8985#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {8992#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {8992#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,932 INFO L290 TraceCheckUtils]: 39: Hoare triple {8999#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8992#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {8999#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {8999#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,934 INFO L290 TraceCheckUtils]: 37: Hoare triple {9006#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8999#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {9006#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9006#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,938 INFO L290 TraceCheckUtils]: 35: Hoare triple {9013#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9006#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,938 INFO L290 TraceCheckUtils]: 34: Hoare triple {9013#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9013#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,940 INFO L290 TraceCheckUtils]: 33: Hoare triple {9020#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9013#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {9020#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9020#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {9027#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9020#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {9027#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9027#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {9034#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9027#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {9034#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9034#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {9041#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9034#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {9041#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9041#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {9048#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9041#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {9048#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9048#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {9055#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9048#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {9055#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9055#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {9062#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9055#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {9062#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9062#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {9069#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9062#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {9069#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9069#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {9076#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9069#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {9076#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9076#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {9083#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9076#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {9083#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9083#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {9090#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9083#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {9090#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9090#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {9097#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9090#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {9097#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9097#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {9104#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9097#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {9104#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9104#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {9111#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9104#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {9111#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {9111#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {8781#true} ~x~0 := 0; {9111#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:18:09,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret5 := main(); {8781#true} is VALID [2022-04-15 12:18:09,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #40#return; {8781#true} is VALID [2022-04-15 12:18:09,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:18:09,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#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); {8781#true} is VALID [2022-04-15 12:18:09,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {8781#true} call ULTIMATE.init(); {8781#true} is VALID [2022-04-15 12:18:09,971 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,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65744817] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:09,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:09,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2022-04-15 12:18:09,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:09,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1592171562] [2022-04-15 12:18:09,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1592171562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:09,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:09,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:18:09,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154834267] [2022-04-15 12:18:09,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:09,972 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:09,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:09,972 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,062 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,062 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:18:10,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:10,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:18:10,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=1499, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 12:18:10,063 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,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:12,985 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-04-15 12:18:12,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:18:12,985 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,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:12,985 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,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 63 transitions. [2022-04-15 12:18:12,986 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,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 63 transitions. [2022-04-15 12:18:12,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 63 transitions. [2022-04-15 12:18:13,088 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,090 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:13,090 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 104 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 12:18:13,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 12:18:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-15 12:18:13,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:13,188 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,188 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,189 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,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:13,189 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-15 12:18:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-15 12:18:13,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:13,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:13,190 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,190 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,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:13,190 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-15 12:18:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-15 12:18:13,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:13,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:13,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:13,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:13,191 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,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-15 12:18:13,191 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 51 [2022-04-15 12:18:13,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:13,191 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-15 12:18:13,192 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,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2022-04-15 12:18:13,327 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,327 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-15 12:18:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 12:18:13,328 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:13,328 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,347 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,528 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,528 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:13,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:13,529 INFO L85 PathProgramCache]: Analyzing trace with hash 114192705, now seen corresponding path program 39 times [2022-04-15 12:18:13,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:13,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [217724548] [2022-04-15 12:18:13,672 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:18:13,673 INFO L85 PathProgramCache]: Analyzing trace with hash -121068623, now seen corresponding path program 1 times [2022-04-15 12:18:13,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:13,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955805906] [2022-04-15 12:18:13,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:13,678 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:13,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:13,682 INFO L85 PathProgramCache]: Analyzing trace with hash 114192705, now seen corresponding path program 40 times [2022-04-15 12:18:13,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:13,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567501348] [2022-04-15 12:18:13,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:13,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:14,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:14,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {9545#(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); {9519#true} is VALID [2022-04-15 12:18:14,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {9519#true} assume true; {9519#true} is VALID [2022-04-15 12:18:14,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9519#true} {9519#true} #40#return; {9519#true} is VALID [2022-04-15 12:18:14,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9545#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:14,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {9545#(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); {9519#true} is VALID [2022-04-15 12:18:14,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2022-04-15 12:18:14,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #40#return; {9519#true} is VALID [2022-04-15 12:18:14,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret5 := main(); {9519#true} is VALID [2022-04-15 12:18:14,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {9519#true} ~x~0 := 0; {9524#(= main_~x~0 0)} is VALID [2022-04-15 12:18:14,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {9524#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {9524#(= main_~x~0 0)} is VALID [2022-04-15 12:18:14,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {9524#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9525#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:14,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {9525#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {9525#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:14,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {9525#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9526#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:14,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {9526#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {9526#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:14,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {9526#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9527#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:14,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {9527#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9527#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {9527#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9528#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:14,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {9528#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9528#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {9528#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9529#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:14,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {9529#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {9529#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:14,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {9529#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9530#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:14,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {9530#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {9530#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:14,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {9530#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9531#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:14,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {9531#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9531#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:14,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {9531#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9532#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:14,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {9532#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9532#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:14,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {9532#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9533#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:14,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {9533#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9533#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:14,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {9533#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9534#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:14,080 INFO L290 TraceCheckUtils]: 26: Hoare triple {9534#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9534#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:14,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {9534#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9535#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:14,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {9535#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9535#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:14,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {9535#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9536#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:14,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {9536#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9536#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:14,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {9536#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9537#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:14,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {9537#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9537#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:14,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {9537#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9538#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:14,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {9538#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {9538#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:14,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {9538#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9539#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:14,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {9539#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {9539#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:14,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {9539#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9540#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:14,091 INFO L290 TraceCheckUtils]: 38: Hoare triple {9540#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9540#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:14,093 INFO L290 TraceCheckUtils]: 39: Hoare triple {9540#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9541#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:14,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {9541#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {9541#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:14,094 INFO L290 TraceCheckUtils]: 41: Hoare triple {9541#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9542#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:14,094 INFO L290 TraceCheckUtils]: 42: Hoare triple {9542#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9542#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:14,095 INFO L290 TraceCheckUtils]: 43: Hoare triple {9542#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9543#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:14,095 INFO L290 TraceCheckUtils]: 44: Hoare triple {9543#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {9543#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:14,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {9543#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9544#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:14,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {9544#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {9544#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:14,099 INFO L290 TraceCheckUtils]: 47: Hoare triple {9544#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {9520#false} is VALID [2022-04-15 12:18:14,099 INFO L290 TraceCheckUtils]: 48: Hoare triple {9520#false} assume !(~x~0 % 4294967296 < 268435455); {9520#false} is VALID [2022-04-15 12:18:14,099 INFO L272 TraceCheckUtils]: 49: Hoare triple {9520#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)); {9520#false} is VALID [2022-04-15 12:18:14,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {9520#false} ~cond := #in~cond; {9520#false} is VALID [2022-04-15 12:18:14,099 INFO L290 TraceCheckUtils]: 51: Hoare triple {9520#false} assume 0 == ~cond; {9520#false} is VALID [2022-04-15 12:18:14,099 INFO L290 TraceCheckUtils]: 52: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2022-04-15 12:18:14,100 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,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:14,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567501348] [2022-04-15 12:18:14,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567501348] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:14,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620475577] [2022-04-15 12:18:14,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:14,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:14,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:14,101 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,102 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,145 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:14,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:14,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 12:18:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:14,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:14,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2022-04-15 12:18:14,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {9519#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); {9519#true} is VALID [2022-04-15 12:18:14,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2022-04-15 12:18:14,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #40#return; {9519#true} is VALID [2022-04-15 12:18:14,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret5 := main(); {9519#true} is VALID [2022-04-15 12:18:14,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {9519#true} ~x~0 := 0; {9524#(= main_~x~0 0)} is VALID [2022-04-15 12:18:14,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {9524#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {9524#(= main_~x~0 0)} is VALID [2022-04-15 12:18:14,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {9524#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9525#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:14,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {9525#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {9525#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:14,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {9525#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9526#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:14,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {9526#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {9526#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:14,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {9526#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9527#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:14,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {9527#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9527#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:14,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {9527#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9528#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:14,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {9528#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9528#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:14,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {9528#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9529#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:14,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {9529#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {9529#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:14,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {9529#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9530#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:14,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {9530#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {9530#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:14,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {9530#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9531#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:14,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {9531#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9531#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:14,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {9531#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9532#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:14,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {9532#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9532#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:14,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {9532#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9533#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:14,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {9533#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9533#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:14,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {9533#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9534#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:14,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {9534#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9534#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:14,642 INFO L290 TraceCheckUtils]: 27: Hoare triple {9534#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9535#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:14,642 INFO L290 TraceCheckUtils]: 28: Hoare triple {9535#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9535#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:14,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {9535#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9536#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:14,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {9536#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9536#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:14,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {9536#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9537#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:14,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {9537#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9537#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:14,646 INFO L290 TraceCheckUtils]: 33: Hoare triple {9537#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9538#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:14,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {9538#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {9538#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:14,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {9538#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9539#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:14,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {9539#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {9539#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:14,651 INFO L290 TraceCheckUtils]: 37: Hoare triple {9539#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9540#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:14,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {9540#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9540#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:14,653 INFO L290 TraceCheckUtils]: 39: Hoare triple {9540#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9541#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:14,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {9541#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {9541#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:14,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {9541#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9542#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:14,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {9542#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9542#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:14,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {9542#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9543#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:14,656 INFO L290 TraceCheckUtils]: 44: Hoare triple {9543#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {9543#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:14,659 INFO L290 TraceCheckUtils]: 45: Hoare triple {9543#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9684#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:14,659 INFO L290 TraceCheckUtils]: 46: Hoare triple {9684#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {9684#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:14,660 INFO L290 TraceCheckUtils]: 47: Hoare triple {9684#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {9691#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:14,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {9691#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 268435455); {9691#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:14,661 INFO L272 TraceCheckUtils]: 49: Hoare triple {9691#(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)); {9698#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:14,661 INFO L290 TraceCheckUtils]: 50: Hoare triple {9698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9702#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:14,662 INFO L290 TraceCheckUtils]: 51: Hoare triple {9702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9520#false} is VALID [2022-04-15 12:18:14,662 INFO L290 TraceCheckUtils]: 52: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2022-04-15 12:18:14,662 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,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:14,880 INFO L290 TraceCheckUtils]: 52: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2022-04-15 12:18:14,881 INFO L290 TraceCheckUtils]: 51: Hoare triple {9702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9520#false} is VALID [2022-04-15 12:18:14,881 INFO L290 TraceCheckUtils]: 50: Hoare triple {9698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9702#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:14,881 INFO L272 TraceCheckUtils]: 49: Hoare triple {9718#(= (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)); {9698#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:14,882 INFO L290 TraceCheckUtils]: 48: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,882 INFO L290 TraceCheckUtils]: 47: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,883 INFO L290 TraceCheckUtils]: 46: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,887 INFO L290 TraceCheckUtils]: 45: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,887 INFO L290 TraceCheckUtils]: 44: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,890 INFO L290 TraceCheckUtils]: 41: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,894 INFO L290 TraceCheckUtils]: 37: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {9731#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9731#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:14,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {9718#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {9519#true} ~x~0 := 0; {9718#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:14,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret5 := main(); {9519#true} is VALID [2022-04-15 12:18:14,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #40#return; {9519#true} is VALID [2022-04-15 12:18:14,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2022-04-15 12:18:14,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {9519#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); {9519#true} is VALID [2022-04-15 12:18:14,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2022-04-15 12:18:14,936 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:14,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620475577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:14,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:14,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 6] total 30 [2022-04-15 12:18:14,936 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:14,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [217724548] [2022-04-15 12:18:14,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [217724548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:14,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:14,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:18:14,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363041998] [2022-04-15 12:18:14,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:14,937 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:14,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:14,937 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,029 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,029 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:18:15,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:15,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:18:15,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:18:15,030 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,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:18,486 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2022-04-15 12:18:18,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:18:18,486 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,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:18,486 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,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2022-04-15 12:18:18,487 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,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2022-04-15 12:18:18,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 65 transitions. [2022-04-15 12:18:18,673 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,674 INFO L225 Difference]: With dead ends: 64 [2022-04-15 12:18:18,674 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 12:18:18,675 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,675 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:18,675 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 49 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 12:18:18,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 12:18:18,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-15 12:18:18,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:18,776 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,777 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,777 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,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:18,777 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-15 12:18:18,777 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-15 12:18:18,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:18,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:18,778 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,778 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,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:18,778 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-15 12:18:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-15 12:18:18,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:18,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:18,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:18,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:18,779 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,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-04-15 12:18:18,779 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 53 [2022-04-15 12:18:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:18,780 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-04-15 12:18:18,780 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,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 59 transitions. [2022-04-15 12:18:18,966 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,966 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-15 12:18:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 12:18:18,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:18,967 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,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:19,179 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:19,179 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:19,180 INFO L85 PathProgramCache]: Analyzing trace with hash 11976862, now seen corresponding path program 41 times [2022-04-15 12:18:19,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:19,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1499690716] [2022-04-15 12:18:19,327 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:18:19,329 INFO L85 PathProgramCache]: Analyzing trace with hash -61963279, now seen corresponding path program 1 times [2022-04-15 12:18:19,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:19,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43785795] [2022-04-15 12:18:19,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:19,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:19,345 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:19,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:19,351 INFO L85 PathProgramCache]: Analyzing trace with hash 11976862, now seen corresponding path program 42 times [2022-04-15 12:18:19,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:19,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044991172] [2022-04-15 12:18:19,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:19,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:19,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:19,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {10294#(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); {10267#true} is VALID [2022-04-15 12:18:19,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {10267#true} assume true; {10267#true} is VALID [2022-04-15 12:18:19,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10267#true} {10267#true} #40#return; {10267#true} is VALID [2022-04-15 12:18:19,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {10267#true} call ULTIMATE.init(); {10294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:19,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {10294#(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); {10267#true} is VALID [2022-04-15 12:18:19,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {10267#true} assume true; {10267#true} is VALID [2022-04-15 12:18:19,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10267#true} {10267#true} #40#return; {10267#true} is VALID [2022-04-15 12:18:19,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {10267#true} call #t~ret5 := main(); {10267#true} is VALID [2022-04-15 12:18:19,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {10267#true} ~x~0 := 0; {10272#(= main_~x~0 0)} is VALID [2022-04-15 12:18:19,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {10272#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {10272#(= main_~x~0 0)} is VALID [2022-04-15 12:18:19,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {10272#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10273#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:19,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {10273#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {10273#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:19,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {10273#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10274#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:19,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {10274#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {10274#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:19,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {10274#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10275#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:19,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {10275#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10275#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:19,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {10275#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10276#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:19,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {10276#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10276#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:19,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {10276#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10277#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:19,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {10277#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {10277#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:19,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {10277#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10278#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:19,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {10278#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {10278#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:19,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {10278#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10279#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:19,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {10279#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10279#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:19,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {10279#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10280#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:19,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {10280#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10280#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:19,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {10280#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10281#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:19,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {10281#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10281#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:19,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {10281#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10282#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:19,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {10282#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10282#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:19,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {10282#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10283#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:19,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {10283#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10283#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:19,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {10283#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10284#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:19,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {10284#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10284#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:19,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {10284#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10285#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:19,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {10285#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10285#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:19,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {10285#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10286#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:19,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {10286#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {10286#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:19,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {10286#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10287#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:19,775 INFO L290 TraceCheckUtils]: 36: Hoare triple {10287#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {10287#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:19,777 INFO L290 TraceCheckUtils]: 37: Hoare triple {10287#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10288#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:19,777 INFO L290 TraceCheckUtils]: 38: Hoare triple {10288#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10288#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:19,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {10288#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10289#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:19,779 INFO L290 TraceCheckUtils]: 40: Hoare triple {10289#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {10289#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:19,780 INFO L290 TraceCheckUtils]: 41: Hoare triple {10289#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10290#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:19,781 INFO L290 TraceCheckUtils]: 42: Hoare triple {10290#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10290#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:19,782 INFO L290 TraceCheckUtils]: 43: Hoare triple {10290#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10291#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:19,782 INFO L290 TraceCheckUtils]: 44: Hoare triple {10291#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {10291#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:19,786 INFO L290 TraceCheckUtils]: 45: Hoare triple {10291#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10292#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:19,786 INFO L290 TraceCheckUtils]: 46: Hoare triple {10292#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {10292#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:19,788 INFO L290 TraceCheckUtils]: 47: Hoare triple {10292#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10293#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:19,788 INFO L290 TraceCheckUtils]: 48: Hoare triple {10293#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {10293#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:19,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {10293#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 21))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {10268#false} is VALID [2022-04-15 12:18:19,789 INFO L290 TraceCheckUtils]: 50: Hoare triple {10268#false} assume !(~x~0 % 4294967296 < 268435455); {10268#false} is VALID [2022-04-15 12:18:19,789 INFO L272 TraceCheckUtils]: 51: Hoare triple {10268#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)); {10268#false} is VALID [2022-04-15 12:18:19,789 INFO L290 TraceCheckUtils]: 52: Hoare triple {10268#false} ~cond := #in~cond; {10268#false} is VALID [2022-04-15 12:18:19,789 INFO L290 TraceCheckUtils]: 53: Hoare triple {10268#false} assume 0 == ~cond; {10268#false} is VALID [2022-04-15 12:18:19,789 INFO L290 TraceCheckUtils]: 54: Hoare triple {10268#false} assume !false; {10268#false} is VALID [2022-04-15 12:18:19,790 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,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:19,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044991172] [2022-04-15 12:18:19,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044991172] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:19,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999590608] [2022-04-15 12:18:19,790 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:19,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:19,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:19,791 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,792 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,847 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:18:19,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:19,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:18:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:19,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:20,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {10267#true} call ULTIMATE.init(); {10267#true} is VALID [2022-04-15 12:18:20,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {10267#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); {10267#true} is VALID [2022-04-15 12:18:20,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {10267#true} assume true; {10267#true} is VALID [2022-04-15 12:18:20,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10267#true} {10267#true} #40#return; {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {10267#true} call #t~ret5 := main(); {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {10267#true} ~x~0 := 0; {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 37: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 38: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,153 INFO L290 TraceCheckUtils]: 41: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,153 INFO L290 TraceCheckUtils]: 42: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,153 INFO L290 TraceCheckUtils]: 43: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,153 INFO L290 TraceCheckUtils]: 46: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,159 INFO L290 TraceCheckUtils]: 47: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10439#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:18:20,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {10439#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {10439#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:18:20,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {10439#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {10446#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2022-04-15 12:18:20,164 INFO L290 TraceCheckUtils]: 50: Hoare triple {10446#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 268435455); {10268#false} is VALID [2022-04-15 12:18:20,164 INFO L272 TraceCheckUtils]: 51: Hoare triple {10268#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)); {10268#false} is VALID [2022-04-15 12:18:20,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {10268#false} ~cond := #in~cond; {10268#false} is VALID [2022-04-15 12:18:20,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {10268#false} assume 0 == ~cond; {10268#false} is VALID [2022-04-15 12:18:20,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {10268#false} assume !false; {10268#false} is VALID [2022-04-15 12:18:20,164 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,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:20,490 INFO L290 TraceCheckUtils]: 54: Hoare triple {10268#false} assume !false; {10268#false} is VALID [2022-04-15 12:18:20,490 INFO L290 TraceCheckUtils]: 53: Hoare triple {10268#false} assume 0 == ~cond; {10268#false} is VALID [2022-04-15 12:18:20,490 INFO L290 TraceCheckUtils]: 52: Hoare triple {10268#false} ~cond := #in~cond; {10268#false} is VALID [2022-04-15 12:18:20,490 INFO L272 TraceCheckUtils]: 51: Hoare triple {10268#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)); {10268#false} is VALID [2022-04-15 12:18:20,491 INFO L290 TraceCheckUtils]: 50: Hoare triple {10474#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {10268#false} is VALID [2022-04-15 12:18:20,493 INFO L290 TraceCheckUtils]: 49: Hoare triple {10478#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {10474#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:20,493 INFO L290 TraceCheckUtils]: 48: Hoare triple {10478#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {10478#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 47: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10478#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 45: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 44: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 43: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 42: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 41: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {10267#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10267#true} is VALID [2022-04-15 12:18:20,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {10267#true} assume !!(~x~0 % 4294967296 < 268435455); {10267#true} is VALID [2022-04-15 12:18:20,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {10267#true} ~x~0 := 0; {10267#true} is VALID [2022-04-15 12:18:20,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {10267#true} call #t~ret5 := main(); {10267#true} is VALID [2022-04-15 12:18:20,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10267#true} {10267#true} #40#return; {10267#true} is VALID [2022-04-15 12:18:20,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {10267#true} assume true; {10267#true} is VALID [2022-04-15 12:18:20,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {10267#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); {10267#true} is VALID [2022-04-15 12:18:20,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {10267#true} call ULTIMATE.init(); {10267#true} is VALID [2022-04-15 12:18:20,502 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,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999590608] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:20,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:20,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 4, 4] total 29 [2022-04-15 12:18:20,502 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:20,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1499690716] [2022-04-15 12:18:20,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1499690716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:20,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:20,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 12:18:20,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686760236] [2022-04-15 12:18:20,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:20,503 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,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:20,503 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,665 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,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 12:18:20,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:20,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 12:18:20,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:18:20,666 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,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:24,997 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-04-15 12:18:24,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:18:24,997 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,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:24,997 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,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 67 transitions. [2022-04-15 12:18:24,998 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,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 67 transitions. [2022-04-15 12:18:24,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 67 transitions. [2022-04-15 12:18:25,272 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:25,273 INFO L225 Difference]: With dead ends: 66 [2022-04-15 12:18:25,273 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 12:18:25,274 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=374, Invalid=2176, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:18:25,274 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:25,274 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 69 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 12:18:25,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 12:18:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-15 12:18:25,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:25,399 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:25,399 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:25,399 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:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:25,399 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-15 12:18:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-15 12:18:25,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:25,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:25,400 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:25,400 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:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:25,400 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-15 12:18:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-15 12:18:25,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:25,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:25,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:25,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:25,401 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:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-04-15 12:18:25,401 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2022-04-15 12:18:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:25,402 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-04-15 12:18:25,402 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:25,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 61 transitions. [2022-04-15 12:18:25,706 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:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-15 12:18:25,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 12:18:25,707 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:25,707 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:25,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:25,911 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:25,911 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:25,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:25,911 INFO L85 PathProgramCache]: Analyzing trace with hash 566799547, now seen corresponding path program 43 times [2022-04-15 12:18:25,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:25,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1230452474] [2022-04-15 12:18:26,057 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:18:26,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2857935, now seen corresponding path program 1 times [2022-04-15 12:18:26,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:26,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524202205] [2022-04-15 12:18:26,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:26,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:26,064 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:26,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:26,068 INFO L85 PathProgramCache]: Analyzing trace with hash 566799547, now seen corresponding path program 44 times [2022-04-15 12:18:26,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:26,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874379450] [2022-04-15 12:18:26,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:26,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:26,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:26,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {11068#(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); {11040#true} is VALID [2022-04-15 12:18:26,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {11040#true} assume true; {11040#true} is VALID [2022-04-15 12:18:26,483 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11040#true} {11040#true} #40#return; {11040#true} is VALID [2022-04-15 12:18:26,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {11040#true} call ULTIMATE.init(); {11068#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:26,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {11068#(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); {11040#true} is VALID [2022-04-15 12:18:26,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {11040#true} assume true; {11040#true} is VALID [2022-04-15 12:18:26,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11040#true} {11040#true} #40#return; {11040#true} is VALID [2022-04-15 12:18:26,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {11040#true} call #t~ret5 := main(); {11040#true} is VALID [2022-04-15 12:18:26,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {11040#true} ~x~0 := 0; {11045#(= main_~x~0 0)} is VALID [2022-04-15 12:18:26,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {11045#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {11045#(= main_~x~0 0)} is VALID [2022-04-15 12:18:26,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {11045#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11046#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:26,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {11046#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {11046#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:26,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {11046#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11047#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:26,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {11047#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {11047#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:26,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {11047#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11048#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:26,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {11048#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11048#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:26,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {11048#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11049#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:26,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {11049#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11049#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:26,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {11049#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11050#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:26,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {11050#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {11050#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:26,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {11050#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11051#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:26,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {11051#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {11051#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:26,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {11051#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11052#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:26,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {11052#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11052#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:26,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {11052#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11053#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:26,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {11053#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11053#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:26,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {11053#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11054#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:26,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {11054#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11054#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:26,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {11054#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11055#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:26,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {11055#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11055#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:26,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {11055#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11056#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:26,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {11056#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11056#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:26,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {11056#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:26,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {11057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:26,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {11057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11058#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:26,540 INFO L290 TraceCheckUtils]: 32: Hoare triple {11058#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11058#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:26,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {11058#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11059#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:26,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {11059#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {11059#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:26,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {11059#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11060#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:26,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {11060#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {11060#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:26,553 INFO L290 TraceCheckUtils]: 37: Hoare triple {11060#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11061#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:26,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {11061#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11061#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:26,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {11061#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11062#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:26,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {11062#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {11062#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:26,561 INFO L290 TraceCheckUtils]: 41: Hoare triple {11062#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11063#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:26,561 INFO L290 TraceCheckUtils]: 42: Hoare triple {11063#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11063#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:26,562 INFO L290 TraceCheckUtils]: 43: Hoare triple {11063#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11064#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:26,563 INFO L290 TraceCheckUtils]: 44: Hoare triple {11064#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {11064#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:26,569 INFO L290 TraceCheckUtils]: 45: Hoare triple {11064#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11065#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:26,570 INFO L290 TraceCheckUtils]: 46: Hoare triple {11065#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11065#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:26,574 INFO L290 TraceCheckUtils]: 47: Hoare triple {11065#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11066#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:26,574 INFO L290 TraceCheckUtils]: 48: Hoare triple {11066#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {11066#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:26,579 INFO L290 TraceCheckUtils]: 49: Hoare triple {11066#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11067#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:26,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {11067#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {11067#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:26,581 INFO L290 TraceCheckUtils]: 51: Hoare triple {11067#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {11041#false} is VALID [2022-04-15 12:18:26,581 INFO L290 TraceCheckUtils]: 52: Hoare triple {11041#false} assume !(~x~0 % 4294967296 < 268435455); {11041#false} is VALID [2022-04-15 12:18:26,582 INFO L272 TraceCheckUtils]: 53: Hoare triple {11041#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)); {11041#false} is VALID [2022-04-15 12:18:26,582 INFO L290 TraceCheckUtils]: 54: Hoare triple {11041#false} ~cond := #in~cond; {11041#false} is VALID [2022-04-15 12:18:26,582 INFO L290 TraceCheckUtils]: 55: Hoare triple {11041#false} assume 0 == ~cond; {11041#false} is VALID [2022-04-15 12:18:26,582 INFO L290 TraceCheckUtils]: 56: Hoare triple {11041#false} assume !false; {11041#false} is VALID [2022-04-15 12:18:26,582 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:26,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:26,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874379450] [2022-04-15 12:18:26,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874379450] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:26,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723891735] [2022-04-15 12:18:26,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:18:26,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:26,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:26,583 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:26,584 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:26,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:18:26,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:26,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-15 12:18:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:26,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:27,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {11040#true} call ULTIMATE.init(); {11040#true} is VALID [2022-04-15 12:18:27,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {11040#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); {11040#true} is VALID [2022-04-15 12:18:27,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {11040#true} assume true; {11040#true} is VALID [2022-04-15 12:18:27,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11040#true} {11040#true} #40#return; {11040#true} is VALID [2022-04-15 12:18:27,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {11040#true} call #t~ret5 := main(); {11040#true} is VALID [2022-04-15 12:18:27,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {11040#true} ~x~0 := 0; {11045#(= main_~x~0 0)} is VALID [2022-04-15 12:18:27,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {11045#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {11045#(= main_~x~0 0)} is VALID [2022-04-15 12:18:27,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {11045#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11046#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:27,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {11046#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {11046#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:27,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {11046#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11047#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:27,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {11047#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {11047#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:27,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {11047#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11048#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:27,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {11048#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11048#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:27,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {11048#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11049#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:27,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {11049#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11049#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:27,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {11049#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11050#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:27,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {11050#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {11050#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:27,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {11050#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11051#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:27,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {11051#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {11051#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:27,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {11051#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11052#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:27,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {11052#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11052#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:27,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {11052#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11053#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:27,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {11053#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11053#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:27,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {11053#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11054#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:27,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {11054#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11054#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:27,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {11054#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11055#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:27,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {11055#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11055#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:27,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {11055#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11056#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:27,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {11056#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11056#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:27,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {11056#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:27,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {11057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:27,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {11057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11058#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:27,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {11058#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11058#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:27,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {11058#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11059#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:27,198 INFO L290 TraceCheckUtils]: 34: Hoare triple {11059#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {11059#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:27,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {11059#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11060#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:27,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {11060#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {11060#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:27,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {11060#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11061#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:27,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {11061#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11061#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:27,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {11061#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11062#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:27,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {11062#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {11062#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:27,219 INFO L290 TraceCheckUtils]: 41: Hoare triple {11062#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11063#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:27,220 INFO L290 TraceCheckUtils]: 42: Hoare triple {11063#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11063#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:27,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {11063#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11064#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:27,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {11064#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {11064#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:27,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {11064#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11065#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:27,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {11065#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11065#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:27,232 INFO L290 TraceCheckUtils]: 47: Hoare triple {11065#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11066#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:27,232 INFO L290 TraceCheckUtils]: 48: Hoare triple {11066#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {11066#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:27,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {11066#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11219#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:27,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {11219#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {11219#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:27,242 INFO L290 TraceCheckUtils]: 51: Hoare triple {11219#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {11226#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:27,243 INFO L290 TraceCheckUtils]: 52: Hoare triple {11226#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {11226#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:18:27,243 INFO L272 TraceCheckUtils]: 53: Hoare triple {11226#(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)); {11233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:27,244 INFO L290 TraceCheckUtils]: 54: Hoare triple {11233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:27,244 INFO L290 TraceCheckUtils]: 55: Hoare triple {11237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11041#false} is VALID [2022-04-15 12:18:27,244 INFO L290 TraceCheckUtils]: 56: Hoare triple {11041#false} assume !false; {11041#false} is VALID [2022-04-15 12:18:27,245 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:27,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:27,487 INFO L290 TraceCheckUtils]: 56: Hoare triple {11041#false} assume !false; {11041#false} is VALID [2022-04-15 12:18:27,488 INFO L290 TraceCheckUtils]: 55: Hoare triple {11237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11041#false} is VALID [2022-04-15 12:18:27,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {11233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:18:27,489 INFO L272 TraceCheckUtils]: 53: Hoare triple {11253#(= (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)); {11233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:18:27,489 INFO L290 TraceCheckUtils]: 52: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,490 INFO L290 TraceCheckUtils]: 51: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,490 INFO L290 TraceCheckUtils]: 50: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,496 INFO L290 TraceCheckUtils]: 49: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,496 INFO L290 TraceCheckUtils]: 48: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,497 INFO L290 TraceCheckUtils]: 47: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,498 INFO L290 TraceCheckUtils]: 46: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,504 INFO L290 TraceCheckUtils]: 44: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,527 INFO L290 TraceCheckUtils]: 32: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {11266#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11266#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:18:27,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {11253#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {11040#true} ~x~0 := 0; {11253#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:18:27,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {11040#true} call #t~ret5 := main(); {11040#true} is VALID [2022-04-15 12:18:27,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11040#true} {11040#true} #40#return; {11040#true} is VALID [2022-04-15 12:18:27,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {11040#true} assume true; {11040#true} is VALID [2022-04-15 12:18:27,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {11040#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); {11040#true} is VALID [2022-04-15 12:18:27,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {11040#true} call ULTIMATE.init(); {11040#true} is VALID [2022-04-15 12:18:27,576 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:27,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723891735] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:27,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:27,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28, 6] total 32 [2022-04-15 12:18:27,576 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:27,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1230452474] [2022-04-15 12:18:27,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1230452474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:27,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:27,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:18:27,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481996280] [2022-04-15 12:18:27,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:27,577 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:27,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:27,577 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:27,822 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:27,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:18:27,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:27,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:18:27,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:18:27,823 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:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:34,834 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-15 12:18:34,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:18:34,835 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:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:34,835 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:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 69 transitions. [2022-04-15 12:18:34,836 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:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 69 transitions. [2022-04-15 12:18:34,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 69 transitions. [2022-04-15 12:18:35,006 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:35,007 INFO L225 Difference]: With dead ends: 68 [2022-04-15 12:18:35,007 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 12:18:35,008 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:35,008 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:35,008 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 119 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 12:18:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 12:18:35,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-15 12:18:35,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:35,116 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:35,116 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:35,117 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:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:35,117 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-15 12:18:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-15 12:18:35,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:35,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:35,118 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:35,118 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:35,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:35,118 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-15 12:18:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-15 12:18:35,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:35,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:35,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:35,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:35,119 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:35,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-04-15 12:18:35,119 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 57 [2022-04-15 12:18:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:35,120 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-04-15 12:18:35,120 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:35,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 63 transitions. [2022-04-15 12:18:35,444 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:35,445 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-15 12:18:35,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 12:18:35,445 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:35,445 INFO L499 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:35,462 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:35,645 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:35,646 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:35,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:35,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1175455128, now seen corresponding path program 45 times [2022-04-15 12:18:35,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:35,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1095890686] [2022-04-15 12:18:35,851 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:18:35,852 INFO L85 PathProgramCache]: Analyzing trace with hash 56247409, now seen corresponding path program 1 times [2022-04-15 12:18:35,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:35,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895773490] [2022-04-15 12:18:35,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:35,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:35,866 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:35,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:35,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1175455128, now seen corresponding path program 46 times [2022-04-15 12:18:35,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:35,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926484304] [2022-04-15 12:18:35,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:35,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:36,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:36,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {11871#(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); {11842#true} is VALID [2022-04-15 12:18:36,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {11842#true} assume true; {11842#true} is VALID [2022-04-15 12:18:36,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11842#true} {11842#true} #40#return; {11842#true} is VALID [2022-04-15 12:18:36,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {11842#true} call ULTIMATE.init(); {11871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:36,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {11871#(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); {11842#true} is VALID [2022-04-15 12:18:36,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {11842#true} assume true; {11842#true} is VALID [2022-04-15 12:18:36,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11842#true} {11842#true} #40#return; {11842#true} is VALID [2022-04-15 12:18:36,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {11842#true} call #t~ret5 := main(); {11842#true} is VALID [2022-04-15 12:18:36,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {11842#true} ~x~0 := 0; {11847#(= main_~x~0 0)} is VALID [2022-04-15 12:18:36,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {11847#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {11847#(= main_~x~0 0)} is VALID [2022-04-15 12:18:36,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {11847#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11848#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:36,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {11848#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {11848#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:36,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {11848#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11849#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:36,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {11849#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {11849#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:36,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {11849#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11850#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:36,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {11850#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11850#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:36,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {11850#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11851#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:36,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {11851#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11851#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:36,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {11851#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11852#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:36,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {11852#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {11852#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:36,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {11852#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11853#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:36,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {11853#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {11853#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:36,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {11853#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11854#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:36,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {11854#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11854#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:36,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {11854#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11855#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:36,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {11855#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11855#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:36,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {11855#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11856#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:36,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {11856#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11856#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:36,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {11856#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11857#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:36,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {11857#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11857#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:36,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {11857#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11858#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:36,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {11858#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11858#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:36,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {11858#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11859#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:36,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {11859#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11859#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:36,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {11859#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11860#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:36,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {11860#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11860#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:36,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {11860#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11861#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:36,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {11861#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {11861#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:36,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {11861#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11862#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:36,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {11862#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {11862#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:36,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {11862#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11863#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:36,403 INFO L290 TraceCheckUtils]: 38: Hoare triple {11863#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11863#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:36,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {11863#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11864#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:36,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {11864#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {11864#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:36,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {11864#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11865#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:36,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {11865#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11865#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:36,413 INFO L290 TraceCheckUtils]: 43: Hoare triple {11865#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11866#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:36,413 INFO L290 TraceCheckUtils]: 44: Hoare triple {11866#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {11866#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:36,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {11866#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11867#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:36,420 INFO L290 TraceCheckUtils]: 46: Hoare triple {11867#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11867#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:36,426 INFO L290 TraceCheckUtils]: 47: Hoare triple {11867#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11868#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:36,426 INFO L290 TraceCheckUtils]: 48: Hoare triple {11868#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {11868#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:36,432 INFO L290 TraceCheckUtils]: 49: Hoare triple {11868#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11869#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:36,432 INFO L290 TraceCheckUtils]: 50: Hoare triple {11869#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {11869#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:36,440 INFO L290 TraceCheckUtils]: 51: Hoare triple {11869#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11870#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 23))} is VALID [2022-04-15 12:18:36,440 INFO L290 TraceCheckUtils]: 52: Hoare triple {11870#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {11870#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 23))} is VALID [2022-04-15 12:18:36,442 INFO L290 TraceCheckUtils]: 53: Hoare triple {11870#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 23))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {11843#false} is VALID [2022-04-15 12:18:36,442 INFO L290 TraceCheckUtils]: 54: Hoare triple {11843#false} assume !(~x~0 % 4294967296 < 268435455); {11843#false} is VALID [2022-04-15 12:18:36,442 INFO L272 TraceCheckUtils]: 55: Hoare triple {11843#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)); {11843#false} is VALID [2022-04-15 12:18:36,442 INFO L290 TraceCheckUtils]: 56: Hoare triple {11843#false} ~cond := #in~cond; {11843#false} is VALID [2022-04-15 12:18:36,442 INFO L290 TraceCheckUtils]: 57: Hoare triple {11843#false} assume 0 == ~cond; {11843#false} is VALID [2022-04-15 12:18:36,442 INFO L290 TraceCheckUtils]: 58: Hoare triple {11843#false} assume !false; {11843#false} is VALID [2022-04-15 12:18:36,443 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:36,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:36,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926484304] [2022-04-15 12:18:36,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926484304] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:36,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886072369] [2022-04-15 12:18:36,443 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:18:36,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:36,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:36,444 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:36,445 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:36,502 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:18:36,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:36,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-15 12:18:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:36,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:36,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {11842#true} call ULTIMATE.init(); {11842#true} is VALID [2022-04-15 12:18:36,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {11842#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); {11842#true} is VALID [2022-04-15 12:18:36,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {11842#true} assume true; {11842#true} is VALID [2022-04-15 12:18:36,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11842#true} {11842#true} #40#return; {11842#true} is VALID [2022-04-15 12:18:36,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {11842#true} call #t~ret5 := main(); {11842#true} is VALID [2022-04-15 12:18:36,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {11842#true} ~x~0 := 0; {11847#(= main_~x~0 0)} is VALID [2022-04-15 12:18:36,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {11847#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {11847#(= main_~x~0 0)} is VALID [2022-04-15 12:18:36,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {11847#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11848#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:36,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {11848#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {11848#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:36,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {11848#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11849#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:36,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {11849#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {11849#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:37,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {11849#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11850#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:37,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {11850#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11850#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:37,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {11850#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11851#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:37,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {11851#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11851#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:37,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {11851#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11852#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:37,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {11852#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {11852#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:37,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {11852#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11853#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:37,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {11853#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {11853#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:37,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {11853#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11854#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:37,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {11854#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11854#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:37,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {11854#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11855#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:37,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {11855#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11855#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:37,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {11855#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11856#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:37,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {11856#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11856#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:37,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {11856#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11857#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:37,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {11857#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11857#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:37,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {11857#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11858#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:37,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {11858#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11858#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:37,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {11858#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11859#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:37,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {11859#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11859#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:37,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {11859#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11860#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:37,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {11860#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11860#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:37,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {11860#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11861#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:37,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {11861#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {11861#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:37,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {11861#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11862#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:37,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {11862#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {11862#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:37,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {11862#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11863#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:37,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {11863#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11863#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:37,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {11863#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11864#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:37,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {11864#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {11864#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:37,085 INFO L290 TraceCheckUtils]: 41: Hoare triple {11864#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11865#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:37,086 INFO L290 TraceCheckUtils]: 42: Hoare triple {11865#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11865#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:37,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {11865#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11866#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:37,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {11866#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {11866#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:37,093 INFO L290 TraceCheckUtils]: 45: Hoare triple {11866#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11867#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:37,094 INFO L290 TraceCheckUtils]: 46: Hoare triple {11867#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {11867#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:37,101 INFO L290 TraceCheckUtils]: 47: Hoare triple {11867#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11868#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:37,101 INFO L290 TraceCheckUtils]: 48: Hoare triple {11868#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {11868#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:37,107 INFO L290 TraceCheckUtils]: 49: Hoare triple {11868#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11869#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:37,107 INFO L290 TraceCheckUtils]: 50: Hoare triple {11869#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {11869#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:37,113 INFO L290 TraceCheckUtils]: 51: Hoare triple {11869#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12028#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:18:37,113 INFO L290 TraceCheckUtils]: 52: Hoare triple {12028#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {12028#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:18:37,115 INFO L290 TraceCheckUtils]: 53: Hoare triple {12028#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {12035#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:18:37,116 INFO L290 TraceCheckUtils]: 54: Hoare triple {12035#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {11843#false} is VALID [2022-04-15 12:18:37,116 INFO L272 TraceCheckUtils]: 55: Hoare triple {11843#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)); {11843#false} is VALID [2022-04-15 12:18:37,117 INFO L290 TraceCheckUtils]: 56: Hoare triple {11843#false} ~cond := #in~cond; {11843#false} is VALID [2022-04-15 12:18:37,117 INFO L290 TraceCheckUtils]: 57: Hoare triple {11843#false} assume 0 == ~cond; {11843#false} is VALID [2022-04-15 12:18:37,117 INFO L290 TraceCheckUtils]: 58: Hoare triple {11843#false} assume !false; {11843#false} is VALID [2022-04-15 12:18:37,117 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:37,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:39,131 INFO L290 TraceCheckUtils]: 58: Hoare triple {11843#false} assume !false; {11843#false} is VALID [2022-04-15 12:18:39,131 INFO L290 TraceCheckUtils]: 57: Hoare triple {11843#false} assume 0 == ~cond; {11843#false} is VALID [2022-04-15 12:18:39,131 INFO L290 TraceCheckUtils]: 56: Hoare triple {11843#false} ~cond := #in~cond; {11843#false} is VALID [2022-04-15 12:18:39,131 INFO L272 TraceCheckUtils]: 55: Hoare triple {11843#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)); {11843#false} is VALID [2022-04-15 12:18:39,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {12063#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {11843#false} is VALID [2022-04-15 12:18:39,138 INFO L290 TraceCheckUtils]: 53: Hoare triple {12067#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {12063#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,139 INFO L290 TraceCheckUtils]: 52: Hoare triple {12067#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12067#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,159 INFO L290 TraceCheckUtils]: 51: Hoare triple {12074#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12067#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,160 INFO L290 TraceCheckUtils]: 50: Hoare triple {12074#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12074#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,169 INFO L290 TraceCheckUtils]: 49: Hoare triple {12081#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12074#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,170 INFO L290 TraceCheckUtils]: 48: Hoare triple {12081#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12081#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,172 INFO L290 TraceCheckUtils]: 47: Hoare triple {12088#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12081#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,172 INFO L290 TraceCheckUtils]: 46: Hoare triple {12088#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12088#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {12095#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12088#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,174 INFO L290 TraceCheckUtils]: 44: Hoare triple {12095#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12095#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,184 INFO L290 TraceCheckUtils]: 43: Hoare triple {12102#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12095#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,184 INFO L290 TraceCheckUtils]: 42: Hoare triple {12102#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12102#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,193 INFO L290 TraceCheckUtils]: 41: Hoare triple {12109#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12102#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,194 INFO L290 TraceCheckUtils]: 40: Hoare triple {12109#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12109#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,201 INFO L290 TraceCheckUtils]: 39: Hoare triple {12116#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12109#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,201 INFO L290 TraceCheckUtils]: 38: Hoare triple {12116#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12116#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {12123#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12116#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {12123#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12123#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,218 INFO L290 TraceCheckUtils]: 35: Hoare triple {12130#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12123#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {12130#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12130#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {12137#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12130#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {12137#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12137#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,229 INFO L290 TraceCheckUtils]: 31: Hoare triple {12144#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12137#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {12144#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12144#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {12151#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12144#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {12151#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12151#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {12158#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12151#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {12158#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12158#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {12165#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12158#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {12165#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12165#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {12172#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12165#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {12172#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12172#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {12179#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12172#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {12179#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12179#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {12186#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12179#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {12186#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12186#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {12193#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12186#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {12193#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12193#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {12200#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12193#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {12200#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12200#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {12207#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12200#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {12207#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12207#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {12214#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12207#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {12214#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12214#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {12221#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12214#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {12221#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12221#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {12228#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12221#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {12228#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12228#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {11842#true} ~x~0 := 0; {12228#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} is VALID [2022-04-15 12:18:39,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {11842#true} call #t~ret5 := main(); {11842#true} is VALID [2022-04-15 12:18:39,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11842#true} {11842#true} #40#return; {11842#true} is VALID [2022-04-15 12:18:39,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {11842#true} assume true; {11842#true} is VALID [2022-04-15 12:18:39,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {11842#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); {11842#true} is VALID [2022-04-15 12:18:39,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {11842#true} call ULTIMATE.init(); {11842#true} is VALID [2022-04-15 12:18:39,300 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:39,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886072369] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:39,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:39,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2022-04-15 12:18:39,300 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:39,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1095890686] [2022-04-15 12:18:39,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1095890686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:39,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:39,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 12:18:39,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085148186] [2022-04-15 12:18:39,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:39,301 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:39,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:39,301 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:39,599 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:39,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 12:18:39,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:39,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 12:18:39,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=779, Invalid=2083, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 12:18:39,600 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:50,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:50,710 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2022-04-15 12:18:50,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:18:50,710 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:50,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:50,710 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:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 71 transitions. [2022-04-15 12:18:50,711 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:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 71 transitions. [2022-04-15 12:18:50,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 71 transitions. [2022-04-15 12:18:50,983 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:50,984 INFO L225 Difference]: With dead ends: 70 [2022-04-15 12:18:50,984 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 12:18:50,985 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:50,985 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:50,986 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 94 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 12:18:50,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 12:18:51,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-15 12:18:51,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:51,100 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:51,101 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:51,101 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:51,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:51,101 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-15 12:18:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-15 12:18:51,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:51,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:51,102 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:51,102 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:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:51,102 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-15 12:18:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-15 12:18:51,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:51,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:51,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:51,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:51,103 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:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-04-15 12:18:51,103 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 59 [2022-04-15 12:18:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:51,104 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-04-15 12:18:51,104 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:51,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 65 transitions. [2022-04-15 12:18:51,432 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:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-15 12:18:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 12:18:51,432 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:51,432 INFO L499 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:51,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 12:18:51,647 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:51,647 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:51,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1977916213, now seen corresponding path program 47 times [2022-04-15 12:18:51,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:51,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [467568535] [2022-04-15 12:18:51,843 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:18:51,845 INFO L85 PathProgramCache]: Analyzing trace with hash 115352753, now seen corresponding path program 1 times [2022-04-15 12:18:51,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:51,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831660329] [2022-04-15 12:18:51,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:51,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:51,852 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:18:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:18:51,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:18:51,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1977916213, now seen corresponding path program 48 times [2022-04-15 12:18:51,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:51,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439016961] [2022-04-15 12:18:51,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:51,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:52,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:52,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {12722#(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); {12692#true} is VALID [2022-04-15 12:18:52,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {12692#true} assume true; {12692#true} is VALID [2022-04-15 12:18:52,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12692#true} {12692#true} #40#return; {12692#true} is VALID [2022-04-15 12:18:52,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {12692#true} call ULTIMATE.init(); {12722#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:52,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {12722#(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); {12692#true} is VALID [2022-04-15 12:18:52,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {12692#true} assume true; {12692#true} is VALID [2022-04-15 12:18:52,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12692#true} {12692#true} #40#return; {12692#true} is VALID [2022-04-15 12:18:52,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {12692#true} call #t~ret5 := main(); {12692#true} is VALID [2022-04-15 12:18:52,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {12692#true} ~x~0 := 0; {12697#(= main_~x~0 0)} is VALID [2022-04-15 12:18:52,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {12697#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {12697#(= main_~x~0 0)} is VALID [2022-04-15 12:18:52,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {12697#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12698#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:52,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {12698#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {12698#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:18:52,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {12698#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12699#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:52,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {12699#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {12699#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:18:52,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {12699#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12700#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:52,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {12700#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12700#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:18:52,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {12700#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12701#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:52,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {12701#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12701#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:18:52,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {12701#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12702#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:52,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {12702#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {12702#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:18:52,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {12702#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12703#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:52,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {12703#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {12703#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:18:52,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {12703#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12704#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:52,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {12704#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12704#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:18:52,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {12704#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12705#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:52,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {12705#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12705#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:18:52,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {12705#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12706#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:52,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {12706#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12706#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:18:52,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {12706#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12707#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:52,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {12707#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12707#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:18:52,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {12707#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12708#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:52,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {12708#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12708#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:18:52,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {12708#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12709#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:52,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {12709#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12709#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:18:52,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {12709#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12710#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:52,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {12710#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12710#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:18:52,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {12710#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12711#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:52,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {12711#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {12711#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:18:52,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {12711#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12712#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:52,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {12712#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {12712#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:18:52,436 INFO L290 TraceCheckUtils]: 37: Hoare triple {12712#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12713#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:52,436 INFO L290 TraceCheckUtils]: 38: Hoare triple {12713#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12713#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:18:52,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {12713#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12714#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:52,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {12714#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {12714#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:18:52,443 INFO L290 TraceCheckUtils]: 41: Hoare triple {12714#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12715#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:52,443 INFO L290 TraceCheckUtils]: 42: Hoare triple {12715#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12715#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:18:52,444 INFO L290 TraceCheckUtils]: 43: Hoare triple {12715#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12716#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:52,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {12716#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {12716#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:18:52,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {12716#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12717#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:52,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {12717#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {12717#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:18:52,459 INFO L290 TraceCheckUtils]: 47: Hoare triple {12717#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12718#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:52,460 INFO L290 TraceCheckUtils]: 48: Hoare triple {12718#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {12718#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:18:52,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {12718#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12719#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:52,469 INFO L290 TraceCheckUtils]: 50: Hoare triple {12719#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {12719#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:18:52,476 INFO L290 TraceCheckUtils]: 51: Hoare triple {12719#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12720#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:18:52,476 INFO L290 TraceCheckUtils]: 52: Hoare triple {12720#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {12720#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:18:52,481 INFO L290 TraceCheckUtils]: 53: Hoare triple {12720#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12721#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:52,482 INFO L290 TraceCheckUtils]: 54: Hoare triple {12721#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {12721#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:52,483 INFO L290 TraceCheckUtils]: 55: Hoare triple {12721#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {12693#false} is VALID [2022-04-15 12:18:52,483 INFO L290 TraceCheckUtils]: 56: Hoare triple {12693#false} assume !(~x~0 % 4294967296 < 268435455); {12693#false} is VALID [2022-04-15 12:18:52,483 INFO L272 TraceCheckUtils]: 57: Hoare triple {12693#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)); {12693#false} is VALID [2022-04-15 12:18:52,484 INFO L290 TraceCheckUtils]: 58: Hoare triple {12693#false} ~cond := #in~cond; {12693#false} is VALID [2022-04-15 12:18:52,484 INFO L290 TraceCheckUtils]: 59: Hoare triple {12693#false} assume 0 == ~cond; {12693#false} is VALID [2022-04-15 12:18:52,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {12693#false} assume !false; {12693#false} is VALID [2022-04-15 12:18:52,484 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:52,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:52,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439016961] [2022-04-15 12:18:52,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439016961] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:18:52,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513427114] [2022-04-15 12:18:52,484 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:18:52,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:18:52,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:52,485 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:52,486 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:52,531 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:18:52,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:18:52,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:18:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:52,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:18:52,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {12692#true} call ULTIMATE.init(); {12692#true} is VALID [2022-04-15 12:18:52,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {12692#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); {12692#true} is VALID [2022-04-15 12:18:52,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {12692#true} assume true; {12692#true} is VALID [2022-04-15 12:18:52,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12692#true} {12692#true} #40#return; {12692#true} is VALID [2022-04-15 12:18:52,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {12692#true} call #t~ret5 := main(); {12692#true} is VALID [2022-04-15 12:18:52,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {12692#true} ~x~0 := 0; {12692#true} is VALID [2022-04-15 12:18:52,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 34: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 35: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 36: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 40: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 41: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 42: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 43: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 44: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 45: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 46: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,880 INFO L290 TraceCheckUtils]: 47: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,881 INFO L290 TraceCheckUtils]: 50: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,881 INFO L290 TraceCheckUtils]: 51: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:52,881 INFO L290 TraceCheckUtils]: 52: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:52,892 INFO L290 TraceCheckUtils]: 53: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12885#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:18:52,892 INFO L290 TraceCheckUtils]: 54: Hoare triple {12885#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {12885#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:18:52,896 INFO L290 TraceCheckUtils]: 55: Hoare triple {12885#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {12892#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2022-04-15 12:18:52,899 INFO L290 TraceCheckUtils]: 56: Hoare triple {12892#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 268435455); {12693#false} is VALID [2022-04-15 12:18:52,899 INFO L272 TraceCheckUtils]: 57: Hoare triple {12693#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)); {12693#false} is VALID [2022-04-15 12:18:52,899 INFO L290 TraceCheckUtils]: 58: Hoare triple {12693#false} ~cond := #in~cond; {12693#false} is VALID [2022-04-15 12:18:52,899 INFO L290 TraceCheckUtils]: 59: Hoare triple {12693#false} assume 0 == ~cond; {12693#false} is VALID [2022-04-15 12:18:52,899 INFO L290 TraceCheckUtils]: 60: Hoare triple {12693#false} assume !false; {12693#false} is VALID [2022-04-15 12:18:52,899 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:52,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:18:53,324 INFO L290 TraceCheckUtils]: 60: Hoare triple {12693#false} assume !false; {12693#false} is VALID [2022-04-15 12:18:53,324 INFO L290 TraceCheckUtils]: 59: Hoare triple {12693#false} assume 0 == ~cond; {12693#false} is VALID [2022-04-15 12:18:53,324 INFO L290 TraceCheckUtils]: 58: Hoare triple {12693#false} ~cond := #in~cond; {12693#false} is VALID [2022-04-15 12:18:53,324 INFO L272 TraceCheckUtils]: 57: Hoare triple {12693#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)); {12693#false} is VALID [2022-04-15 12:18:53,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {12920#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {12693#false} is VALID [2022-04-15 12:18:53,327 INFO L290 TraceCheckUtils]: 55: Hoare triple {12924#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {12920#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:18:53,327 INFO L290 TraceCheckUtils]: 54: Hoare triple {12924#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {12924#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:53,337 INFO L290 TraceCheckUtils]: 53: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12924#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:18:53,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,337 INFO L290 TraceCheckUtils]: 51: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,337 INFO L290 TraceCheckUtils]: 50: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,337 INFO L290 TraceCheckUtils]: 49: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,337 INFO L290 TraceCheckUtils]: 47: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 46: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 37: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 36: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 32: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {12692#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12692#true} is VALID [2022-04-15 12:18:53,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {12692#true} assume !!(~x~0 % 4294967296 < 268435455); {12692#true} is VALID [2022-04-15 12:18:53,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {12692#true} ~x~0 := 0; {12692#true} is VALID [2022-04-15 12:18:53,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {12692#true} call #t~ret5 := main(); {12692#true} is VALID [2022-04-15 12:18:53,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12692#true} {12692#true} #40#return; {12692#true} is VALID [2022-04-15 12:18:53,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {12692#true} assume true; {12692#true} is VALID [2022-04-15 12:18:53,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {12692#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); {12692#true} is VALID [2022-04-15 12:18:53,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {12692#true} call ULTIMATE.init(); {12692#true} is VALID [2022-04-15 12:18:53,340 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:53,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513427114] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:18:53,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:18:53,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 4, 4] total 32 [2022-04-15 12:18:53,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:53,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [467568535] [2022-04-15 12:18:53,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [467568535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:53,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:53,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:18:53,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073460803] [2022-04-15 12:18:53,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:53,341 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:53,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:53,342 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:53,662 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:53,662 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:18:53,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:53,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:18:53,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:18:53,663 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:19:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:06,595 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-04-15 12:19:06,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:19:06,595 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:19:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:06,595 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:19:06,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 73 transitions. [2022-04-15 12:19:06,596 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:19:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 73 transitions. [2022-04-15 12:19:06,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 73 transitions. [2022-04-15 12:19:07,030 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:07,031 INFO L225 Difference]: With dead ends: 72 [2022-04-15 12:19:07,031 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 12:19:07,032 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=425, Invalid=2767, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 12:19:07,032 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:07,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 94 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-15 12:19:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 12:19:07,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 12:19:07,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:07,152 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:19:07,152 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:19:07,152 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:19:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:07,153 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2022-04-15 12:19:07,153 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-15 12:19:07,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:07,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:07,153 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:19:07,153 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:19:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:07,154 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2022-04-15 12:19:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-15 12:19:07,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:07,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:07,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:07,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:07,154 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:19:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2022-04-15 12:19:07,155 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 61 [2022-04-15 12:19:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:07,155 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2022-04-15 12:19:07,155 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:19:07,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 67 transitions. [2022-04-15 12:19:07,473 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:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-15 12:19:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 12:19:07,473 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:07,474 INFO L499 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:07,493 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:19:07,687 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:19:07,687 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:07,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:07,688 INFO L85 PathProgramCache]: Analyzing trace with hash 48905618, now seen corresponding path program 49 times [2022-04-15 12:19:07,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:07,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1432874709] [2022-04-15 12:19:07,852 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:19:07,853 INFO L85 PathProgramCache]: Analyzing trace with hash 174458097, now seen corresponding path program 1 times [2022-04-15 12:19:07,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:07,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531258329] [2022-04-15 12:19:07,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:07,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:07,859 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:19:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:07,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:19:07,864 INFO L85 PathProgramCache]: Analyzing trace with hash 48905618, now seen corresponding path program 50 times [2022-04-15 12:19:07,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:07,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761832053] [2022-04-15 12:19:07,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:07,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:08,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:08,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {13577#(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); {13546#true} is VALID [2022-04-15 12:19:08,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 12:19:08,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13546#true} {13546#true} #40#return; {13546#true} is VALID [2022-04-15 12:19:08,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {13546#true} call ULTIMATE.init(); {13577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:08,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {13577#(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); {13546#true} is VALID [2022-04-15 12:19:08,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 12:19:08,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13546#true} {13546#true} #40#return; {13546#true} is VALID [2022-04-15 12:19:08,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {13546#true} call #t~ret5 := main(); {13546#true} is VALID [2022-04-15 12:19:08,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {13546#true} ~x~0 := 0; {13551#(= main_~x~0 0)} is VALID [2022-04-15 12:19:08,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {13551#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {13551#(= main_~x~0 0)} is VALID [2022-04-15 12:19:08,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {13551#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13552#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:08,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {13552#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {13552#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:08,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {13552#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13553#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:08,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {13553#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {13553#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:08,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {13553#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13554#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:08,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {13554#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13554#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:08,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {13554#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13555#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:08,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {13555#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13555#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:08,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {13555#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13556#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:08,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {13556#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {13556#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:08,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {13556#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13557#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:08,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {13557#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {13557#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:08,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {13557#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13558#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:08,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {13558#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13558#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:08,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {13558#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13559#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:08,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {13559#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13559#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:08,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {13559#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13560#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:08,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {13560#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13560#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:08,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {13560#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13561#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:08,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {13561#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13561#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:08,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {13561#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13562#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:08,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {13562#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13562#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:08,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {13562#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13563#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:08,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {13563#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13563#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:08,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {13563#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13564#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:08,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {13564#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13564#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:08,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {13564#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13565#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:08,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {13565#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {13565#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:08,489 INFO L290 TraceCheckUtils]: 35: Hoare triple {13565#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13566#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:08,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {13566#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {13566#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:08,501 INFO L290 TraceCheckUtils]: 37: Hoare triple {13566#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13567#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:08,502 INFO L290 TraceCheckUtils]: 38: Hoare triple {13567#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13567#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:08,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {13567#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13568#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:08,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {13568#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {13568#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:08,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {13568#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:08,515 INFO L290 TraceCheckUtils]: 42: Hoare triple {13569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:08,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {13569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13570#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:08,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {13570#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {13570#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:08,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {13570#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13571#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:08,528 INFO L290 TraceCheckUtils]: 46: Hoare triple {13571#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13571#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:08,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {13571#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13572#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:08,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {13572#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {13572#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:08,549 INFO L290 TraceCheckUtils]: 49: Hoare triple {13572#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13573#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:08,550 INFO L290 TraceCheckUtils]: 50: Hoare triple {13573#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {13573#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:08,559 INFO L290 TraceCheckUtils]: 51: Hoare triple {13573#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13574#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:08,560 INFO L290 TraceCheckUtils]: 52: Hoare triple {13574#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {13574#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:08,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {13574#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13575#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:08,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {13575#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13575#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:08,579 INFO L290 TraceCheckUtils]: 55: Hoare triple {13575#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13576#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} is VALID [2022-04-15 12:19:08,579 INFO L290 TraceCheckUtils]: 56: Hoare triple {13576#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} assume !!(~x~0 % 4294967296 < 268435455); {13576#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} is VALID [2022-04-15 12:19:08,582 INFO L290 TraceCheckUtils]: 57: Hoare triple {13576#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {13547#false} is VALID [2022-04-15 12:19:08,582 INFO L290 TraceCheckUtils]: 58: Hoare triple {13547#false} assume !(~x~0 % 4294967296 < 268435455); {13547#false} is VALID [2022-04-15 12:19:08,582 INFO L272 TraceCheckUtils]: 59: Hoare triple {13547#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)); {13547#false} is VALID [2022-04-15 12:19:08,582 INFO L290 TraceCheckUtils]: 60: Hoare triple {13547#false} ~cond := #in~cond; {13547#false} is VALID [2022-04-15 12:19:08,582 INFO L290 TraceCheckUtils]: 61: Hoare triple {13547#false} assume 0 == ~cond; {13547#false} is VALID [2022-04-15 12:19:08,582 INFO L290 TraceCheckUtils]: 62: Hoare triple {13547#false} assume !false; {13547#false} is VALID [2022-04-15 12:19:08,583 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:19:08,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:08,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761832053] [2022-04-15 12:19:08,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761832053] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:08,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609773123] [2022-04-15 12:19:08,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:19:08,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:08,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:08,584 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:19:08,585 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:19:08,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:19:08,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:08,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-15 12:19:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:08,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:09,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {13546#true} call ULTIMATE.init(); {13546#true} is VALID [2022-04-15 12:19:09,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {13546#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); {13546#true} is VALID [2022-04-15 12:19:09,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 12:19:09,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13546#true} {13546#true} #40#return; {13546#true} is VALID [2022-04-15 12:19:09,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {13546#true} call #t~ret5 := main(); {13546#true} is VALID [2022-04-15 12:19:09,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {13546#true} ~x~0 := 0; {13551#(= main_~x~0 0)} is VALID [2022-04-15 12:19:09,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {13551#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {13551#(= main_~x~0 0)} is VALID [2022-04-15 12:19:09,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {13551#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13552#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:09,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {13552#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {13552#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:09,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {13552#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13553#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:09,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {13553#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {13553#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:09,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {13553#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13554#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:09,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {13554#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13554#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:09,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {13554#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13555#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:09,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {13555#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13555#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:09,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {13555#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13556#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:09,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {13556#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {13556#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:09,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {13556#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13557#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:09,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {13557#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {13557#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:09,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {13557#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13558#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:09,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {13558#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13558#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:09,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {13558#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13559#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:09,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {13559#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13559#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:09,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {13559#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13560#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:09,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {13560#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13560#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:09,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {13560#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13561#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:09,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {13561#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13561#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:09,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {13561#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13562#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:09,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {13562#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13562#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:09,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {13562#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13563#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:09,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {13563#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13563#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:09,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {13563#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13564#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:09,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {13564#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13564#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:09,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {13564#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13565#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:09,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {13565#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {13565#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:09,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {13565#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13566#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:09,282 INFO L290 TraceCheckUtils]: 36: Hoare triple {13566#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {13566#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:09,287 INFO L290 TraceCheckUtils]: 37: Hoare triple {13566#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13567#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:09,287 INFO L290 TraceCheckUtils]: 38: Hoare triple {13567#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13567#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:09,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {13567#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13568#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:09,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {13568#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {13568#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:09,294 INFO L290 TraceCheckUtils]: 41: Hoare triple {13568#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:09,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {13569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:09,296 INFO L290 TraceCheckUtils]: 43: Hoare triple {13569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13570#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:09,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {13570#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {13570#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:09,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {13570#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13571#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:09,303 INFO L290 TraceCheckUtils]: 46: Hoare triple {13571#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13571#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:09,308 INFO L290 TraceCheckUtils]: 47: Hoare triple {13571#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13572#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:09,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {13572#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {13572#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:09,315 INFO L290 TraceCheckUtils]: 49: Hoare triple {13572#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13573#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:09,316 INFO L290 TraceCheckUtils]: 50: Hoare triple {13573#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {13573#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:09,321 INFO L290 TraceCheckUtils]: 51: Hoare triple {13573#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13574#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:09,321 INFO L290 TraceCheckUtils]: 52: Hoare triple {13574#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {13574#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:09,327 INFO L290 TraceCheckUtils]: 53: Hoare triple {13574#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13575#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:09,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {13575#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13575#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:09,334 INFO L290 TraceCheckUtils]: 55: Hoare triple {13575#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13746#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:09,334 INFO L290 TraceCheckUtils]: 56: Hoare triple {13746#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {13746#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:09,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {13746#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {13753#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:19:09,337 INFO L290 TraceCheckUtils]: 58: Hoare triple {13753#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !(~x~0 % 4294967296 < 268435455); {13547#false} is VALID [2022-04-15 12:19:09,337 INFO L272 TraceCheckUtils]: 59: Hoare triple {13547#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)); {13547#false} is VALID [2022-04-15 12:19:09,337 INFO L290 TraceCheckUtils]: 60: Hoare triple {13547#false} ~cond := #in~cond; {13547#false} is VALID [2022-04-15 12:19:09,337 INFO L290 TraceCheckUtils]: 61: Hoare triple {13547#false} assume 0 == ~cond; {13547#false} is VALID [2022-04-15 12:19:09,337 INFO L290 TraceCheckUtils]: 62: Hoare triple {13547#false} assume !false; {13547#false} is VALID [2022-04-15 12:19:09,338 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:19:09,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:11,983 INFO L290 TraceCheckUtils]: 62: Hoare triple {13547#false} assume !false; {13547#false} is VALID [2022-04-15 12:19:11,983 INFO L290 TraceCheckUtils]: 61: Hoare triple {13547#false} assume 0 == ~cond; {13547#false} is VALID [2022-04-15 12:19:11,983 INFO L290 TraceCheckUtils]: 60: Hoare triple {13547#false} ~cond := #in~cond; {13547#false} is VALID [2022-04-15 12:19:11,983 INFO L272 TraceCheckUtils]: 59: Hoare triple {13547#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)); {13547#false} is VALID [2022-04-15 12:19:11,984 INFO L290 TraceCheckUtils]: 58: Hoare triple {13781#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {13547#false} is VALID [2022-04-15 12:19:11,986 INFO L290 TraceCheckUtils]: 57: Hoare triple {13785#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {13781#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:19:11,987 INFO L290 TraceCheckUtils]: 56: Hoare triple {13785#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13785#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:19:11,996 INFO L290 TraceCheckUtils]: 55: Hoare triple {13792#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13785#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:19:11,996 INFO L290 TraceCheckUtils]: 54: Hoare triple {13792#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13792#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,006 INFO L290 TraceCheckUtils]: 53: Hoare triple {13799#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13792#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {13799#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13799#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,009 INFO L290 TraceCheckUtils]: 51: Hoare triple {13806#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13799#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,009 INFO L290 TraceCheckUtils]: 50: Hoare triple {13806#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13806#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {13813#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13806#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,011 INFO L290 TraceCheckUtils]: 48: Hoare triple {13813#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13813#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,020 INFO L290 TraceCheckUtils]: 47: Hoare triple {13820#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13813#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,020 INFO L290 TraceCheckUtils]: 46: Hoare triple {13820#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13820#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,028 INFO L290 TraceCheckUtils]: 45: Hoare triple {13827#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13820#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,028 INFO L290 TraceCheckUtils]: 44: Hoare triple {13827#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13827#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {13834#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13827#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {13834#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13834#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {13841#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13834#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {13841#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13841#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,062 INFO L290 TraceCheckUtils]: 39: Hoare triple {13848#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13841#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {13848#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13848#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,065 INFO L290 TraceCheckUtils]: 37: Hoare triple {13855#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13848#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {13855#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13855#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,076 INFO L290 TraceCheckUtils]: 35: Hoare triple {13862#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13855#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {13862#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13862#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {13869#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13862#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {13869#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13869#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {13876#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13869#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {13876#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13876#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {13883#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13876#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {13883#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13883#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {13890#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13883#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {13890#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13890#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {13897#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13890#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {13897#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13897#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {13904#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13897#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {13904#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13904#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {13911#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13904#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {13911#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13911#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {13918#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13911#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {13918#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13918#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {13925#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13918#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {13925#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13925#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {13932#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13925#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {13932#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13932#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {13939#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13932#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {13939#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13939#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {13946#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13939#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {13946#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13946#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {13953#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13946#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {13953#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13953#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {13960#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13953#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {13960#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {13960#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {13546#true} ~x~0 := 0; {13960#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} is VALID [2022-04-15 12:19:12,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {13546#true} call #t~ret5 := main(); {13546#true} is VALID [2022-04-15 12:19:12,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13546#true} {13546#true} #40#return; {13546#true} is VALID [2022-04-15 12:19:12,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-15 12:19:12,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {13546#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); {13546#true} is VALID [2022-04-15 12:19:12,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {13546#true} call ULTIMATE.init(); {13546#true} is VALID [2022-04-15 12:19:12,167 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:19:12,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609773123] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:12,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:12,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2022-04-15 12:19:12,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:12,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1432874709] [2022-04-15 12:19:12,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1432874709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:12,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:12,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 12:19:12,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732394803] [2022-04-15 12:19:12,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:12,168 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:12,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:12,169 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:19:12,456 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:19:12,456 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 12:19:12,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:12,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 12:19:12,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=895, Invalid=2411, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 12:19:12,457 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:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:22,970 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2022-04-15 12:19:22,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:19:22,970 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:22,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:22,971 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:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 75 transitions. [2022-04-15 12:19:22,971 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:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 75 transitions. [2022-04-15 12:19:22,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 75 transitions. [2022-04-15 12:19:23,255 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:23,256 INFO L225 Difference]: With dead ends: 74 [2022-04-15 12:19:23,256 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 12:19:23,257 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:23,258 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:23,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 49 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-15 12:19:23,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 12:19:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-15 12:19:23,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:23,381 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:23,381 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:23,382 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:23,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:23,382 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2022-04-15 12:19:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-15 12:19:23,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:23,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:23,383 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:23,383 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:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:23,383 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2022-04-15 12:19:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-15 12:19:23,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:23,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:23,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:23,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:23,384 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:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2022-04-15 12:19:23,384 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 63 [2022-04-15 12:19:23,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:23,385 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2022-04-15 12:19:23,385 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:23,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 69 transitions. [2022-04-15 12:19:23,729 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:23,729 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-15 12:19:23,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 12:19:23,729 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:23,729 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:23,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-15 12:19:23,930 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:23,931 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:23,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:23,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1695595695, now seen corresponding path program 51 times [2022-04-15 12:19:23,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:23,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [136803586] [2022-04-15 12:19:24,095 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:19:24,097 INFO L85 PathProgramCache]: Analyzing trace with hash 233563441, now seen corresponding path program 1 times [2022-04-15 12:19:24,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:24,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799713126] [2022-04-15 12:19:24,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:24,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:24,103 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:19:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:24,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:19:24,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1695595695, now seen corresponding path program 52 times [2022-04-15 12:19:24,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:24,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360560024] [2022-04-15 12:19:24,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:24,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:24,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:24,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {14484#(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); {14452#true} is VALID [2022-04-15 12:19:24,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {14452#true} assume true; {14452#true} is VALID [2022-04-15 12:19:24,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14452#true} {14452#true} #40#return; {14452#true} is VALID [2022-04-15 12:19:24,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {14452#true} call ULTIMATE.init(); {14484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:24,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {14484#(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); {14452#true} is VALID [2022-04-15 12:19:24,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {14452#true} assume true; {14452#true} is VALID [2022-04-15 12:19:24,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14452#true} {14452#true} #40#return; {14452#true} is VALID [2022-04-15 12:19:24,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {14452#true} call #t~ret5 := main(); {14452#true} is VALID [2022-04-15 12:19:24,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {14452#true} ~x~0 := 0; {14457#(= main_~x~0 0)} is VALID [2022-04-15 12:19:24,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {14457#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {14457#(= main_~x~0 0)} is VALID [2022-04-15 12:19:24,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {14457#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14458#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:24,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {14458#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {14458#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:24,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {14458#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:24,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {14459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {14459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:24,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {14459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:24,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {14460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:24,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {14460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14461#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:24,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {14461#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14461#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:24,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {14461#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:24,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {14462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {14462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:24,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {14462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14463#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:24,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {14463#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {14463#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:24,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {14463#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:24,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {14464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:24,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {14464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14465#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:24,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {14465#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14465#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:24,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {14465#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14466#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:24,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {14466#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14466#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:24,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {14466#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:24,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {14467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:24,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {14467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14468#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:24,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {14468#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14468#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:24,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {14468#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:24,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {14469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:24,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {14469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:24,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {14470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:24,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {14470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:24,688 INFO L290 TraceCheckUtils]: 34: Hoare triple {14471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {14471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:24,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {14471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:24,698 INFO L290 TraceCheckUtils]: 36: Hoare triple {14472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {14472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:24,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {14472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:24,704 INFO L290 TraceCheckUtils]: 38: Hoare triple {14473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:24,709 INFO L290 TraceCheckUtils]: 39: Hoare triple {14473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14474#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:24,709 INFO L290 TraceCheckUtils]: 40: Hoare triple {14474#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {14474#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:24,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {14474#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14475#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:24,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {14475#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14475#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:24,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {14475#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14476#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:24,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {14476#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {14476#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:24,721 INFO L290 TraceCheckUtils]: 45: Hoare triple {14476#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14477#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:24,721 INFO L290 TraceCheckUtils]: 46: Hoare triple {14477#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14477#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:24,728 INFO L290 TraceCheckUtils]: 47: Hoare triple {14477#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14478#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:24,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {14478#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {14478#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:24,735 INFO L290 TraceCheckUtils]: 49: Hoare triple {14478#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14479#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:24,736 INFO L290 TraceCheckUtils]: 50: Hoare triple {14479#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {14479#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:24,743 INFO L290 TraceCheckUtils]: 51: Hoare triple {14479#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14480#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:24,744 INFO L290 TraceCheckUtils]: 52: Hoare triple {14480#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {14480#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:24,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {14480#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14481#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:24,750 INFO L290 TraceCheckUtils]: 54: Hoare triple {14481#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14481#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:24,755 INFO L290 TraceCheckUtils]: 55: Hoare triple {14481#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14482#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:24,755 INFO L290 TraceCheckUtils]: 56: Hoare triple {14482#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14482#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:24,758 INFO L290 TraceCheckUtils]: 57: Hoare triple {14482#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14483#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-15 12:19:24,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {14483#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 268435455); {14483#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-15 12:19:24,761 INFO L290 TraceCheckUtils]: 59: Hoare triple {14483#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {14453#false} is VALID [2022-04-15 12:19:24,761 INFO L290 TraceCheckUtils]: 60: Hoare triple {14453#false} assume !(~x~0 % 4294967296 < 268435455); {14453#false} is VALID [2022-04-15 12:19:24,761 INFO L272 TraceCheckUtils]: 61: Hoare triple {14453#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)); {14453#false} is VALID [2022-04-15 12:19:24,761 INFO L290 TraceCheckUtils]: 62: Hoare triple {14453#false} ~cond := #in~cond; {14453#false} is VALID [2022-04-15 12:19:24,761 INFO L290 TraceCheckUtils]: 63: Hoare triple {14453#false} assume 0 == ~cond; {14453#false} is VALID [2022-04-15 12:19:24,761 INFO L290 TraceCheckUtils]: 64: Hoare triple {14453#false} assume !false; {14453#false} is VALID [2022-04-15 12:19:24,762 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:24,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:24,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360560024] [2022-04-15 12:19:24,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360560024] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:24,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037530616] [2022-04-15 12:19:24,762 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:19:24,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:24,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:24,763 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:24,763 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:24,807 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:19:24,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:24,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-15 12:19:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:24,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:25,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {14452#true} call ULTIMATE.init(); {14452#true} is VALID [2022-04-15 12:19:25,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {14452#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); {14452#true} is VALID [2022-04-15 12:19:25,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {14452#true} assume true; {14452#true} is VALID [2022-04-15 12:19:25,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14452#true} {14452#true} #40#return; {14452#true} is VALID [2022-04-15 12:19:25,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {14452#true} call #t~ret5 := main(); {14452#true} is VALID [2022-04-15 12:19:25,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {14452#true} ~x~0 := 0; {14457#(= main_~x~0 0)} is VALID [2022-04-15 12:19:25,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {14457#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {14457#(= main_~x~0 0)} is VALID [2022-04-15 12:19:25,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {14457#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14458#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:25,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {14458#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {14458#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:25,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {14458#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:25,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {14459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {14459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:25,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {14459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:25,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {14460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:25,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {14460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14461#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:25,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {14461#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14461#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:25,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {14461#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:25,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {14462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {14462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:25,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {14462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14463#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:25,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {14463#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {14463#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:25,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {14463#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:25,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {14464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:25,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {14464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14465#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:25,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {14465#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14465#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:25,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {14465#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14466#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:25,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {14466#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14466#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:25,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {14466#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:25,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {14467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:25,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {14467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14468#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:25,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {14468#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14468#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:25,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {14468#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:25,495 INFO L290 TraceCheckUtils]: 30: Hoare triple {14469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:25,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {14469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:25,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {14470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:25,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {14470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:25,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {14471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {14471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:25,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {14471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:25,509 INFO L290 TraceCheckUtils]: 36: Hoare triple {14472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {14472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:25,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {14472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:25,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {14473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:25,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {14473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14474#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:25,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {14474#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {14474#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:25,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {14474#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14475#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:25,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {14475#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14475#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:25,520 INFO L290 TraceCheckUtils]: 43: Hoare triple {14475#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14476#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:25,520 INFO L290 TraceCheckUtils]: 44: Hoare triple {14476#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {14476#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:25,526 INFO L290 TraceCheckUtils]: 45: Hoare triple {14476#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14477#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:25,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {14477#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14477#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:25,532 INFO L290 TraceCheckUtils]: 47: Hoare triple {14477#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14478#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:25,533 INFO L290 TraceCheckUtils]: 48: Hoare triple {14478#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {14478#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:25,537 INFO L290 TraceCheckUtils]: 49: Hoare triple {14478#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14479#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:25,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {14479#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {14479#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:25,541 INFO L290 TraceCheckUtils]: 51: Hoare triple {14479#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14480#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:25,541 INFO L290 TraceCheckUtils]: 52: Hoare triple {14480#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {14480#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:25,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {14480#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14481#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:25,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {14481#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14481#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:25,549 INFO L290 TraceCheckUtils]: 55: Hoare triple {14481#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14482#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:25,549 INFO L290 TraceCheckUtils]: 56: Hoare triple {14482#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14482#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:25,553 INFO L290 TraceCheckUtils]: 57: Hoare triple {14482#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14659#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:25,553 INFO L290 TraceCheckUtils]: 58: Hoare triple {14659#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {14659#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:25,556 INFO L290 TraceCheckUtils]: 59: Hoare triple {14659#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {14666#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:19:25,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {14666#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 268435455); {14666#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:19:25,557 INFO L272 TraceCheckUtils]: 61: Hoare triple {14666#(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)); {14673#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:25,557 INFO L290 TraceCheckUtils]: 62: Hoare triple {14673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:25,557 INFO L290 TraceCheckUtils]: 63: Hoare triple {14677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14453#false} is VALID [2022-04-15 12:19:25,557 INFO L290 TraceCheckUtils]: 64: Hoare triple {14453#false} assume !false; {14453#false} is VALID [2022-04-15 12:19:25,558 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:25,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:25,863 INFO L290 TraceCheckUtils]: 64: Hoare triple {14453#false} assume !false; {14453#false} is VALID [2022-04-15 12:19:25,864 INFO L290 TraceCheckUtils]: 63: Hoare triple {14677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14453#false} is VALID [2022-04-15 12:19:25,864 INFO L290 TraceCheckUtils]: 62: Hoare triple {14673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:19:25,865 INFO L272 TraceCheckUtils]: 61: Hoare triple {14693#(= (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)); {14673#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:25,865 INFO L290 TraceCheckUtils]: 60: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,866 INFO L290 TraceCheckUtils]: 59: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,866 INFO L290 TraceCheckUtils]: 58: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,880 INFO L290 TraceCheckUtils]: 57: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,880 INFO L290 TraceCheckUtils]: 56: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:25,882 INFO L290 TraceCheckUtils]: 55: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:25,882 INFO L290 TraceCheckUtils]: 54: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,893 INFO L290 TraceCheckUtils]: 53: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,894 INFO L290 TraceCheckUtils]: 52: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:25,895 INFO L290 TraceCheckUtils]: 51: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:25,896 INFO L290 TraceCheckUtils]: 50: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,908 INFO L290 TraceCheckUtils]: 48: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:25,909 INFO L290 TraceCheckUtils]: 47: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:25,909 INFO L290 TraceCheckUtils]: 46: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:25,923 INFO L290 TraceCheckUtils]: 43: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:25,923 INFO L290 TraceCheckUtils]: 42: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:25,935 INFO L290 TraceCheckUtils]: 39: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:25,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:25,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:25,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,964 INFO L290 TraceCheckUtils]: 33: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:25,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:25,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:25,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:25,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:25,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:26,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:26,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:26,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:26,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:26,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:26,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:26,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:26,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:26,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:26,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:26,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:26,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:26,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:26,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:26,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:26,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {14706#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:26,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14706#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:19:26,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {14693#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:26,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {14452#true} ~x~0 := 0; {14693#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:26,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {14452#true} call #t~ret5 := main(); {14452#true} is VALID [2022-04-15 12:19:26,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14452#true} {14452#true} #40#return; {14452#true} is VALID [2022-04-15 12:19:26,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {14452#true} assume true; {14452#true} is VALID [2022-04-15 12:19:26,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {14452#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); {14452#true} is VALID [2022-04-15 12:19:26,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {14452#true} call ULTIMATE.init(); {14452#true} is VALID [2022-04-15 12:19:26,068 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:26,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037530616] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:26,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:26,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 6] total 36 [2022-04-15 12:19:26,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:26,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [136803586] [2022-04-15 12:19:26,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [136803586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:26,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:26,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:19:26,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635123179] [2022-04-15 12:19:26,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:26,069 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:26,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:26,070 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:26,330 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:26,330 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:19:26,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:26,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:19:26,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:19:26,331 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:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:41,997 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-15 12:19:41,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 12:19:41,998 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:41,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:41,998 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:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 77 transitions. [2022-04-15 12:19:41,999 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:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 77 transitions. [2022-04-15 12:19:41,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 77 transitions. [2022-04-15 12:19:42,616 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:42,617 INFO L225 Difference]: With dead ends: 76 [2022-04-15 12:19:42,617 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 12:19:42,617 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=310, Invalid=3596, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 12:19:42,618 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:42,618 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 29 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-04-15 12:19:42,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 12:19:42,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-15 12:19:42,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:42,749 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:42,749 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:42,749 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:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:42,750 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2022-04-15 12:19:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-15 12:19:42,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:42,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:42,750 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:42,750 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:42,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:42,751 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2022-04-15 12:19:42,751 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-15 12:19:42,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:42,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:42,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:42,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:42,751 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:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2022-04-15 12:19:42,752 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 65 [2022-04-15 12:19:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:42,752 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2022-04-15 12:19:42,752 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:42,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 71 transitions. [2022-04-15 12:19:43,223 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:43,223 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-15 12:19:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 12:19:43,224 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:43,224 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:43,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 12:19:43,427 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:43,427 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:43,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash -678172532, now seen corresponding path program 53 times [2022-04-15 12:19:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:43,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1206925070] [2022-04-15 12:19:43,574 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:19:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash 292668785, now seen corresponding path program 1 times [2022-04-15 12:19:43,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:43,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241618791] [2022-04-15 12:19:43,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:43,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:43,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:19:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:19:43,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:19:43,587 INFO L85 PathProgramCache]: Analyzing trace with hash -678172532, now seen corresponding path program 54 times [2022-04-15 12:19:43,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:43,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546730162] [2022-04-15 12:19:43,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:43,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:44,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:44,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {15395#(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); {15362#true} is VALID [2022-04-15 12:19:44,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {15362#true} assume true; {15362#true} is VALID [2022-04-15 12:19:44,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15362#true} {15362#true} #40#return; {15362#true} is VALID [2022-04-15 12:19:44,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {15362#true} call ULTIMATE.init(); {15395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:44,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {15395#(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); {15362#true} is VALID [2022-04-15 12:19:44,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {15362#true} assume true; {15362#true} is VALID [2022-04-15 12:19:44,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15362#true} {15362#true} #40#return; {15362#true} is VALID [2022-04-15 12:19:44,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {15362#true} call #t~ret5 := main(); {15362#true} is VALID [2022-04-15 12:19:44,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {15362#true} ~x~0 := 0; {15367#(= main_~x~0 0)} is VALID [2022-04-15 12:19:44,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {15367#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {15367#(= main_~x~0 0)} is VALID [2022-04-15 12:19:44,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {15367#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15368#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:44,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {15368#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {15368#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:19:44,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {15368#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15369#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:44,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {15369#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {15369#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:19:44,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {15369#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15370#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:44,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {15370#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15370#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:19:44,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {15370#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15371#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:44,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {15371#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15371#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:19:44,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {15371#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15372#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:44,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {15372#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {15372#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:19:44,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {15372#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15373#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:44,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {15373#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {15373#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:19:44,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {15373#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15374#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:44,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {15374#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15374#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:19:44,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {15374#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15375#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:44,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {15375#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15375#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:19:44,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {15375#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15376#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:44,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {15376#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15376#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:19:44,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {15376#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15377#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:44,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {15377#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15377#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:19:44,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {15377#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15378#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:44,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {15378#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15378#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:19:44,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {15378#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15379#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:44,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {15379#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15379#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:19:44,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {15379#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15380#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:44,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {15380#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15380#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:19:44,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {15380#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15381#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:44,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {15381#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {15381#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:19:44,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {15381#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15382#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:44,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {15382#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {15382#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:19:44,351 INFO L290 TraceCheckUtils]: 37: Hoare triple {15382#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15383#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:44,352 INFO L290 TraceCheckUtils]: 38: Hoare triple {15383#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15383#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:19:44,369 INFO L290 TraceCheckUtils]: 39: Hoare triple {15383#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15384#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:44,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {15384#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {15384#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:19:44,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {15384#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15385#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:44,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {15385#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15385#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:19:44,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {15385#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15386#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:44,374 INFO L290 TraceCheckUtils]: 44: Hoare triple {15386#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {15386#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:19:44,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {15386#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15387#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:44,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {15387#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15387#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:19:44,410 INFO L290 TraceCheckUtils]: 47: Hoare triple {15387#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15388#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:44,410 INFO L290 TraceCheckUtils]: 48: Hoare triple {15388#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {15388#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:19:44,428 INFO L290 TraceCheckUtils]: 49: Hoare triple {15388#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15389#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:44,429 INFO L290 TraceCheckUtils]: 50: Hoare triple {15389#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {15389#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:19:44,444 INFO L290 TraceCheckUtils]: 51: Hoare triple {15389#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15390#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:44,445 INFO L290 TraceCheckUtils]: 52: Hoare triple {15390#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {15390#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:19:44,462 INFO L290 TraceCheckUtils]: 53: Hoare triple {15390#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15391#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:44,463 INFO L290 TraceCheckUtils]: 54: Hoare triple {15391#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15391#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:19:44,481 INFO L290 TraceCheckUtils]: 55: Hoare triple {15391#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15392#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:44,481 INFO L290 TraceCheckUtils]: 56: Hoare triple {15392#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15392#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:19:44,499 INFO L290 TraceCheckUtils]: 57: Hoare triple {15392#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15393#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:44,499 INFO L290 TraceCheckUtils]: 58: Hoare triple {15393#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {15393#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:19:44,502 INFO L290 TraceCheckUtils]: 59: Hoare triple {15393#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15394#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 27))} is VALID [2022-04-15 12:19:44,503 INFO L290 TraceCheckUtils]: 60: Hoare triple {15394#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {15394#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 27))} is VALID [2022-04-15 12:19:44,504 INFO L290 TraceCheckUtils]: 61: Hoare triple {15394#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 27))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {15363#false} is VALID [2022-04-15 12:19:44,504 INFO L290 TraceCheckUtils]: 62: Hoare triple {15363#false} assume !(~x~0 % 4294967296 < 268435455); {15363#false} is VALID [2022-04-15 12:19:44,504 INFO L272 TraceCheckUtils]: 63: Hoare triple {15363#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)); {15363#false} is VALID [2022-04-15 12:19:44,504 INFO L290 TraceCheckUtils]: 64: Hoare triple {15363#false} ~cond := #in~cond; {15363#false} is VALID [2022-04-15 12:19:44,504 INFO L290 TraceCheckUtils]: 65: Hoare triple {15363#false} assume 0 == ~cond; {15363#false} is VALID [2022-04-15 12:19:44,504 INFO L290 TraceCheckUtils]: 66: Hoare triple {15363#false} assume !false; {15363#false} is VALID [2022-04-15 12:19:44,505 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:44,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:44,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546730162] [2022-04-15 12:19:44,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546730162] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:19:44,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526137911] [2022-04-15 12:19:44,505 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:19:44,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:19:44,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:19:44,506 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:44,507 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:44,559 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:19:44,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:19:44,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 12:19:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:44,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:19:44,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {15362#true} call ULTIMATE.init(); {15362#true} is VALID [2022-04-15 12:19:44,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {15362#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); {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {15362#true} assume true; {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15362#true} {15362#true} #40#return; {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {15362#true} call #t~ret5 := main(); {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {15362#true} ~x~0 := 0; {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 27: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 36: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,818 INFO L290 TraceCheckUtils]: 39: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 40: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 41: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 46: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 47: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 50: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 52: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 53: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 54: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 55: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 56: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 57: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:44,819 INFO L290 TraceCheckUtils]: 58: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:44,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15576#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:19:44,848 INFO L290 TraceCheckUtils]: 60: Hoare triple {15576#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {15576#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:19:44,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {15576#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {15583#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2022-04-15 12:19:44,857 INFO L290 TraceCheckUtils]: 62: Hoare triple {15583#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 268435455); {15363#false} is VALID [2022-04-15 12:19:44,857 INFO L272 TraceCheckUtils]: 63: Hoare triple {15363#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)); {15363#false} is VALID [2022-04-15 12:19:44,857 INFO L290 TraceCheckUtils]: 64: Hoare triple {15363#false} ~cond := #in~cond; {15363#false} is VALID [2022-04-15 12:19:44,857 INFO L290 TraceCheckUtils]: 65: Hoare triple {15363#false} assume 0 == ~cond; {15363#false} is VALID [2022-04-15 12:19:44,857 INFO L290 TraceCheckUtils]: 66: Hoare triple {15363#false} assume !false; {15363#false} is VALID [2022-04-15 12:19:44,858 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:44,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:19:45,504 INFO L290 TraceCheckUtils]: 66: Hoare triple {15363#false} assume !false; {15363#false} is VALID [2022-04-15 12:19:45,505 INFO L290 TraceCheckUtils]: 65: Hoare triple {15602#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15363#false} is VALID [2022-04-15 12:19:45,505 INFO L290 TraceCheckUtils]: 64: Hoare triple {15606#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15602#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:19:45,505 INFO L272 TraceCheckUtils]: 63: Hoare triple {15610#(= (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)); {15606#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:19:45,506 INFO L290 TraceCheckUtils]: 62: Hoare triple {15614#(or (< (mod main_~x~0 4294967296) 268435455) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 268435455); {15610#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:19:45,512 INFO L290 TraceCheckUtils]: 61: Hoare triple {15618#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {15614#(or (< (mod main_~x~0 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:45,512 INFO L290 TraceCheckUtils]: 60: Hoare triple {15618#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 268435455); {15618#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:45,515 INFO L290 TraceCheckUtils]: 59: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15618#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:19:45,515 INFO L290 TraceCheckUtils]: 58: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,515 INFO L290 TraceCheckUtils]: 57: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,515 INFO L290 TraceCheckUtils]: 55: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,515 INFO L290 TraceCheckUtils]: 54: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,515 INFO L290 TraceCheckUtils]: 53: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 52: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 51: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 50: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 49: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 47: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 46: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 45: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 30: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {15362#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15362#true} is VALID [2022-04-15 12:19:45,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {15362#true} assume !!(~x~0 % 4294967296 < 268435455); {15362#true} is VALID [2022-04-15 12:19:45,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {15362#true} ~x~0 := 0; {15362#true} is VALID [2022-04-15 12:19:45,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {15362#true} call #t~ret5 := main(); {15362#true} is VALID [2022-04-15 12:19:45,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15362#true} {15362#true} #40#return; {15362#true} is VALID [2022-04-15 12:19:45,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {15362#true} assume true; {15362#true} is VALID [2022-04-15 12:19:45,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {15362#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); {15362#true} is VALID [2022-04-15 12:19:45,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {15362#true} call ULTIMATE.init(); {15362#true} is VALID [2022-04-15 12:19:45,519 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:45,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526137911] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:19:45,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:19:45,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 4, 7] total 38 [2022-04-15 12:19:45,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:45,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1206925070] [2022-04-15 12:19:45,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1206925070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:45,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:45,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 12:19:45,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515129065] [2022-04-15 12:19:45,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:45,520 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:45,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:45,520 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:46,086 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:46,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 12:19:46,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:46,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 12:19:46,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:19:46,087 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:20:13,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:13,197 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-04-15 12:20:13,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:20:13,197 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:20:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:13,197 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:20:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 79 transitions. [2022-04-15 12:20:13,198 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:20:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 79 transitions. [2022-04-15 12:20:13,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 79 transitions. [2022-04-15 12:20:13,932 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:20:13,933 INFO L225 Difference]: With dead ends: 78 [2022-04-15 12:20:13,933 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 12:20:13,934 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=512, Invalid=3778, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 12:20:13,934 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:13,934 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 84 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2022-04-15 12:20:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 12:20:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-15 12:20:14,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:14,079 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:20:14,079 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:20:14,079 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:20:14,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:14,080 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-15 12:20:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-15 12:20:14,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:14,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:14,080 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:20:14,080 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:20:14,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:14,081 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-15 12:20:14,081 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-15 12:20:14,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:14,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:14,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:14,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:14,081 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:20:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2022-04-15 12:20:14,082 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 67 [2022-04-15 12:20:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:14,082 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2022-04-15 12:20:14,083 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:20:14,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 73 transitions. [2022-04-15 12:20:14,841 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:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-15 12:20:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 12:20:14,842 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:14,842 INFO L499 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:14,859 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:20:15,042 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:20:15,042 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:15,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1241804503, now seen corresponding path program 55 times [2022-04-15 12:20:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:15,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [262378019] [2022-04-15 12:20:15,192 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:20:15,193 INFO L85 PathProgramCache]: Analyzing trace with hash 351774129, now seen corresponding path program 1 times [2022-04-15 12:20:15,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:15,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053166516] [2022-04-15 12:20:15,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:15,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:20:15,199 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:20:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:20:15,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:20:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1241804503, now seen corresponding path program 56 times [2022-04-15 12:20:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:15,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890472041] [2022-04-15 12:20:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:15,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:15,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:15,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {16334#(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); {16300#true} is VALID [2022-04-15 12:20:15,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-15 12:20:15,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16300#true} {16300#true} #40#return; {16300#true} is VALID [2022-04-15 12:20:15,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {16300#true} call ULTIMATE.init(); {16334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:15,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {16334#(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); {16300#true} is VALID [2022-04-15 12:20:15,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-15 12:20:15,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16300#true} {16300#true} #40#return; {16300#true} is VALID [2022-04-15 12:20:15,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {16300#true} call #t~ret5 := main(); {16300#true} is VALID [2022-04-15 12:20:15,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {16300#true} ~x~0 := 0; {16305#(= main_~x~0 0)} is VALID [2022-04-15 12:20:15,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {16305#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {16305#(= main_~x~0 0)} is VALID [2022-04-15 12:20:15,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {16305#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16306#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:20:15,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {16306#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {16306#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:20:15,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {16306#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16307#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:15,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {16307#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {16307#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:15,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {16307#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16308#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:20:15,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {16308#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16308#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:20:15,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {16308#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16309#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:15,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {16309#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16309#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:15,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {16309#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16310#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:20:15,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {16310#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {16310#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:20:15,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {16310#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16311#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:15,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {16311#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {16311#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:15,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {16311#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16312#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:20:15,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {16312#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16312#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:20:15,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {16312#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16313#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:15,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {16313#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16313#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:15,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {16313#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16314#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:20:15,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {16314#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16314#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:20:15,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {16314#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16315#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:15,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {16315#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16315#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:15,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {16315#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16316#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:20:15,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {16316#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16316#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:20:15,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {16316#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16317#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:15,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {16317#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16317#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:15,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {16317#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16318#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:20:15,958 INFO L290 TraceCheckUtils]: 32: Hoare triple {16318#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16318#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:20:15,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {16318#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16319#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:15,961 INFO L290 TraceCheckUtils]: 34: Hoare triple {16319#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {16319#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:15,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {16319#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16320#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:20:15,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {16320#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {16320#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:20:15,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {16320#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16321#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:15,994 INFO L290 TraceCheckUtils]: 38: Hoare triple {16321#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16321#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:16,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {16321#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16322#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:20:16,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {16322#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {16322#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:20:16,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {16322#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16323#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:16,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {16323#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16323#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:16,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {16323#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16324#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:20:16,016 INFO L290 TraceCheckUtils]: 44: Hoare triple {16324#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {16324#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:20:16,033 INFO L290 TraceCheckUtils]: 45: Hoare triple {16324#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16325#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:16,034 INFO L290 TraceCheckUtils]: 46: Hoare triple {16325#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16325#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:16,050 INFO L290 TraceCheckUtils]: 47: Hoare triple {16325#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16326#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:20:16,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {16326#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {16326#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:20:16,069 INFO L290 TraceCheckUtils]: 49: Hoare triple {16326#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16327#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:16,070 INFO L290 TraceCheckUtils]: 50: Hoare triple {16327#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {16327#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:16,087 INFO L290 TraceCheckUtils]: 51: Hoare triple {16327#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16328#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:20:16,088 INFO L290 TraceCheckUtils]: 52: Hoare triple {16328#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {16328#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:20:16,105 INFO L290 TraceCheckUtils]: 53: Hoare triple {16328#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16329#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:16,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {16329#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16329#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:16,123 INFO L290 TraceCheckUtils]: 55: Hoare triple {16329#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16330#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:20:16,124 INFO L290 TraceCheckUtils]: 56: Hoare triple {16330#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16330#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:20:16,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {16330#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16331#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:16,141 INFO L290 TraceCheckUtils]: 58: Hoare triple {16331#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16331#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:16,144 INFO L290 TraceCheckUtils]: 59: Hoare triple {16331#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16332#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:20:16,145 INFO L290 TraceCheckUtils]: 60: Hoare triple {16332#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {16332#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:20:16,146 INFO L290 TraceCheckUtils]: 61: Hoare triple {16332#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16333#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:16,146 INFO L290 TraceCheckUtils]: 62: Hoare triple {16333#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {16333#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:16,150 INFO L290 TraceCheckUtils]: 63: Hoare triple {16333#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {16301#false} is VALID [2022-04-15 12:20:16,150 INFO L290 TraceCheckUtils]: 64: Hoare triple {16301#false} assume !(~x~0 % 4294967296 < 268435455); {16301#false} is VALID [2022-04-15 12:20:16,150 INFO L272 TraceCheckUtils]: 65: Hoare triple {16301#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)); {16301#false} is VALID [2022-04-15 12:20:16,150 INFO L290 TraceCheckUtils]: 66: Hoare triple {16301#false} ~cond := #in~cond; {16301#false} is VALID [2022-04-15 12:20:16,150 INFO L290 TraceCheckUtils]: 67: Hoare triple {16301#false} assume 0 == ~cond; {16301#false} is VALID [2022-04-15 12:20:16,150 INFO L290 TraceCheckUtils]: 68: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-15 12:20:16,151 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:20:16,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:16,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890472041] [2022-04-15 12:20:16,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890472041] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:20:16,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942560817] [2022-04-15 12:20:16,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:20:16,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:16,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:20:16,152 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:20:16,155 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:20:16,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:20:16,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:20:16,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-15 12:20:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:16,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:20:16,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {16300#true} call ULTIMATE.init(); {16300#true} is VALID [2022-04-15 12:20:16,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {16300#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); {16300#true} is VALID [2022-04-15 12:20:16,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-15 12:20:16,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16300#true} {16300#true} #40#return; {16300#true} is VALID [2022-04-15 12:20:16,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {16300#true} call #t~ret5 := main(); {16300#true} is VALID [2022-04-15 12:20:16,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {16300#true} ~x~0 := 0; {16305#(= main_~x~0 0)} is VALID [2022-04-15 12:20:16,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {16305#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {16305#(= main_~x~0 0)} is VALID [2022-04-15 12:20:16,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {16305#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16306#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:20:16,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {16306#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {16306#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:20:16,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {16306#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16307#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:16,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {16307#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {16307#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:16,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {16307#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16308#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:20:16,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {16308#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16308#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:20:16,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {16308#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16309#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:16,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {16309#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16309#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:16,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {16309#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16310#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:20:16,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {16310#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {16310#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:20:16,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {16310#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16311#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:16,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {16311#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {16311#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:16,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {16311#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16312#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:20:16,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {16312#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16312#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:20:16,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {16312#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16313#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:16,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {16313#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16313#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:16,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {16313#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16314#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:20:16,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {16314#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16314#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:20:16,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {16314#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16315#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:16,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {16315#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16315#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:17,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {16315#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16316#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:20:17,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {16316#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16316#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:20:17,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {16316#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16317#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:17,021 INFO L290 TraceCheckUtils]: 30: Hoare triple {16317#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16317#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:17,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {16317#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16318#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:20:17,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {16318#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16318#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:20:17,025 INFO L290 TraceCheckUtils]: 33: Hoare triple {16318#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16319#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:17,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {16319#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {16319#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:17,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {16319#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16320#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:20:17,043 INFO L290 TraceCheckUtils]: 36: Hoare triple {16320#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {16320#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:20:17,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {16320#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16321#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:17,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {16321#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16321#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:17,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {16321#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16322#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:20:17,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {16322#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {16322#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:20:17,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {16322#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16323#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:17,080 INFO L290 TraceCheckUtils]: 42: Hoare triple {16323#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16323#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:17,082 INFO L290 TraceCheckUtils]: 43: Hoare triple {16323#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16324#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:20:17,082 INFO L290 TraceCheckUtils]: 44: Hoare triple {16324#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {16324#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:20:17,096 INFO L290 TraceCheckUtils]: 45: Hoare triple {16324#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16325#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:17,097 INFO L290 TraceCheckUtils]: 46: Hoare triple {16325#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16325#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:17,115 INFO L290 TraceCheckUtils]: 47: Hoare triple {16325#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16326#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:20:17,116 INFO L290 TraceCheckUtils]: 48: Hoare triple {16326#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {16326#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:20:17,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {16326#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16327#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:17,135 INFO L290 TraceCheckUtils]: 50: Hoare triple {16327#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {16327#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:17,151 INFO L290 TraceCheckUtils]: 51: Hoare triple {16327#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16328#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:20:17,152 INFO L290 TraceCheckUtils]: 52: Hoare triple {16328#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {16328#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:20:17,168 INFO L290 TraceCheckUtils]: 53: Hoare triple {16328#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16329#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:17,168 INFO L290 TraceCheckUtils]: 54: Hoare triple {16329#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16329#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:17,184 INFO L290 TraceCheckUtils]: 55: Hoare triple {16329#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16330#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:20:17,185 INFO L290 TraceCheckUtils]: 56: Hoare triple {16330#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16330#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:20:17,201 INFO L290 TraceCheckUtils]: 57: Hoare triple {16330#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16331#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:17,202 INFO L290 TraceCheckUtils]: 58: Hoare triple {16331#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {16331#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:17,205 INFO L290 TraceCheckUtils]: 59: Hoare triple {16331#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16332#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:20:17,205 INFO L290 TraceCheckUtils]: 60: Hoare triple {16332#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {16332#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:20:17,209 INFO L290 TraceCheckUtils]: 61: Hoare triple {16332#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16521#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:17,209 INFO L290 TraceCheckUtils]: 62: Hoare triple {16521#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {16521#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:17,210 INFO L290 TraceCheckUtils]: 63: Hoare triple {16521#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {16528#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:20:17,210 INFO L290 TraceCheckUtils]: 64: Hoare triple {16528#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(~x~0 % 4294967296 < 268435455); {16528#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:20:17,211 INFO L272 TraceCheckUtils]: 65: Hoare triple {16528#(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)); {16535#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:20:17,211 INFO L290 TraceCheckUtils]: 66: Hoare triple {16535#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16539#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:20:17,212 INFO L290 TraceCheckUtils]: 67: Hoare triple {16539#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16301#false} is VALID [2022-04-15 12:20:17,212 INFO L290 TraceCheckUtils]: 68: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-15 12:20:17,212 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:20:17,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:17,499 INFO L290 TraceCheckUtils]: 68: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-15 12:20:17,499 INFO L290 TraceCheckUtils]: 67: Hoare triple {16539#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16301#false} is VALID [2022-04-15 12:20:17,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {16535#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16539#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:20:17,500 INFO L272 TraceCheckUtils]: 65: Hoare triple {16555#(= (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)); {16535#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:20:17,500 INFO L290 TraceCheckUtils]: 64: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,501 INFO L290 TraceCheckUtils]: 63: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,501 INFO L290 TraceCheckUtils]: 62: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,520 INFO L290 TraceCheckUtils]: 61: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,522 INFO L290 TraceCheckUtils]: 59: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,522 INFO L290 TraceCheckUtils]: 58: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,539 INFO L290 TraceCheckUtils]: 57: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,539 INFO L290 TraceCheckUtils]: 56: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,541 INFO L290 TraceCheckUtils]: 55: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,541 INFO L290 TraceCheckUtils]: 54: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,557 INFO L290 TraceCheckUtils]: 53: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,558 INFO L290 TraceCheckUtils]: 52: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,559 INFO L290 TraceCheckUtils]: 51: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,560 INFO L290 TraceCheckUtils]: 50: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,578 INFO L290 TraceCheckUtils]: 47: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,578 INFO L290 TraceCheckUtils]: 46: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,595 INFO L290 TraceCheckUtils]: 43: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,595 INFO L290 TraceCheckUtils]: 42: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,612 INFO L290 TraceCheckUtils]: 41: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,612 INFO L290 TraceCheckUtils]: 40: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,630 INFO L290 TraceCheckUtils]: 37: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,667 INFO L290 TraceCheckUtils]: 28: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {16568#(= (mod (+ main_~x~0 1) 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16568#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-15 12:20:17,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {16555#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {16300#true} ~x~0 := 0; {16555#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:20:17,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {16300#true} call #t~ret5 := main(); {16300#true} is VALID [2022-04-15 12:20:17,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16300#true} {16300#true} #40#return; {16300#true} is VALID [2022-04-15 12:20:17,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-15 12:20:17,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {16300#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); {16300#true} is VALID [2022-04-15 12:20:17,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {16300#true} call ULTIMATE.init(); {16300#true} is VALID [2022-04-15 12:20:17,760 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:20:17,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942560817] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:17,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:17,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34, 6] total 38 [2022-04-15 12:20:17,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:17,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [262378019] [2022-04-15 12:20:17,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [262378019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:17,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:17,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:20:17,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579387398] [2022-04-15 12:20:17,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:17,761 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:17,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:17,761 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:20:18,436 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:20:18,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:20:18,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:18,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:20:18,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1274, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:20:18,437 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:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:49,593 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-04-15 12:20:49,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 12:20:49,593 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:49,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:49,593 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:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 81 transitions. [2022-04-15 12:20:49,594 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:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 81 transitions. [2022-04-15 12:20:49,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 81 transitions. [2022-04-15 12:20:50,302 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:50,304 INFO L225 Difference]: With dead ends: 80 [2022-04-15 12:20:50,304 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 12:20:50,304 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:50,305 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:50,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 69 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2022-04-15 12:20:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 12:20:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-15 12:20:50,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:50,441 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:50,441 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:50,441 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:50,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:50,443 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-04-15 12:20:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-04-15 12:20:50,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:50,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:50,443 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:50,443 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:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:50,444 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-04-15 12:20:50,444 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-04-15 12:20:50,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:50,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:50,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:50,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:50,444 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:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2022-04-15 12:20:50,445 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2022-04-15 12:20:50,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:50,445 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2022-04-15 12:20:50,445 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:50,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 75 transitions. [2022-04-15 12:20:50,945 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:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-04-15 12:20:50,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 12:20:50,945 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:50,945 INFO L499 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:50,961 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:51,153 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:51,154 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:51,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:51,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1726249338, now seen corresponding path program 57 times [2022-04-15 12:20:51,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:51,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1518175205] [2022-04-15 12:20:51,319 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:20:51,320 INFO L85 PathProgramCache]: Analyzing trace with hash 410879473, now seen corresponding path program 1 times [2022-04-15 12:20:51,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:51,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406892650] [2022-04-15 12:20:51,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:51,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:20:51,325 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:20:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:20:51,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:20:51,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1726249338, now seen corresponding path program 58 times [2022-04-15 12:20:51,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:51,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121848719] [2022-04-15 12:20:51,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:51,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:51,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:51,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {17299#(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); {17264#true} is VALID [2022-04-15 12:20:51,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {17264#true} assume true; {17264#true} is VALID [2022-04-15 12:20:51,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17264#true} {17264#true} #40#return; {17264#true} is VALID [2022-04-15 12:20:51,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {17264#true} call ULTIMATE.init(); {17299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:51,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {17299#(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); {17264#true} is VALID [2022-04-15 12:20:51,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {17264#true} assume true; {17264#true} is VALID [2022-04-15 12:20:51,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17264#true} {17264#true} #40#return; {17264#true} is VALID [2022-04-15 12:20:51,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {17264#true} call #t~ret5 := main(); {17264#true} is VALID [2022-04-15 12:20:51,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {17264#true} ~x~0 := 0; {17269#(= main_~x~0 0)} is VALID [2022-04-15 12:20:51,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {17269#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {17269#(= main_~x~0 0)} is VALID [2022-04-15 12:20:51,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {17269#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17270#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:20:51,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {17270#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {17270#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:20:51,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {17270#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17271#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:51,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {17271#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {17271#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:51,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {17271#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17272#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:20:51,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {17272#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17272#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:20:51,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {17272#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17273#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:51,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {17273#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17273#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:51,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {17273#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17274#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:20:51,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {17274#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {17274#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:20:52,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {17274#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17275#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:52,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {17275#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {17275#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:52,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {17275#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17276#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:20:52,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {17276#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17276#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:20:52,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {17276#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17277#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:52,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {17277#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17277#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:52,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {17277#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17278#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:20:52,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {17278#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17278#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:20:52,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {17278#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17279#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:52,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {17279#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17279#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:52,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {17279#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17280#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:20:52,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {17280#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17280#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:20:52,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {17280#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:52,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {17281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:52,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {17281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17282#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:20:52,074 INFO L290 TraceCheckUtils]: 32: Hoare triple {17282#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17282#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:20:52,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {17282#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17283#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:52,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {17283#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {17283#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:52,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {17283#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17284#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:20:52,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {17284#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {17284#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:20:52,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {17284#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17285#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:52,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {17285#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17285#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:52,109 INFO L290 TraceCheckUtils]: 39: Hoare triple {17285#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17286#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:20:52,109 INFO L290 TraceCheckUtils]: 40: Hoare triple {17286#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {17286#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:20:52,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {17286#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17287#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:52,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {17287#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17287#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:52,114 INFO L290 TraceCheckUtils]: 43: Hoare triple {17287#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17288#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:20:52,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {17288#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {17288#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:20:52,124 INFO L290 TraceCheckUtils]: 45: Hoare triple {17288#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17289#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:52,124 INFO L290 TraceCheckUtils]: 46: Hoare triple {17289#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17289#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:52,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {17289#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17290#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:20:52,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {17290#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {17290#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:20:52,140 INFO L290 TraceCheckUtils]: 49: Hoare triple {17290#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17291#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:52,141 INFO L290 TraceCheckUtils]: 50: Hoare triple {17291#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {17291#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:52,149 INFO L290 TraceCheckUtils]: 51: Hoare triple {17291#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17292#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:20:52,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {17292#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {17292#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:20:52,157 INFO L290 TraceCheckUtils]: 53: Hoare triple {17292#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17293#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:52,157 INFO L290 TraceCheckUtils]: 54: Hoare triple {17293#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17293#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:52,166 INFO L290 TraceCheckUtils]: 55: Hoare triple {17293#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17294#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:20:52,166 INFO L290 TraceCheckUtils]: 56: Hoare triple {17294#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17294#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:20:52,176 INFO L290 TraceCheckUtils]: 57: Hoare triple {17294#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17295#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:52,177 INFO L290 TraceCheckUtils]: 58: Hoare triple {17295#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17295#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:52,179 INFO L290 TraceCheckUtils]: 59: Hoare triple {17295#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17296#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:20:52,180 INFO L290 TraceCheckUtils]: 60: Hoare triple {17296#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {17296#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:20:52,182 INFO L290 TraceCheckUtils]: 61: Hoare triple {17296#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:52,182 INFO L290 TraceCheckUtils]: 62: Hoare triple {17297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {17297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:52,193 INFO L290 TraceCheckUtils]: 63: Hoare triple {17297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17298#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:20:52,193 INFO L290 TraceCheckUtils]: 64: Hoare triple {17298#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {17298#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:20:52,195 INFO L290 TraceCheckUtils]: 65: Hoare triple {17298#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {17265#false} is VALID [2022-04-15 12:20:52,195 INFO L290 TraceCheckUtils]: 66: Hoare triple {17265#false} assume !(~x~0 % 4294967296 < 268435455); {17265#false} is VALID [2022-04-15 12:20:52,196 INFO L272 TraceCheckUtils]: 67: Hoare triple {17265#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)); {17265#false} is VALID [2022-04-15 12:20:52,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {17265#false} ~cond := #in~cond; {17265#false} is VALID [2022-04-15 12:20:52,196 INFO L290 TraceCheckUtils]: 69: Hoare triple {17265#false} assume 0 == ~cond; {17265#false} is VALID [2022-04-15 12:20:52,196 INFO L290 TraceCheckUtils]: 70: Hoare triple {17265#false} assume !false; {17265#false} is VALID [2022-04-15 12:20:52,196 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:52,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:52,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121848719] [2022-04-15 12:20:52,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121848719] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:20:52,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054511203] [2022-04-15 12:20:52,197 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:20:52,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:20:52,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:20:52,198 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:52,198 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:52,270 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:20:52,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:20:52,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-15 12:20:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:52,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:20:52,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {17264#true} call ULTIMATE.init(); {17264#true} is VALID [2022-04-15 12:20:52,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {17264#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); {17264#true} is VALID [2022-04-15 12:20:52,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {17264#true} assume true; {17264#true} is VALID [2022-04-15 12:20:52,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17264#true} {17264#true} #40#return; {17264#true} is VALID [2022-04-15 12:20:52,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {17264#true} call #t~ret5 := main(); {17264#true} is VALID [2022-04-15 12:20:52,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {17264#true} ~x~0 := 0; {17269#(= main_~x~0 0)} is VALID [2022-04-15 12:20:52,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {17269#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {17269#(= main_~x~0 0)} is VALID [2022-04-15 12:20:52,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {17269#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17270#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:20:52,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {17270#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {17270#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:20:52,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {17270#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17271#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:52,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {17271#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {17271#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:20:52,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {17271#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17272#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:20:52,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {17272#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17272#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:20:52,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {17272#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17273#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:52,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {17273#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17273#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:20:52,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {17273#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17274#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:20:52,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {17274#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {17274#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:20:52,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {17274#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17275#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:52,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {17275#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {17275#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:20:52,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {17275#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17276#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:20:52,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {17276#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17276#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:20:52,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {17276#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17277#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:52,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {17277#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17277#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:20:52,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {17277#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17278#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:20:52,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {17278#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17278#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:20:52,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {17278#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17279#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:52,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {17279#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17279#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:20:52,995 INFO L290 TraceCheckUtils]: 27: Hoare triple {17279#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17280#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:20:52,995 INFO L290 TraceCheckUtils]: 28: Hoare triple {17280#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17280#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:20:52,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {17280#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:52,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {17281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:20:53,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {17281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17282#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:20:53,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {17282#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17282#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:20:53,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {17282#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17283#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:53,003 INFO L290 TraceCheckUtils]: 34: Hoare triple {17283#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {17283#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:20:53,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {17283#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17284#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:20:53,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {17284#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {17284#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:20:53,031 INFO L290 TraceCheckUtils]: 37: Hoare triple {17284#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17285#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:53,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {17285#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17285#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:20:53,046 INFO L290 TraceCheckUtils]: 39: Hoare triple {17285#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17286#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:20:53,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {17286#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {17286#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:20:53,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {17286#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17287#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:53,049 INFO L290 TraceCheckUtils]: 42: Hoare triple {17287#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17287#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:20:53,051 INFO L290 TraceCheckUtils]: 43: Hoare triple {17287#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17288#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:20:53,051 INFO L290 TraceCheckUtils]: 44: Hoare triple {17288#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {17288#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:20:53,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {17288#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17289#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:53,065 INFO L290 TraceCheckUtils]: 46: Hoare triple {17289#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17289#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:20:53,079 INFO L290 TraceCheckUtils]: 47: Hoare triple {17289#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17290#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:20:53,079 INFO L290 TraceCheckUtils]: 48: Hoare triple {17290#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {17290#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:20:53,095 INFO L290 TraceCheckUtils]: 49: Hoare triple {17290#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17291#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:53,096 INFO L290 TraceCheckUtils]: 50: Hoare triple {17291#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {17291#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:20:53,110 INFO L290 TraceCheckUtils]: 51: Hoare triple {17291#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17292#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:20:53,110 INFO L290 TraceCheckUtils]: 52: Hoare triple {17292#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {17292#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:20:53,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {17292#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17293#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:53,127 INFO L290 TraceCheckUtils]: 54: Hoare triple {17293#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17293#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:20:53,144 INFO L290 TraceCheckUtils]: 55: Hoare triple {17293#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17294#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:20:53,144 INFO L290 TraceCheckUtils]: 56: Hoare triple {17294#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17294#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:20:53,158 INFO L290 TraceCheckUtils]: 57: Hoare triple {17294#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17295#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:53,159 INFO L290 TraceCheckUtils]: 58: Hoare triple {17295#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17295#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:20:53,162 INFO L290 TraceCheckUtils]: 59: Hoare triple {17295#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17296#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:20:53,162 INFO L290 TraceCheckUtils]: 60: Hoare triple {17296#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {17296#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:20:53,164 INFO L290 TraceCheckUtils]: 61: Hoare triple {17296#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:53,165 INFO L290 TraceCheckUtils]: 62: Hoare triple {17297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {17297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:20:53,182 INFO L290 TraceCheckUtils]: 63: Hoare triple {17297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17492#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:20:53,183 INFO L290 TraceCheckUtils]: 64: Hoare triple {17492#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {17492#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:20:53,199 INFO L290 TraceCheckUtils]: 65: Hoare triple {17492#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {17499#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:20:53,201 INFO L290 TraceCheckUtils]: 66: Hoare triple {17499#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !(~x~0 % 4294967296 < 268435455); {17265#false} is VALID [2022-04-15 12:20:53,202 INFO L272 TraceCheckUtils]: 67: Hoare triple {17265#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)); {17265#false} is VALID [2022-04-15 12:20:53,202 INFO L290 TraceCheckUtils]: 68: Hoare triple {17265#false} ~cond := #in~cond; {17265#false} is VALID [2022-04-15 12:20:53,202 INFO L290 TraceCheckUtils]: 69: Hoare triple {17265#false} assume 0 == ~cond; {17265#false} is VALID [2022-04-15 12:20:53,202 INFO L290 TraceCheckUtils]: 70: Hoare triple {17265#false} assume !false; {17265#false} is VALID [2022-04-15 12:20:53,202 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:53,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:20:57,251 INFO L290 TraceCheckUtils]: 70: Hoare triple {17265#false} assume !false; {17265#false} is VALID [2022-04-15 12:20:57,251 INFO L290 TraceCheckUtils]: 69: Hoare triple {17265#false} assume 0 == ~cond; {17265#false} is VALID [2022-04-15 12:20:57,252 INFO L290 TraceCheckUtils]: 68: Hoare triple {17265#false} ~cond := #in~cond; {17265#false} is VALID [2022-04-15 12:20:57,252 INFO L272 TraceCheckUtils]: 67: Hoare triple {17265#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)); {17265#false} is VALID [2022-04-15 12:20:57,252 INFO L290 TraceCheckUtils]: 66: Hoare triple {17527#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {17265#false} is VALID [2022-04-15 12:20:57,256 INFO L290 TraceCheckUtils]: 65: Hoare triple {17531#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {17527#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,256 INFO L290 TraceCheckUtils]: 64: Hoare triple {17531#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17531#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,273 INFO L290 TraceCheckUtils]: 63: Hoare triple {17538#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17531#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,273 INFO L290 TraceCheckUtils]: 62: Hoare triple {17538#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17538#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,285 INFO L290 TraceCheckUtils]: 61: Hoare triple {17545#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17538#(< (mod (+ main_~x~0 3) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,286 INFO L290 TraceCheckUtils]: 60: Hoare triple {17545#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17545#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,289 INFO L290 TraceCheckUtils]: 59: Hoare triple {17552#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17545#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,289 INFO L290 TraceCheckUtils]: 58: Hoare triple {17552#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17552#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,291 INFO L290 TraceCheckUtils]: 57: Hoare triple {17559#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17552#(< (mod (+ 5 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,291 INFO L290 TraceCheckUtils]: 56: Hoare triple {17559#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17559#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,309 INFO L290 TraceCheckUtils]: 55: Hoare triple {17566#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17559#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {17566#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17566#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {17573#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17566#(< (mod (+ 7 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,325 INFO L290 TraceCheckUtils]: 52: Hoare triple {17573#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17573#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,343 INFO L290 TraceCheckUtils]: 51: Hoare triple {17580#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17573#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,343 INFO L290 TraceCheckUtils]: 50: Hoare triple {17580#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17580#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,358 INFO L290 TraceCheckUtils]: 49: Hoare triple {17587#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17580#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,359 INFO L290 TraceCheckUtils]: 48: Hoare triple {17587#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17587#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,377 INFO L290 TraceCheckUtils]: 47: Hoare triple {17594#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17587#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,377 INFO L290 TraceCheckUtils]: 46: Hoare triple {17594#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17594#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,380 INFO L290 TraceCheckUtils]: 45: Hoare triple {17601#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17594#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {17601#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17601#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,398 INFO L290 TraceCheckUtils]: 43: Hoare triple {17608#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17601#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,398 INFO L290 TraceCheckUtils]: 42: Hoare triple {17608#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17608#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {17615#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17608#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {17615#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17615#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {17622#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17615#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {17622#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17622#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,426 INFO L290 TraceCheckUtils]: 37: Hoare triple {17629#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17622#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {17629#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17629#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {17636#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17629#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {17636#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17636#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {17643#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17636#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {17643#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17643#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {17650#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17643#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {17650#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17650#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {17657#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17650#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {17657#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17657#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {17664#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17657#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {17664#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17664#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {17671#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17664#(< (mod (+ main_~x~0 21) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {17671#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17671#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {17678#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17671#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {17678#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17678#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {17685#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17678#(< (mod (+ 23 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {17685#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17685#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {17692#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17685#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {17692#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17692#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {17699#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17692#(< (mod (+ main_~x~0 25) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {17699#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17699#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {17706#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17699#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {17706#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17706#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {17713#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17706#(< (mod (+ main_~x~0 27) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {17713#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17713#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {17720#(< (mod (+ 29 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17713#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {17720#(< (mod (+ 29 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17720#(< (mod (+ 29 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {17727#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17720#(< (mod (+ 29 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {17727#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17727#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {17734#(< (mod (+ main_~x~0 31) 4294967296) 268435455)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17727#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {17734#(< (mod (+ main_~x~0 31) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455); {17734#(< (mod (+ main_~x~0 31) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {17264#true} ~x~0 := 0; {17734#(< (mod (+ main_~x~0 31) 4294967296) 268435455)} is VALID [2022-04-15 12:20:57,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {17264#true} call #t~ret5 := main(); {17264#true} is VALID [2022-04-15 12:20:57,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17264#true} {17264#true} #40#return; {17264#true} is VALID [2022-04-15 12:20:57,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {17264#true} assume true; {17264#true} is VALID [2022-04-15 12:20:57,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {17264#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); {17264#true} is VALID [2022-04-15 12:20:57,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {17264#true} call ULTIMATE.init(); {17264#true} is VALID [2022-04-15 12:20:57,529 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:57,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054511203] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:20:57,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:20:57,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2022-04-15 12:20:57,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:57,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1518175205] [2022-04-15 12:20:57,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1518175205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:57,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:57,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 12:20:57,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988355692] [2022-04-15 12:20:57,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:57,530 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:57,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:57,531 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:57,950 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:57,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 12:20:57,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:57,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 12:20:57,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1151, Invalid=3139, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 12:20:57,952 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:21:34,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:34,026 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-04-15 12:21:34,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 12:21:34,027 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:21:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:34,027 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:21:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 83 transitions. [2022-04-15 12:21:34,028 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:21:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 83 transitions. [2022-04-15 12:21:34,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 83 transitions. [2022-04-15 12:21:35,106 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:21:35,106 INFO L225 Difference]: With dead ends: 82 [2022-04-15 12:21:35,107 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 12:21:35,108 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:21:35,108 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:35,108 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 54 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 14.3s Time] [2022-04-15 12:21:35,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 12:21:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-15 12:21:35,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:35,254 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:21:35,254 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:21:35,254 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:21:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:35,255 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2022-04-15 12:21:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-15 12:21:35,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:35,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:35,255 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:21:35,255 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:21:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:35,256 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2022-04-15 12:21:35,256 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-15 12:21:35,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:35,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:35,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:35,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:35,256 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:21:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-04-15 12:21:35,257 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 71 [2022-04-15 12:21:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:35,257 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-04-15 12:21:35,257 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:21:35,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 77 transitions. [2022-04-15 12:21:36,024 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:21:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-15 12:21:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 12:21:36,025 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:36,025 INFO L499 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:36,043 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:21:36,236 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:21:36,236 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:36,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:36,236 INFO L85 PathProgramCache]: Analyzing trace with hash 873699491, now seen corresponding path program 59 times [2022-04-15 12:21:36,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:36,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1303749026] [2022-04-15 12:21:36,385 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:21:36,387 INFO L85 PathProgramCache]: Analyzing trace with hash 469984817, now seen corresponding path program 1 times [2022-04-15 12:21:36,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:36,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886235504] [2022-04-15 12:21:36,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:36,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:21:36,392 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:21:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:21:36,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:21:36,400 INFO L85 PathProgramCache]: Analyzing trace with hash 873699491, now seen corresponding path program 60 times [2022-04-15 12:21:36,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:36,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498925554] [2022-04-15 12:21:36,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:36,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:37,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:37,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {18318#(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); {18282#true} is VALID [2022-04-15 12:21:37,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {18282#true} assume true; {18282#true} is VALID [2022-04-15 12:21:37,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18282#true} {18282#true} #40#return; {18282#true} is VALID [2022-04-15 12:21:37,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {18282#true} call ULTIMATE.init(); {18318#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:37,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {18318#(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); {18282#true} is VALID [2022-04-15 12:21:37,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {18282#true} assume true; {18282#true} is VALID [2022-04-15 12:21:37,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18282#true} {18282#true} #40#return; {18282#true} is VALID [2022-04-15 12:21:37,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {18282#true} call #t~ret5 := main(); {18282#true} is VALID [2022-04-15 12:21:37,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {18282#true} ~x~0 := 0; {18287#(= main_~x~0 0)} is VALID [2022-04-15 12:21:37,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {18287#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {18287#(= main_~x~0 0)} is VALID [2022-04-15 12:21:37,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {18287#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18288#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:21:37,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {18288#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 268435455); {18288#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:21:37,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {18288#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18289#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:21:37,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {18289#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {18289#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:21:37,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {18289#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18290#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:21:37,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {18290#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18290#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:21:37,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {18290#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18291#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:21:37,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {18291#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18291#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:21:37,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {18291#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18292#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:21:37,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {18292#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 268435455); {18292#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:21:37,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {18292#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18293#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:21:37,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {18293#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455); {18293#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:21:37,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {18293#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18294#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:21:37,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {18294#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18294#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:21:37,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {18294#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18295#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:21:37,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {18295#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18295#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:21:37,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {18295#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18296#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:21:37,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {18296#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18296#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:21:37,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {18296#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18297#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:21:37,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {18297#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18297#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:21:37,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {18297#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18298#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:21:37,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {18298#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18298#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:21:37,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {18298#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18299#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:21:37,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {18299#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18299#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:21:37,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {18299#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18300#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:21:37,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {18300#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18300#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:21:37,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {18300#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18301#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:21:37,211 INFO L290 TraceCheckUtils]: 34: Hoare triple {18301#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455); {18301#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:21:37,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {18301#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18302#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:21:37,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {18302#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 268435455); {18302#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:21:37,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {18302#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18303#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:21:37,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {18303#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18303#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:21:37,273 INFO L290 TraceCheckUtils]: 39: Hoare triple {18303#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18304#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:21:37,274 INFO L290 TraceCheckUtils]: 40: Hoare triple {18304#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 268435455); {18304#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:21:37,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {18304#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18305#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:21:37,277 INFO L290 TraceCheckUtils]: 42: Hoare triple {18305#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18305#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:21:37,279 INFO L290 TraceCheckUtils]: 43: Hoare triple {18305#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18306#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:21:37,279 INFO L290 TraceCheckUtils]: 44: Hoare triple {18306#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 268435455); {18306#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:21:37,298 INFO L290 TraceCheckUtils]: 45: Hoare triple {18306#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18307#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:21:37,299 INFO L290 TraceCheckUtils]: 46: Hoare triple {18307#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18307#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:21:37,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {18307#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18308#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:21:37,320 INFO L290 TraceCheckUtils]: 48: Hoare triple {18308#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 268435455); {18308#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:21:37,339 INFO L290 TraceCheckUtils]: 49: Hoare triple {18308#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18309#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:21:37,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {18309#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455); {18309#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:21:37,363 INFO L290 TraceCheckUtils]: 51: Hoare triple {18309#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18310#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:21:37,363 INFO L290 TraceCheckUtils]: 52: Hoare triple {18310#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 268435455); {18310#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:21:37,385 INFO L290 TraceCheckUtils]: 53: Hoare triple {18310#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18311#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:21:37,386 INFO L290 TraceCheckUtils]: 54: Hoare triple {18311#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18311#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:21:37,408 INFO L290 TraceCheckUtils]: 55: Hoare triple {18311#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18312#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:21:37,409 INFO L290 TraceCheckUtils]: 56: Hoare triple {18312#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18312#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:21:37,431 INFO L290 TraceCheckUtils]: 57: Hoare triple {18312#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18313#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:21:37,431 INFO L290 TraceCheckUtils]: 58: Hoare triple {18313#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18313#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:21:37,435 INFO L290 TraceCheckUtils]: 59: Hoare triple {18313#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18314#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:21:37,435 INFO L290 TraceCheckUtils]: 60: Hoare triple {18314#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 268435455); {18314#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:21:37,438 INFO L290 TraceCheckUtils]: 61: Hoare triple {18314#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18315#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:21:37,439 INFO L290 TraceCheckUtils]: 62: Hoare triple {18315#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455); {18315#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:21:37,461 INFO L290 TraceCheckUtils]: 63: Hoare triple {18315#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18316#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:21:37,462 INFO L290 TraceCheckUtils]: 64: Hoare triple {18316#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {18316#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:21:37,465 INFO L290 TraceCheckUtils]: 65: Hoare triple {18316#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18317#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:21:37,466 INFO L290 TraceCheckUtils]: 66: Hoare triple {18317#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 268435455); {18317#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:21:37,470 INFO L290 TraceCheckUtils]: 67: Hoare triple {18317#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {18283#false} is VALID [2022-04-15 12:21:37,470 INFO L290 TraceCheckUtils]: 68: Hoare triple {18283#false} assume !(~x~0 % 4294967296 < 268435455); {18283#false} is VALID [2022-04-15 12:21:37,470 INFO L272 TraceCheckUtils]: 69: Hoare triple {18283#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)); {18283#false} is VALID [2022-04-15 12:21:37,471 INFO L290 TraceCheckUtils]: 70: Hoare triple {18283#false} ~cond := #in~cond; {18283#false} is VALID [2022-04-15 12:21:37,471 INFO L290 TraceCheckUtils]: 71: Hoare triple {18283#false} assume 0 == ~cond; {18283#false} is VALID [2022-04-15 12:21:37,471 INFO L290 TraceCheckUtils]: 72: Hoare triple {18283#false} assume !false; {18283#false} is VALID [2022-04-15 12:21:37,471 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:21:37,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:37,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498925554] [2022-04-15 12:21:37,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498925554] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:21:37,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654175179] [2022-04-15 12:21:37,472 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:21:37,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:21:37,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:21:37,473 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:21:37,473 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:21:37,533 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:21:37,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:21:37,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:21:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:37,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:21:38,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {18282#true} call ULTIMATE.init(); {18282#true} is VALID [2022-04-15 12:21:38,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {18282#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); {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {18282#true} assume true; {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18282#true} {18282#true} #40#return; {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {18282#true} call #t~ret5 := main(); {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {18282#true} ~x~0 := 0; {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 42: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 46: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 47: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 49: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 50: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 51: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 53: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 54: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 55: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 57: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 58: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 59: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,203 INFO L290 TraceCheckUtils]: 60: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,204 INFO L290 TraceCheckUtils]: 61: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,204 INFO L290 TraceCheckUtils]: 62: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,204 INFO L290 TraceCheckUtils]: 63: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:38,204 INFO L290 TraceCheckUtils]: 64: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:38,224 INFO L290 TraceCheckUtils]: 65: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18517#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:21:38,225 INFO L290 TraceCheckUtils]: 66: Hoare triple {18517#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !!(~x~0 % 4294967296 < 268435455); {18517#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-15 12:21:38,226 INFO L290 TraceCheckUtils]: 67: Hoare triple {18517#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {18524#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65520))} is VALID [2022-04-15 12:21:38,227 INFO L290 TraceCheckUtils]: 68: Hoare triple {18524#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65520))} assume !(~x~0 % 4294967296 < 268435455); {18524#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65520))} is VALID [2022-04-15 12:21:38,232 INFO L272 TraceCheckUtils]: 69: Hoare triple {18524#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)) (< (mod (+ main_~x~0 4294967293) 4294967296) 65520))} 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)); {18531#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:21:38,233 INFO L290 TraceCheckUtils]: 70: Hoare triple {18531#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18535#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:21:38,233 INFO L290 TraceCheckUtils]: 71: Hoare triple {18535#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18283#false} is VALID [2022-04-15 12:21:38,233 INFO L290 TraceCheckUtils]: 72: Hoare triple {18283#false} assume !false; {18283#false} is VALID [2022-04-15 12:21:38,234 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:21:38,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:21:39,260 INFO L290 TraceCheckUtils]: 72: Hoare triple {18283#false} assume !false; {18283#false} is VALID [2022-04-15 12:21:39,260 INFO L290 TraceCheckUtils]: 71: Hoare triple {18535#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18283#false} is VALID [2022-04-15 12:21:39,260 INFO L290 TraceCheckUtils]: 70: Hoare triple {18531#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18535#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:21:39,261 INFO L272 TraceCheckUtils]: 69: Hoare triple {18551#(= (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)); {18531#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:21:39,261 INFO L290 TraceCheckUtils]: 68: Hoare triple {18551#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {18551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:21:39,262 INFO L290 TraceCheckUtils]: 67: Hoare triple {18558#(or (< (mod main_~x~0 4294967296) 65520) (= (mod main_~x~0 2) 0))} assume !(~x~0 % 4294967296 < 65520);~x~0 := 2 + ~x~0; {18551#(= (mod main_~x~0 2) 0)} is VALID [2022-04-15 12:21:39,262 INFO L290 TraceCheckUtils]: 66: Hoare triple {18562#(or (< (mod main_~x~0 4294967296) 65520) (not (< (mod main_~x~0 4294967296) 268435455)) (= (mod main_~x~0 2) 0))} assume !!(~x~0 % 4294967296 < 268435455); {18558#(or (< (mod main_~x~0 4294967296) 65520) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:39,292 INFO L290 TraceCheckUtils]: 65: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18562#(or (< (mod main_~x~0 4294967296) 65520) (not (< (mod main_~x~0 4294967296) 268435455)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 64: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 63: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 62: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 61: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 60: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 59: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 58: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 57: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 56: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 55: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 54: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 52: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 51: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 50: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 49: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 48: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 47: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,293 INFO L290 TraceCheckUtils]: 46: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 43: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 42: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 41: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 40: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 39: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 38: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {18282#true} assume ~x~0 % 4294967296 < 65520;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18282#true} is VALID [2022-04-15 12:21:39,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {18282#true} assume !!(~x~0 % 4294967296 < 268435455); {18282#true} is VALID [2022-04-15 12:21:39,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {18282#true} ~x~0 := 0; {18282#true} is VALID [2022-04-15 12:21:39,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {18282#true} call #t~ret5 := main(); {18282#true} is VALID [2022-04-15 12:21:39,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18282#true} {18282#true} #40#return; {18282#true} is VALID [2022-04-15 12:21:39,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {18282#true} assume true; {18282#true} is VALID [2022-04-15 12:21:39,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {18282#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); {18282#true} is VALID [2022-04-15 12:21:39,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {18282#true} call ULTIMATE.init(); {18282#true} is VALID [2022-04-15 12:21:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2022-04-15 12:21:39,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654175179] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 12:21:39,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:21:39,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [34, 6] total 41 [2022-04-15 12:21:39,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:21:39,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1303749026] [2022-04-15 12:21:39,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1303749026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:39,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:39,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:21:39,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916994871] [2022-04-15 12:21:39,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:21:39,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 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:39,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:21:39,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call 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:39,394 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:21:39,394 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:21:39,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:39,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:21:39,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1417, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:21:39,394 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call 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:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:40,270 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-04-15 12:21:40,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:21:40,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 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:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call 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:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-15 12:21:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call 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:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-15 12:21:40,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-04-15 12:21:40,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:40,412 INFO L225 Difference]: With dead ends: 77 [2022-04-15 12:21:40,412 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 12:21:40,412 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=227, Invalid=1495, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:21:40,413 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:40,413 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 24 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:21:40,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 12:21:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 12:21:40,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:40,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:21:40,413 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:21:40,413 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:21:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:40,413 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:21:40,413 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:21:40,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:40,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:40,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 12:21:40,414 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 12:21:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:40,414 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:21:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:21:40,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:40,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:40,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:40,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:21:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 12:21:40,414 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2022-04-15 12:21:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:40,414 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 12:21:40,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call 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:40,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 12:21:40,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:21:40,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:40,417 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 12:21:40,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 12:21:40,633 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:40,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 12:21:41,138 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 12:21:41,138 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 12:21:41,138 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 12:21:41,138 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:21:41,138 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 12:21:41,138 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:21:41,139 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:21:41,139 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 12:21:41,139 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 12:21:41,139 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:21:41,139 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 12 24) the Hoare annotation is: true [2022-04-15 12:21:41,139 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 12 24) the Hoare annotation is: true [2022-04-15 12:21:41,139 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 20) the Hoare annotation is: (or (< (mod main_~x~0 4294967296) 65520) (= (mod main_~x~0 2) 0)) [2022-04-15 12:21:41,139 INFO L878 garLoopResultBuilder]: At program point L16-2(lines 15 21) the Hoare annotation is: (or (< (mod main_~x~0 4294967296) 65520) (= (mod main_~x~0 2) 0)) [2022-04-15 12:21:41,139 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 15 21) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-15 12:21:41,139 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 12 24) the Hoare annotation is: true [2022-04-15 12:21:41,139 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-15 12:21:41,139 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-15 12:21:41,139 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 12:21:41,139 INFO L878 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 12:21:41,139 INFO L885 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-15 12:21:41,139 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 12:21:41,142 INFO L719 BasicCegarLoop]: Path program histogram: [60, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:41,144 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 12:21:41,146 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:21:41,148 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 12:21:41,179 INFO L163 areAnnotationChecker]: CFG has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 12:21:41,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:21:41 BoogieIcfgContainer [2022-04-15 12:21:41,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 12:21:41,185 INFO L158 Benchmark]: Toolchain (without parser) took 257707.39ms. Allocated memory was 163.6MB in the beginning and 287.3MB in the end (delta: 123.7MB). Free memory was 112.4MB in the beginning and 174.6MB in the end (delta: -62.2MB). Peak memory consumption was 145.3MB. Max. memory is 8.0GB. [2022-04-15 12:21:41,185 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory was 128.6MB in the beginning and 128.6MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:21:41,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.66ms. Allocated memory was 163.6MB in the beginning and 239.1MB in the end (delta: 75.5MB). Free memory was 112.2MB in the beginning and 216.0MB in the end (delta: -103.8MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-04-15 12:21:41,185 INFO L158 Benchmark]: Boogie Preprocessor took 29.09ms. Allocated memory is still 239.1MB. Free memory was 216.0MB in the beginning and 214.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 12:21:41,186 INFO L158 Benchmark]: RCFGBuilder took 203.30ms. Allocated memory is still 239.1MB. Free memory was 214.4MB in the beginning and 204.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 12:21:41,186 INFO L158 Benchmark]: TraceAbstraction took 257265.90ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 203.4MB in the beginning and 174.6MB in the end (delta: 28.8MB). Peak memory consumption was 160.4MB. Max. memory is 8.0GB. [2022-04-15 12:21:41,186 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory was 128.6MB in the beginning and 128.6MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.66ms. Allocated memory was 163.6MB in the beginning and 239.1MB in the end (delta: 75.5MB). Free memory was 112.2MB in the beginning and 216.0MB in the end (delta: -103.8MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.09ms. Allocated memory is still 239.1MB. Free memory was 216.0MB in the beginning and 214.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 203.30ms. Allocated memory is still 239.1MB. Free memory was 214.4MB in the beginning and 204.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 257265.90ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 203.4MB in the beginning and 174.6MB in the end (delta: 28.8MB). Peak memory consumption was 160.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 257.2s, OverallIterations: 33, TraceHistogramMax: 31, PathProgramHistogramMax: 60, EmptinessCheckTime: 0.0s, AutomataDifference: 184.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 737 SdHoareTripleChecker+Valid, 70.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 736 mSDsluCounter, 1519 SdHoareTripleChecker+Invalid, 69.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1122 mSDsCounter, 977 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18922 IncrementalHoareTripleChecker+Invalid, 19899 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 977 mSolverCounterUnsat, 397 mSDtfsCounter, 18922 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3747 GetRequests, 2383 SyntacticMatches, 62 SemanticMatches, 1302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5151 ImplicationChecksByTransitivity, 26.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=32, InterpolantAutomatonStates: 569, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 211 PreInvPairs, 346 NumberOfFragments, 62 HoareAnnotationTreeSize, 211 FomulaSimplifications, 588 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 19 FomulaSimplificationsInter, 2436 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: x % 4294967296 < 65520 || x % 2 == 0 - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 12:21:41,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...