/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono3_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:00:54,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:00:54,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:00:54,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:00:54,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:00:54,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:00:54,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:00:54,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:00:54,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:00:54,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:00:54,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:00:54,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:00:54,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:00:54,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:00:54,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:00:54,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:00:54,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:00:54,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:00:54,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:00:54,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:00:54,198 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:00:54,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:00:54,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:00:54,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:00:54,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:00:54,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:00:54,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:00:54,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:00:54,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:00:54,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:00:54,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:00:54,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:00:54,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:00:54,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:00:54,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:00:54,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:00:54,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:00:54,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:00:54,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:00:54,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:00:54,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:00:54,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:00:54,222 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:00:54,252 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:00:54,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:00:54,252 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:00:54,252 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:00:54,253 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:00:54,253 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:00:54,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:00:54,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:00:54,253 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:00:54,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:00:54,253 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:00:54,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:00:54,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:00:54,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:00:54,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:00:54,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:00:54,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:00:54,254 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:00:54,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:00:54,254 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:00:54,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:00:54,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:00:54,254 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:00:54,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:00:54,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:00:54,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:00:54,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:00:54,255 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:00:54,255 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:00:54,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:00:54,255 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:00:54,255 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:00:54,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:00:54,255 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 11:00:54,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:00:54,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:00:54,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:00:54,451 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:00:54,451 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:00:54,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2022-04-27 11:00:54,492 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47fcd741b/a57f4c99ea494d9aa636d1ae5539eacb/FLAGaeb251790 [2022-04-27 11:00:54,836 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:00:54,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2022-04-27 11:00:54,840 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47fcd741b/a57f4c99ea494d9aa636d1ae5539eacb/FLAGaeb251790 [2022-04-27 11:00:54,854 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47fcd741b/a57f4c99ea494d9aa636d1ae5539eacb [2022-04-27 11:00:54,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:00:54,856 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:00:54,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:00:54,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:00:54,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:00:54,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:00:54" (1/1) ... [2022-04-27 11:00:54,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2df0b019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:00:54, skipping insertion in model container [2022-04-27 11:00:54,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:00:54" (1/1) ... [2022-04-27 11:00:54,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:00:54,874 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:00:55,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_1.c[311,324] [2022-04-27 11:00:55,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:00:55,070 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:00:55,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_1.c[311,324] [2022-04-27 11:00:55,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:00:55,093 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:00:55,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:00:55 WrapperNode [2022-04-27 11:00:55,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:00:55,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:00:55,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:00:55,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:00:55,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:00:55" (1/1) ... [2022-04-27 11:00:55,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:00:55" (1/1) ... [2022-04-27 11:00:55,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:00:55" (1/1) ... [2022-04-27 11:00:55,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:00:55" (1/1) ... [2022-04-27 11:00:55,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:00:55" (1/1) ... [2022-04-27 11:00:55,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:00:55" (1/1) ... [2022-04-27 11:00:55,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:00:55" (1/1) ... [2022-04-27 11:00:55,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:00:55,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:00:55,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:00:55,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:00:55,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:00:55" (1/1) ... [2022-04-27 11:00:55,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:00:55,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:00:55,148 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-27 11:00:55,166 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-27 11:00:55,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:00:55,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:00:55,180 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:00:55,180 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:00:55,180 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:00:55,180 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:00:55,180 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:00:55,180 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:00:55,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:00:55,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:00:55,181 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:00:55,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:00:55,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:00:55,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:00:55,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:00:55,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:00:55,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:00:55,218 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:00:55,219 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:00:55,296 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:00:55,300 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:00:55,300 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:00:55,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:00:55 BoogieIcfgContainer [2022-04-27 11:00:55,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:00:55,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:00:55,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:00:55,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:00:55,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:00:54" (1/3) ... [2022-04-27 11:00:55,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2200ab81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:00:55, skipping insertion in model container [2022-04-27 11:00:55,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:00:55" (2/3) ... [2022-04-27 11:00:55,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2200ab81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:00:55, skipping insertion in model container [2022-04-27 11:00:55,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:00:55" (3/3) ... [2022-04-27 11:00:55,308 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono3_1.c [2022-04-27 11:00:55,316 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:00:55,316 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:00:55,343 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:00:55,347 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3058d01e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4877ff90 [2022-04-27 11:00:55,348 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:00:55,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:00:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:00:55,356 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:00:55,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:00:55,357 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:00:55,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:00:55,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1326077006, now seen corresponding path program 1 times [2022-04-27 11:00:55,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:00:55,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101340894] [2022-04-27 11:00:55,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:00:55,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:00:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:55,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:00:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:55,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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(10, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-27 11:00:55,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:00:55,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-27 11:00:55,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:00:55,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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(10, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-27 11:00:55,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:00:55,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-27 11:00:55,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret7 := main(); {23#true} is VALID [2022-04-27 11:00:55,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0;~y~0 := 0; {23#true} is VALID [2022-04-27 11:00:55,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-27 11:00:55,484 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {24#false} is VALID [2022-04-27 11:00:55,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-27 11:00:55,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-27 11:00:55,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 11:00:55,485 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-27 11:00:55,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:00:55,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101340894] [2022-04-27 11:00:55,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101340894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:00:55,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:00:55,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:00:55,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102339266] [2022-04-27 11:00:55,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:00:55,490 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-27 11:00:55,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:00:55,493 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-27 11:00:55,505 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-27 11:00:55,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:00:55,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:00:55,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:00:55,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:00:55,519 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:55,604 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-27 11:00:55,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:00:55,605 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-27 11:00:55,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:00:55,605 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-27 11:00:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 11:00:55,610 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-27 11:00:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 11:00:55,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-27 11:00:55,672 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-27 11:00:55,679 INFO L225 Difference]: With dead ends: 31 [2022-04-27 11:00:55,679 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 11:00:55,681 INFO L412 NwaCegarLoop]: 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-27 11:00:55,683 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:00:55,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:00:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 11:00:55,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 11:00:55,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:00:55,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:55,703 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:55,704 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:55,712 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 11:00:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 11:00:55,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:00:55,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:00:55,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 11:00:55,715 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 11:00:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:55,718 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 11:00:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 11:00:55,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:00:55,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:00:55,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:00:55,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:00:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 11:00:55,721 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-27 11:00:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:00:55,722 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 11:00:55,722 INFO L496 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-27 11:00:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 11:00:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:00:55,723 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:00:55,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:00:55,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:00:55,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:00:55,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:00:55,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 1 times [2022-04-27 11:00:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:00:55,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937222316] [2022-04-27 11:00:55,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:00:55,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:00:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:55,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:00:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:55,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#(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(10, 2);call #Ultimate.allocInit(12, 3); {120#true} is VALID [2022-04-27 11:00:55,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} assume true; {120#true} is VALID [2022-04-27 11:00:55,817 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120#true} {120#true} #41#return; {120#true} is VALID [2022-04-27 11:00:55,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {120#true} call ULTIMATE.init(); {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:00:55,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#(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(10, 2);call #Ultimate.allocInit(12, 3); {120#true} is VALID [2022-04-27 11:00:55,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {120#true} assume true; {120#true} is VALID [2022-04-27 11:00:55,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120#true} {120#true} #41#return; {120#true} is VALID [2022-04-27 11:00:55,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {120#true} call #t~ret7 := main(); {120#true} is VALID [2022-04-27 11:00:55,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#true} ~x~0 := 0;~y~0 := 0; {125#(= main_~x~0 0)} is VALID [2022-04-27 11:00:55,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {125#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 1000000); {121#false} is VALID [2022-04-27 11:00:55,821 INFO L272 TraceCheckUtils]: 7: Hoare triple {121#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {121#false} is VALID [2022-04-27 11:00:55,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {121#false} ~cond := #in~cond; {121#false} is VALID [2022-04-27 11:00:55,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {121#false} assume 0 == ~cond; {121#false} is VALID [2022-04-27 11:00:55,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {121#false} assume !false; {121#false} is VALID [2022-04-27 11:00:55,822 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-27 11:00:55,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:00:55,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937222316] [2022-04-27 11:00:55,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937222316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:00:55,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:00:55,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:00:55,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754495993] [2022-04-27 11:00:55,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:00:55,825 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-27 11:00:55,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:00:55,826 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-27 11:00:55,838 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-27 11:00:55,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:00:55,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:00:55,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:00:55,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:00:55,840 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:55,913 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 11:00:55,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:00:55,914 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-27 11:00:55,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:00:55,914 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-27 11:00:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-27 11:00:55,916 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-27 11:00:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-27 11:00:55,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-04-27 11:00:55,942 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-27 11:00:55,944 INFO L225 Difference]: With dead ends: 25 [2022-04-27 11:00:55,944 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 11:00:55,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:00:55,949 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:00:55,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:00:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 11:00:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-27 11:00:55,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:00:55,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:55,957 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:55,958 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:55,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:55,958 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 11:00:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 11:00:55,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:00:55,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:00:55,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:00:55,959 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:00:55,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:55,960 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 11:00:55,960 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 11:00:55,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:00:55,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:00:55,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:00:55,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:00:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-27 11:00:55,961 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-27 11:00:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:00:55,961 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-27 11:00:55,962 INFO L496 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-27 11:00:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 11:00:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:00:55,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:00:55,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:00:55,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:00:55,962 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:00:55,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:00:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash 644646283, now seen corresponding path program 1 times [2022-04-27 11:00:55,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:00:55,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369784935] [2022-04-27 11:00:55,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:00:55,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:00:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:56,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:00:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:56,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#(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(10, 2);call #Ultimate.allocInit(12, 3); {225#true} is VALID [2022-04-27 11:00:56,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#true} assume true; {225#true} is VALID [2022-04-27 11:00:56,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {225#true} {225#true} #41#return; {225#true} is VALID [2022-04-27 11:00:56,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:00:56,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(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(10, 2);call #Ultimate.allocInit(12, 3); {225#true} is VALID [2022-04-27 11:00:56,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2022-04-27 11:00:56,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #41#return; {225#true} is VALID [2022-04-27 11:00:56,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret7 := main(); {225#true} is VALID [2022-04-27 11:00:56,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#true} ~x~0 := 0;~y~0 := 0; {230#(= main_~x~0 0)} is VALID [2022-04-27 11:00:56,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {230#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 1000000); {230#(= main_~x~0 0)} is VALID [2022-04-27 11:00:56,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {230#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {230#(= main_~x~0 0)} is VALID [2022-04-27 11:00:56,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {230#(= main_~x~0 0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {231#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:00:56,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 1000000); {226#false} is VALID [2022-04-27 11:00:56,094 INFO L272 TraceCheckUtils]: 10: Hoare triple {226#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {226#false} is VALID [2022-04-27 11:00:56,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {226#false} ~cond := #in~cond; {226#false} is VALID [2022-04-27 11:00:56,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#false} assume 0 == ~cond; {226#false} is VALID [2022-04-27 11:00:56,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {226#false} assume !false; {226#false} is VALID [2022-04-27 11:00:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:00:56,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:00:56,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369784935] [2022-04-27 11:00:56,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369784935] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:00:56,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166722369] [2022-04-27 11:00:56,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:00:56,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:00:56,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:00:56,108 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-27 11:00:56,109 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-27 11:00:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:56,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:00:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:56,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:00:56,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2022-04-27 11:00:56,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#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(10, 2);call #Ultimate.allocInit(12, 3); {225#true} is VALID [2022-04-27 11:00:56,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2022-04-27 11:00:56,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #41#return; {225#true} is VALID [2022-04-27 11:00:56,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret7 := main(); {225#true} is VALID [2022-04-27 11:00:56,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#true} ~x~0 := 0;~y~0 := 0; {251#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:00:56,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {251#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 < 1000000); {251#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:00:56,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {251#(and (= main_~x~0 0) (= main_~y~0 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {258#(and (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-27 11:00:56,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {258#(and (= main_~x~0 0) (= main_~y~0 1))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {262#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 11:00:56,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {262#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1))} assume !(~x~0 % 4294967296 < 1000000); {226#false} is VALID [2022-04-27 11:00:56,313 INFO L272 TraceCheckUtils]: 10: Hoare triple {226#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {226#false} is VALID [2022-04-27 11:00:56,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {226#false} ~cond := #in~cond; {226#false} is VALID [2022-04-27 11:00:56,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#false} assume 0 == ~cond; {226#false} is VALID [2022-04-27 11:00:56,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {226#false} assume !false; {226#false} is VALID [2022-04-27 11:00:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:00:56,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:00:56,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {226#false} assume !false; {226#false} is VALID [2022-04-27 11:00:56,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {281#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {226#false} is VALID [2022-04-27 11:00:56,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {285#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {281#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:00:56,500 INFO L272 TraceCheckUtils]: 10: Hoare triple {289#(not (= (mod main_~y~0 4294967296) 0))} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {285#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:00:56,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#(or (not (= (mod main_~y~0 4294967296) 0)) (< (mod main_~x~0 4294967296) 1000000))} assume !(~x~0 % 4294967296 < 1000000); {289#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:00:56,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {297#(or (not (= (mod main_~y~0 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {293#(or (not (= (mod main_~y~0 4294967296) 0)) (< (mod main_~x~0 4294967296) 1000000))} is VALID [2022-04-27 11:00:56,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#(or (not (= (mod (+ main_~y~0 1) 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {297#(or (not (= (mod main_~y~0 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} is VALID [2022-04-27 11:00:56,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {301#(or (not (= (mod (+ main_~y~0 1) 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} assume !!(~x~0 % 4294967296 < 1000000); {301#(or (not (= (mod (+ main_~y~0 1) 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} is VALID [2022-04-27 11:00:56,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#true} ~x~0 := 0;~y~0 := 0; {301#(or (not (= (mod (+ main_~y~0 1) 4294967296) 0)) (< (mod (+ main_~x~0 1) 4294967296) 1000000))} is VALID [2022-04-27 11:00:56,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret7 := main(); {225#true} is VALID [2022-04-27 11:00:56,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #41#return; {225#true} is VALID [2022-04-27 11:00:56,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2022-04-27 11:00:56,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#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(10, 2);call #Ultimate.allocInit(12, 3); {225#true} is VALID [2022-04-27 11:00:56,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2022-04-27 11:00:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:00:56,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166722369] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:00:56,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:00:56,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 8] total 14 [2022-04-27 11:00:56,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071226209] [2022-04-27 11:00:56,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:00:56,507 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:00:56,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:00:56,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:56,529 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-27 11:00:56,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:00:56,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:00:56,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:00:56,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:00:56,532 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:56,930 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-27 11:00:56,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 11:00:56,931 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:00:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:00:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2022-04-27 11:00:56,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2022-04-27 11:00:56,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 44 transitions. [2022-04-27 11:00:56,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:00:56,980 INFO L225 Difference]: With dead ends: 37 [2022-04-27 11:00:56,980 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 11:00:56,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:00:56,981 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:00:56,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 41 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:00:56,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 11:00:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-04-27 11:00:56,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:00:56,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:56,985 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:56,985 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:56,986 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 11:00:56,986 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 11:00:56,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:00:56,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:00:56,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-27 11:00:56,987 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-27 11:00:56,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:56,988 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 11:00:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 11:00:56,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:00:56,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:00:56,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:00:56,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:00:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-27 11:00:56,989 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-04-27 11:00:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:00:56,989 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-27 11:00:56,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-27 11:00:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:00:56,990 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:00:56,990 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:00:57,022 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-27 11:00:57,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:00:57,204 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:00:57,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:00:57,204 INFO L85 PathProgramCache]: Analyzing trace with hash -896593651, now seen corresponding path program 1 times [2022-04-27 11:00:57,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:00:57,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495729216] [2022-04-27 11:00:57,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:00:57,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:00:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:57,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:00:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:57,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {490#(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(10, 2);call #Ultimate.allocInit(12, 3); {482#true} is VALID [2022-04-27 11:00:57,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#true} assume true; {482#true} is VALID [2022-04-27 11:00:57,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {482#true} {482#true} #41#return; {482#true} is VALID [2022-04-27 11:00:57,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {482#true} call ULTIMATE.init(); {490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:00:57,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#(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(10, 2);call #Ultimate.allocInit(12, 3); {482#true} is VALID [2022-04-27 11:00:57,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#true} assume true; {482#true} is VALID [2022-04-27 11:00:57,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} #41#return; {482#true} is VALID [2022-04-27 11:00:57,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {482#true} call #t~ret7 := main(); {482#true} is VALID [2022-04-27 11:00:57,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {482#true} ~x~0 := 0;~y~0 := 0; {487#(= main_~x~0 0)} is VALID [2022-04-27 11:00:57,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {487#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 1000000); {487#(= main_~x~0 0)} is VALID [2022-04-27 11:00:57,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {487#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {487#(= main_~x~0 0)} is VALID [2022-04-27 11:00:57,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {487#(= main_~x~0 0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {488#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:00:57,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {488#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 1000000); {488#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:00:57,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {488#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {488#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:00:57,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {488#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {489#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 11:00:57,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {489#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {489#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 11:00:57,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {489#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {483#false} is VALID [2022-04-27 11:00:57,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {483#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {483#false} is VALID [2022-04-27 11:00:57,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {483#false} assume !(~x~0 % 4294967296 < 1000000); {483#false} is VALID [2022-04-27 11:00:57,289 INFO L272 TraceCheckUtils]: 16: Hoare triple {483#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {483#false} is VALID [2022-04-27 11:00:57,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {483#false} ~cond := #in~cond; {483#false} is VALID [2022-04-27 11:00:57,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {483#false} assume 0 == ~cond; {483#false} is VALID [2022-04-27 11:00:57,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {483#false} assume !false; {483#false} is VALID [2022-04-27 11:00:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:00:57,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:00:57,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495729216] [2022-04-27 11:00:57,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495729216] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:00:57,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425969098] [2022-04-27 11:00:57,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:00:57,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:00:57,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:00:57,298 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-27 11:00:57,299 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-27 11:00:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:57,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:00:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:57,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:00:57,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {482#true} call ULTIMATE.init(); {482#true} is VALID [2022-04-27 11:00:57,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#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(10, 2);call #Ultimate.allocInit(12, 3); {482#true} is VALID [2022-04-27 11:00:57,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#true} assume true; {482#true} is VALID [2022-04-27 11:00:57,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} #41#return; {482#true} is VALID [2022-04-27 11:00:57,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {482#true} call #t~ret7 := main(); {482#true} is VALID [2022-04-27 11:00:57,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {482#true} ~x~0 := 0;~y~0 := 0; {509#(= main_~y~0 0)} is VALID [2022-04-27 11:00:57,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {509#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 < 1000000); {509#(= main_~y~0 0)} is VALID [2022-04-27 11:00:57,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {509#(= main_~y~0 0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {516#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:00:57,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {516#(= (+ (- 1) main_~y~0) 0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {516#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:00:57,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#(= (+ (- 1) main_~y~0) 0)} assume !!(~x~0 % 4294967296 < 1000000); {516#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:00:57,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {516#(= (+ (- 1) main_~y~0) 0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {526#(= main_~y~0 2)} is VALID [2022-04-27 11:00:57,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {526#(= main_~y~0 2)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {526#(= main_~y~0 2)} is VALID [2022-04-27 11:00:57,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {526#(= main_~y~0 2)} assume !!(~x~0 % 4294967296 < 1000000); {526#(= main_~y~0 2)} is VALID [2022-04-27 11:00:57,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {526#(= main_~y~0 2)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {516#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:00:57,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {516#(= (+ (- 1) main_~y~0) 0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {516#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:00:57,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {516#(= (+ (- 1) main_~y~0) 0)} assume !(~x~0 % 4294967296 < 1000000); {516#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:00:57,484 INFO L272 TraceCheckUtils]: 16: Hoare triple {516#(= (+ (- 1) main_~y~0) 0)} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {545#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:00:57,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {545#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {549#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:00:57,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {549#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {483#false} is VALID [2022-04-27 11:00:57,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {483#false} assume !false; {483#false} is VALID [2022-04-27 11:00:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:00:57,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:00:57,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {483#false} assume !false; {483#false} is VALID [2022-04-27 11:00:57,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {549#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {483#false} is VALID [2022-04-27 11:00:57,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {545#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {549#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:00:57,618 INFO L272 TraceCheckUtils]: 16: Hoare triple {565#(not (= (mod main_~y~0 4294967296) 0))} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {545#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:00:57,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {565#(not (= (mod main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 < 1000000); {565#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:00:57,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {565#(not (= (mod main_~y~0 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {565#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:00:57,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {565#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:00:57,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {575#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:00:57,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {575#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {575#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:00:57,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {565#(not (= (mod main_~y~0 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {575#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:00:57,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {565#(not (= (mod main_~y~0 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {565#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:00:57,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {565#(not (= (mod main_~y~0 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {565#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:00:57,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {594#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {565#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:00:57,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {594#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {594#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-27 11:00:57,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {482#true} ~x~0 := 0;~y~0 := 0; {594#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-27 11:00:57,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {482#true} call #t~ret7 := main(); {482#true} is VALID [2022-04-27 11:00:57,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} #41#return; {482#true} is VALID [2022-04-27 11:00:57,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#true} assume true; {482#true} is VALID [2022-04-27 11:00:57,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#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(10, 2);call #Ultimate.allocInit(12, 3); {482#true} is VALID [2022-04-27 11:00:57,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {482#true} call ULTIMATE.init(); {482#true} is VALID [2022-04-27 11:00:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:00:57,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425969098] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:00:57,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:00:57,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-04-27 11:00:57,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470072405] [2022-04-27 11:00:57,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:00:57,625 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:00:57,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:00:57,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:57,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:00:57,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:00:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:00:57,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:00:57,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:00:57,657 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:58,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:58,250 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-04-27 11:00:58,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 11:00:58,250 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:00:58,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:00:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2022-04-27 11:00:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2022-04-27 11:00:58,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 65 transitions. [2022-04-27 11:00:58,319 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-27 11:00:58,320 INFO L225 Difference]: With dead ends: 59 [2022-04-27 11:00:58,320 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 11:00:58,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2022-04-27 11:00:58,322 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:00:58,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 62 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:00:58,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 11:00:58,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-04-27 11:00:58,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:00:58,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:58,336 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:58,336 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:58,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:58,338 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-27 11:00:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-27 11:00:58,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:00:58,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:00:58,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-27 11:00:58,339 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-27 11:00:58,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:58,340 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-27 11:00:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-27 11:00:58,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:00:58,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:00:58,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:00:58,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:00:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-27 11:00:58,342 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 20 [2022-04-27 11:00:58,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:00:58,342 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-27 11:00:58,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:58,342 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-27 11:00:58,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 11:00:58,343 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:00:58,343 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:00:58,359 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-27 11:00:58,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 11:00:58,557 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:00:58,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:00:58,557 INFO L85 PathProgramCache]: Analyzing trace with hash 936659019, now seen corresponding path program 2 times [2022-04-27 11:00:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:00:58,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166211352] [2022-04-27 11:00:58,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:00:58,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:00:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:58,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:00:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:58,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {889#(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(10, 2);call #Ultimate.allocInit(12, 3); {880#true} is VALID [2022-04-27 11:00:58,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-27 11:00:58,711 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {880#true} {880#true} #41#return; {880#true} is VALID [2022-04-27 11:00:58,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {889#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:00:58,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {889#(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(10, 2);call #Ultimate.allocInit(12, 3); {880#true} is VALID [2022-04-27 11:00:58,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-27 11:00:58,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} #41#return; {880#true} is VALID [2022-04-27 11:00:58,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} call #t~ret7 := main(); {880#true} is VALID [2022-04-27 11:00:58,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} ~x~0 := 0;~y~0 := 0; {885#(= main_~x~0 0)} is VALID [2022-04-27 11:00:58,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {885#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 1000000); {885#(= main_~x~0 0)} is VALID [2022-04-27 11:00:58,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {885#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {885#(= main_~x~0 0)} is VALID [2022-04-27 11:00:58,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {885#(= main_~x~0 0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {886#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:00:58,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {886#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 1000000); {886#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:00:58,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {886#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {886#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:00:58,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {886#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {887#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:00:58,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {887#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {887#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:00:58,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {887#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {887#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:00:58,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {887#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {888#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-27 11:00:58,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {888#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !!(~x~0 % 4294967296 < 1000000); {888#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-27 11:00:58,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {888#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {881#false} is VALID [2022-04-27 11:00:58,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {881#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {881#false} is VALID [2022-04-27 11:00:58,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#false} assume !!(~x~0 % 4294967296 < 1000000); {881#false} is VALID [2022-04-27 11:00:58,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {881#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {881#false} is VALID [2022-04-27 11:00:58,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {881#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {881#false} is VALID [2022-04-27 11:00:58,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#false} assume !(~x~0 % 4294967296 < 1000000); {881#false} is VALID [2022-04-27 11:00:58,721 INFO L272 TraceCheckUtils]: 22: Hoare triple {881#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {881#false} is VALID [2022-04-27 11:00:58,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {881#false} ~cond := #in~cond; {881#false} is VALID [2022-04-27 11:00:58,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {881#false} assume 0 == ~cond; {881#false} is VALID [2022-04-27 11:00:58,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-04-27 11:00:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:00:58,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:00:58,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166211352] [2022-04-27 11:00:58,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166211352] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:00:58,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883047834] [2022-04-27 11:00:58,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:00:58,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:00:58,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:00:58,723 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-27 11:00:58,753 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-27 11:00:58,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:00:58,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:00:58,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 11:00:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:58,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:00:58,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {880#true} is VALID [2022-04-27 11:00:58,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#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(10, 2);call #Ultimate.allocInit(12, 3); {880#true} is VALID [2022-04-27 11:00:58,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-27 11:00:58,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} #41#return; {880#true} is VALID [2022-04-27 11:00:58,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} call #t~ret7 := main(); {880#true} is VALID [2022-04-27 11:00:58,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} ~x~0 := 0;~y~0 := 0; {908#(= main_~y~0 0)} is VALID [2022-04-27 11:00:58,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {908#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 < 1000000); {908#(= main_~y~0 0)} is VALID [2022-04-27 11:00:58,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {908#(= main_~y~0 0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {915#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:00:58,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {915#(= (+ (- 1) main_~y~0) 0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {915#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:00:58,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {915#(= (+ (- 1) main_~y~0) 0)} assume !!(~x~0 % 4294967296 < 1000000); {915#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:00:58,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {915#(= (+ (- 1) main_~y~0) 0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {925#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-27 11:00:58,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {925#(= (+ (- 2) main_~y~0) 0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {925#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-27 11:00:58,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {925#(= (+ (- 2) main_~y~0) 0)} assume !!(~x~0 % 4294967296 < 1000000); {925#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-27 11:00:58,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {925#(= (+ (- 2) main_~y~0) 0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {935#(= (+ main_~y~0 (- 3)) 0)} is VALID [2022-04-27 11:00:58,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {935#(= (+ main_~y~0 (- 3)) 0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {935#(= (+ main_~y~0 (- 3)) 0)} is VALID [2022-04-27 11:00:58,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {935#(= (+ main_~y~0 (- 3)) 0)} assume !!(~x~0 % 4294967296 < 1000000); {935#(= (+ main_~y~0 (- 3)) 0)} is VALID [2022-04-27 11:00:58,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {935#(= (+ main_~y~0 (- 3)) 0)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {925#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-27 11:00:58,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {925#(= (+ (- 2) main_~y~0) 0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {925#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-27 11:00:58,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {925#(= (+ (- 2) main_~y~0) 0)} assume !!(~x~0 % 4294967296 < 1000000); {925#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-27 11:00:58,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {925#(= (+ (- 2) main_~y~0) 0)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {915#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:00:58,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {915#(= (+ (- 1) main_~y~0) 0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {915#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:00:58,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {915#(= (+ (- 1) main_~y~0) 0)} assume !(~x~0 % 4294967296 < 1000000); {915#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:00:58,911 INFO L272 TraceCheckUtils]: 22: Hoare triple {915#(= (+ (- 1) main_~y~0) 0)} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:00:58,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {963#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:00:58,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {881#false} is VALID [2022-04-27 11:00:58,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-04-27 11:00:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 11:00:58,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:00:59,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-04-27 11:00:59,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {881#false} is VALID [2022-04-27 11:00:59,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {963#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:00:59,071 INFO L272 TraceCheckUtils]: 22: Hoare triple {983#(not (= (mod main_~y~0 4294967296) 0))} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:00:59,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {983#(not (= (mod main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 < 1000000); {983#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:00:59,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {983#(not (= (mod main_~y~0 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {983#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:00:59,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {983#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:00:59,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:00:59,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:00:59,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {1003#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:00:59,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {1003#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {1003#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:00:59,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {1003#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1003#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:00:59,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1003#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:00:59,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:00:59,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:00:59,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {983#(not (= (mod main_~y~0 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {993#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:00:59,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {983#(not (= (mod main_~y~0 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {983#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:00:59,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {983#(not (= (mod main_~y~0 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {983#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:00:59,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {1031#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {983#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:00:59,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {1031#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {1031#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-27 11:00:59,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} ~x~0 := 0;~y~0 := 0; {1031#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-27 11:00:59,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} call #t~ret7 := main(); {880#true} is VALID [2022-04-27 11:00:59,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} #41#return; {880#true} is VALID [2022-04-27 11:00:59,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-27 11:00:59,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#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(10, 2);call #Ultimate.allocInit(12, 3); {880#true} is VALID [2022-04-27 11:00:59,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {880#true} is VALID [2022-04-27 11:00:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 11:00:59,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883047834] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:00:59,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:00:59,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2022-04-27 11:00:59,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002247180] [2022-04-27 11:00:59,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:00:59,083 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:00:59,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:00:59,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:59,124 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-27 11:00:59,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 11:00:59,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:00:59,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 11:00:59,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:00:59,124 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:59,864 INFO L93 Difference]: Finished difference Result 110 states and 140 transitions. [2022-04-27 11:00:59,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-27 11:00:59,864 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:00:59,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:00:59,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 88 transitions. [2022-04-27 11:00:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 88 transitions. [2022-04-27 11:00:59,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 88 transitions. [2022-04-27 11:00:59,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:00:59,949 INFO L225 Difference]: With dead ends: 110 [2022-04-27 11:00:59,949 INFO L226 Difference]: Without dead ends: 80 [2022-04-27 11:00:59,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 11:00:59,950 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:00:59,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 54 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:00:59,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-27 11:00:59,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2022-04-27 11:00:59,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:00:59,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:59,970 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:59,970 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:59,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:59,972 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2022-04-27 11:00:59,972 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2022-04-27 11:00:59,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:00:59,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:00:59,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-27 11:00:59,973 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-27 11:00:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:59,974 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2022-04-27 11:00:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2022-04-27 11:00:59,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:00:59,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:00:59,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:00:59,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:00:59,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-04-27 11:00:59,977 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 26 [2022-04-27 11:00:59,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:00:59,977 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-04-27 11:00:59,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:59,977 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-04-27 11:00:59,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:00:59,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:00:59,978 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:00:59,996 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-27 11:01:00,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:01:00,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:01:00,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:01:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1035528781, now seen corresponding path program 3 times [2022-04-27 11:01:00,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:01:00,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138060252] [2022-04-27 11:01:00,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:01:00,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:01:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:00,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:01:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:00,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1492#true} is VALID [2022-04-27 11:01:00,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {1492#true} assume true; {1492#true} is VALID [2022-04-27 11:01:00,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1492#true} {1492#true} #41#return; {1492#true} is VALID [2022-04-27 11:01:00,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {1492#true} call ULTIMATE.init(); {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:01:00,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {1502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1492#true} is VALID [2022-04-27 11:01:00,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {1492#true} assume true; {1492#true} is VALID [2022-04-27 11:01:00,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1492#true} {1492#true} #41#return; {1492#true} is VALID [2022-04-27 11:01:00,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {1492#true} call #t~ret7 := main(); {1492#true} is VALID [2022-04-27 11:01:00,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {1492#true} ~x~0 := 0;~y~0 := 0; {1497#(= main_~x~0 0)} is VALID [2022-04-27 11:01:00,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {1497#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 1000000); {1497#(= main_~x~0 0)} is VALID [2022-04-27 11:01:00,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {1497#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1497#(= main_~x~0 0)} is VALID [2022-04-27 11:01:00,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {1497#(= main_~x~0 0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1498#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:01:00,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {1498#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 1000000); {1498#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:01:00,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {1498#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1498#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:01:00,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {1498#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1499#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:01:00,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {1499#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {1499#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:01:00,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {1499#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1499#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:01:00,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {1499#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1500#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:01:00,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {1500#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1500#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:01:00,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {1500#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1500#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:01:00,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {1500#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1501#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:01:00,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {1501#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 1000000); {1501#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:01:00,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {1501#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {1493#false} is VALID [2022-04-27 11:01:00,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {1493#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1493#false} is VALID [2022-04-27 11:01:00,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {1493#false} assume !!(~x~0 % 4294967296 < 1000000); {1493#false} is VALID [2022-04-27 11:01:00,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {1493#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {1493#false} is VALID [2022-04-27 11:01:00,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {1493#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1493#false} is VALID [2022-04-27 11:01:00,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {1493#false} assume !!(~x~0 % 4294967296 < 1000000); {1493#false} is VALID [2022-04-27 11:01:00,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {1493#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {1493#false} is VALID [2022-04-27 11:01:00,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {1493#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1493#false} is VALID [2022-04-27 11:01:00,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {1493#false} assume !(~x~0 % 4294967296 < 1000000); {1493#false} is VALID [2022-04-27 11:01:00,388 INFO L272 TraceCheckUtils]: 28: Hoare triple {1493#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {1493#false} is VALID [2022-04-27 11:01:00,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {1493#false} ~cond := #in~cond; {1493#false} is VALID [2022-04-27 11:01:00,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {1493#false} assume 0 == ~cond; {1493#false} is VALID [2022-04-27 11:01:00,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {1493#false} assume !false; {1493#false} is VALID [2022-04-27 11:01:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 37 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:01:00,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:01:00,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138060252] [2022-04-27 11:01:00,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138060252] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:01:00,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877806373] [2022-04-27 11:01:00,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:01:00,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:01:00,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:01:00,392 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-27 11:01:00,393 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-27 11:01:00,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-04-27 11:01:00,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:01:00,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 11:01:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:00,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:01:00,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {1492#true} call ULTIMATE.init(); {1492#true} is VALID [2022-04-27 11:01:00,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {1492#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(10, 2);call #Ultimate.allocInit(12, 3); {1492#true} is VALID [2022-04-27 11:01:00,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {1492#true} assume true; {1492#true} is VALID [2022-04-27 11:01:00,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1492#true} {1492#true} #41#return; {1492#true} is VALID [2022-04-27 11:01:00,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {1492#true} call #t~ret7 := main(); {1492#true} is VALID [2022-04-27 11:01:00,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {1492#true} ~x~0 := 0;~y~0 := 0; {1492#true} is VALID [2022-04-27 11:01:00,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {1492#true} assume !!(~x~0 % 4294967296 < 1000000); {1492#true} is VALID [2022-04-27 11:01:00,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {1492#true} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1492#true} is VALID [2022-04-27 11:01:00,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {1492#true} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1492#true} is VALID [2022-04-27 11:01:00,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {1492#true} assume !!(~x~0 % 4294967296 < 1000000); {1492#true} is VALID [2022-04-27 11:01:00,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {1492#true} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1492#true} is VALID [2022-04-27 11:01:00,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {1492#true} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1492#true} is VALID [2022-04-27 11:01:00,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {1492#true} assume !!(~x~0 % 4294967296 < 1000000); {1492#true} is VALID [2022-04-27 11:01:00,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {1492#true} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1492#true} is VALID [2022-04-27 11:01:00,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {1492#true} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1492#true} is VALID [2022-04-27 11:01:00,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {1492#true} assume !!(~x~0 % 4294967296 < 1000000); {1492#true} is VALID [2022-04-27 11:01:00,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {1492#true} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1554#(< (mod main_~x~0 4294967296) 500000)} is VALID [2022-04-27 11:01:00,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {1554#(< (mod main_~x~0 4294967296) 500000)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1558#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2022-04-27 11:01:00,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {1558#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} assume !!(~x~0 % 4294967296 < 1000000); {1558#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2022-04-27 11:01:00,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {1558#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {1558#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2022-04-27 11:01:00,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {1558#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1568#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} is VALID [2022-04-27 11:01:00,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {1568#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} assume !!(~x~0 % 4294967296 < 1000000); {1568#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} is VALID [2022-04-27 11:01:00,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {1568#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {1568#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} is VALID [2022-04-27 11:01:00,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {1568#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1578#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} is VALID [2022-04-27 11:01:00,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {1578#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} assume !!(~x~0 % 4294967296 < 1000000); {1578#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} is VALID [2022-04-27 11:01:00,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {1578#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {1578#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} is VALID [2022-04-27 11:01:00,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {1578#(< (mod (+ main_~x~0 4294967293) 4294967296) 500000)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1588#(< (mod (+ 4294967292 main_~x~0) 4294967296) 500000)} is VALID [2022-04-27 11:01:00,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {1588#(< (mod (+ 4294967292 main_~x~0) 4294967296) 500000)} assume !(~x~0 % 4294967296 < 1000000); {1493#false} is VALID [2022-04-27 11:01:00,739 INFO L272 TraceCheckUtils]: 28: Hoare triple {1493#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {1493#false} is VALID [2022-04-27 11:01:00,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {1493#false} ~cond := #in~cond; {1493#false} is VALID [2022-04-27 11:01:00,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {1493#false} assume 0 == ~cond; {1493#false} is VALID [2022-04-27 11:01:00,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {1493#false} assume !false; {1493#false} is VALID [2022-04-27 11:01:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:01:00,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:01:01,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {1493#false} assume !false; {1493#false} is VALID [2022-04-27 11:01:01,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {1493#false} assume 0 == ~cond; {1493#false} is VALID [2022-04-27 11:01:01,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {1493#false} ~cond := #in~cond; {1493#false} is VALID [2022-04-27 11:01:01,043 INFO L272 TraceCheckUtils]: 28: Hoare triple {1493#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {1493#false} is VALID [2022-04-27 11:01:01,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {1616#(< (mod main_~x~0 4294967296) 1000000)} assume !(~x~0 % 4294967296 < 1000000); {1493#false} is VALID [2022-04-27 11:01:01,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {1620#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1616#(< (mod main_~x~0 4294967296) 1000000)} is VALID [2022-04-27 11:01:01,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {1620#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {1620#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} is VALID [2022-04-27 11:01:01,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {1620#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} assume !!(~x~0 % 4294967296 < 1000000); {1620#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} is VALID [2022-04-27 11:01:01,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {1630#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1620#(< (mod (+ main_~x~0 1) 4294967296) 1000000)} is VALID [2022-04-27 11:01:01,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {1630#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {1630#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} is VALID [2022-04-27 11:01:01,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {1630#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} assume !!(~x~0 % 4294967296 < 1000000); {1630#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} is VALID [2022-04-27 11:01:01,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {1640#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1630#(< (mod (+ main_~x~0 2) 4294967296) 1000000)} is VALID [2022-04-27 11:01:01,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {1640#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {1640#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} is VALID [2022-04-27 11:01:01,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {1640#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} assume !!(~x~0 % 4294967296 < 1000000); {1640#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} is VALID [2022-04-27 11:01:01,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {1650#(< (mod (+ main_~x~0 4) 4294967296) 1000000)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1640#(< (mod (+ main_~x~0 3) 4294967296) 1000000)} is VALID [2022-04-27 11:01:01,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {1492#true} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1650#(< (mod (+ main_~x~0 4) 4294967296) 1000000)} is VALID [2022-04-27 11:01:01,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {1492#true} assume !!(~x~0 % 4294967296 < 1000000); {1492#true} is VALID [2022-04-27 11:01:01,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {1492#true} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1492#true} is VALID [2022-04-27 11:01:01,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {1492#true} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1492#true} is VALID [2022-04-27 11:01:01,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {1492#true} assume !!(~x~0 % 4294967296 < 1000000); {1492#true} is VALID [2022-04-27 11:01:01,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {1492#true} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1492#true} is VALID [2022-04-27 11:01:01,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {1492#true} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1492#true} is VALID [2022-04-27 11:01:01,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {1492#true} assume !!(~x~0 % 4294967296 < 1000000); {1492#true} is VALID [2022-04-27 11:01:01,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {1492#true} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {1492#true} is VALID [2022-04-27 11:01:01,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {1492#true} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {1492#true} is VALID [2022-04-27 11:01:01,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {1492#true} assume !!(~x~0 % 4294967296 < 1000000); {1492#true} is VALID [2022-04-27 11:01:01,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {1492#true} ~x~0 := 0;~y~0 := 0; {1492#true} is VALID [2022-04-27 11:01:01,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {1492#true} call #t~ret7 := main(); {1492#true} is VALID [2022-04-27 11:01:01,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1492#true} {1492#true} #41#return; {1492#true} is VALID [2022-04-27 11:01:01,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {1492#true} assume true; {1492#true} is VALID [2022-04-27 11:01:01,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {1492#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(10, 2);call #Ultimate.allocInit(12, 3); {1492#true} is VALID [2022-04-27 11:01:01,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {1492#true} call ULTIMATE.init(); {1492#true} is VALID [2022-04-27 11:01:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:01:01,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877806373] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:01:01,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:01:01,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-04-27 11:01:01,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062646897] [2022-04-27 11:01:01,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:01:01,051 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:01:01,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:01:01,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:01,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:01:01,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 11:01:01,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:01:01,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 11:01:01,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:01:01,089 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:02,617 INFO L93 Difference]: Finished difference Result 148 states and 200 transitions. [2022-04-27 11:01:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 11:01:02,617 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:01:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:01:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2022-04-27 11:01:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2022-04-27 11:01:02,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 98 transitions. [2022-04-27 11:01:02,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:01:02,771 INFO L225 Difference]: With dead ends: 148 [2022-04-27 11:01:02,771 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 11:01:02,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=477, Invalid=1083, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 11:01:02,773 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 166 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:01:02,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 38 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:01:02,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 11:01:02,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 57. [2022-04-27 11:01:02,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:01:02,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:02,806 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:02,807 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:02,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:02,810 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-27 11:01:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-27 11:01:02,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:02,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:02,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-27 11:01:02,814 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-27 11:01:02,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:02,820 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-27 11:01:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-27 11:01:02,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:02,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:02,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:01:02,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:01:02,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2022-04-27 11:01:02,823 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 32 [2022-04-27 11:01:02,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:01:02,823 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2022-04-27 11:01:02,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:02,823 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2022-04-27 11:01:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 11:01:02,826 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:01:02,826 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:01:02,845 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-27 11:01:03,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:01:03,030 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:01:03,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:01:03,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2055597069, now seen corresponding path program 4 times [2022-04-27 11:01:03,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:01:03,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808049321] [2022-04-27 11:01:03,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:01:03,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:01:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:03,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:01:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:03,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {2267#(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(10, 2);call #Ultimate.allocInit(12, 3); {2255#true} is VALID [2022-04-27 11:01:03,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {2255#true} assume true; {2255#true} is VALID [2022-04-27 11:01:03,209 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2255#true} {2255#true} #41#return; {2255#true} is VALID [2022-04-27 11:01:03,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {2255#true} call ULTIMATE.init(); {2267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:01:03,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {2267#(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(10, 2);call #Ultimate.allocInit(12, 3); {2255#true} is VALID [2022-04-27 11:01:03,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {2255#true} assume true; {2255#true} is VALID [2022-04-27 11:01:03,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2255#true} {2255#true} #41#return; {2255#true} is VALID [2022-04-27 11:01:03,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {2255#true} call #t~ret7 := main(); {2255#true} is VALID [2022-04-27 11:01:03,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {2255#true} ~x~0 := 0;~y~0 := 0; {2260#(= main_~x~0 0)} is VALID [2022-04-27 11:01:03,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {2260#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 1000000); {2260#(= main_~x~0 0)} is VALID [2022-04-27 11:01:03,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {2260#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2260#(= main_~x~0 0)} is VALID [2022-04-27 11:01:03,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(= main_~x~0 0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:01:03,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 1000000); {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:01:03,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:01:03,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:01:03,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:01:03,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:01:03,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:01:03,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:01:03,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:01:03,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:01:03,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:01:03,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:01:03,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:01:03,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:01:03,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:01:03,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2266#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-27 11:01:03,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {2266#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 1000000); {2266#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-27 11:01:03,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {2266#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2256#false} is VALID [2022-04-27 11:01:03,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {2256#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2256#false} is VALID [2022-04-27 11:01:03,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {2256#false} assume !!(~x~0 % 4294967296 < 1000000); {2256#false} is VALID [2022-04-27 11:01:03,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {2256#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2256#false} is VALID [2022-04-27 11:01:03,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {2256#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2256#false} is VALID [2022-04-27 11:01:03,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {2256#false} assume !!(~x~0 % 4294967296 < 1000000); {2256#false} is VALID [2022-04-27 11:01:03,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {2256#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2256#false} is VALID [2022-04-27 11:01:03,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {2256#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2256#false} is VALID [2022-04-27 11:01:03,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {2256#false} assume !!(~x~0 % 4294967296 < 1000000); {2256#false} is VALID [2022-04-27 11:01:03,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {2256#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2256#false} is VALID [2022-04-27 11:01:03,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {2256#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2256#false} is VALID [2022-04-27 11:01:03,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {2256#false} assume !!(~x~0 % 4294967296 < 1000000); {2256#false} is VALID [2022-04-27 11:01:03,219 INFO L290 TraceCheckUtils]: 37: Hoare triple {2256#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2256#false} is VALID [2022-04-27 11:01:03,219 INFO L290 TraceCheckUtils]: 38: Hoare triple {2256#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2256#false} is VALID [2022-04-27 11:01:03,219 INFO L290 TraceCheckUtils]: 39: Hoare triple {2256#false} assume !!(~x~0 % 4294967296 < 1000000); {2256#false} is VALID [2022-04-27 11:01:03,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {2256#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2256#false} is VALID [2022-04-27 11:01:03,219 INFO L290 TraceCheckUtils]: 41: Hoare triple {2256#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2256#false} is VALID [2022-04-27 11:01:03,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {2256#false} assume !!(~x~0 % 4294967296 < 1000000); {2256#false} is VALID [2022-04-27 11:01:03,219 INFO L290 TraceCheckUtils]: 43: Hoare triple {2256#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2256#false} is VALID [2022-04-27 11:01:03,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {2256#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2256#false} is VALID [2022-04-27 11:01:03,220 INFO L290 TraceCheckUtils]: 45: Hoare triple {2256#false} assume !!(~x~0 % 4294967296 < 1000000); {2256#false} is VALID [2022-04-27 11:01:03,220 INFO L290 TraceCheckUtils]: 46: Hoare triple {2256#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2256#false} is VALID [2022-04-27 11:01:03,220 INFO L290 TraceCheckUtils]: 47: Hoare triple {2256#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2256#false} is VALID [2022-04-27 11:01:03,220 INFO L290 TraceCheckUtils]: 48: Hoare triple {2256#false} assume !!(~x~0 % 4294967296 < 1000000); {2256#false} is VALID [2022-04-27 11:01:03,220 INFO L290 TraceCheckUtils]: 49: Hoare triple {2256#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2256#false} is VALID [2022-04-27 11:01:03,220 INFO L290 TraceCheckUtils]: 50: Hoare triple {2256#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2256#false} is VALID [2022-04-27 11:01:03,220 INFO L290 TraceCheckUtils]: 51: Hoare triple {2256#false} assume !(~x~0 % 4294967296 < 1000000); {2256#false} is VALID [2022-04-27 11:01:03,220 INFO L272 TraceCheckUtils]: 52: Hoare triple {2256#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {2256#false} is VALID [2022-04-27 11:01:03,220 INFO L290 TraceCheckUtils]: 53: Hoare triple {2256#false} ~cond := #in~cond; {2256#false} is VALID [2022-04-27 11:01:03,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {2256#false} assume 0 == ~cond; {2256#false} is VALID [2022-04-27 11:01:03,220 INFO L290 TraceCheckUtils]: 55: Hoare triple {2256#false} assume !false; {2256#false} is VALID [2022-04-27 11:01:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 173 proven. 57 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-27 11:01:03,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:01:03,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808049321] [2022-04-27 11:01:03,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808049321] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:01:03,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930420285] [2022-04-27 11:01:03,221 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:01:03,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:01:03,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:01:03,222 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-27 11:01:03,244 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-27 11:01:03,267 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:01:03,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:01:03,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 11:01:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:03,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:01:03,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {2255#true} call ULTIMATE.init(); {2255#true} is VALID [2022-04-27 11:01:03,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {2255#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(10, 2);call #Ultimate.allocInit(12, 3); {2255#true} is VALID [2022-04-27 11:01:03,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {2255#true} assume true; {2255#true} is VALID [2022-04-27 11:01:03,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2255#true} {2255#true} #41#return; {2255#true} is VALID [2022-04-27 11:01:03,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {2255#true} call #t~ret7 := main(); {2255#true} is VALID [2022-04-27 11:01:03,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {2255#true} ~x~0 := 0;~y~0 := 0; {2260#(= main_~x~0 0)} is VALID [2022-04-27 11:01:03,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {2260#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 1000000); {2260#(= main_~x~0 0)} is VALID [2022-04-27 11:01:03,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {2260#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2260#(= main_~x~0 0)} is VALID [2022-04-27 11:01:03,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(= main_~x~0 0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:01:03,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 1000000); {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:01:03,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:01:03,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {2261#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:01:03,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:01:03,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:01:03,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {2262#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:01:03,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:01:03,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:01:03,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {2263#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:01:03,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:01:03,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:01:03,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {2264#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:01:03,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:01:03,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:01:03,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {2265#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2340#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:01:03,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {2340#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 1000000); {2340#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:01:03,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {2340#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2340#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:01:03,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {2340#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2350#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:01:03,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {2350#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2350#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:01:03,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {2350#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2350#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:01:03,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {2350#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2360#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:01:03,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {2360#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2360#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:01:03,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {2360#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2360#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:01:03,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {2360#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2370#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:01:03,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {2370#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2370#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:01:03,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {2370#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2370#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:01:03,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {2370#(and (<= main_~x~0 9) (<= 9 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2380#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:01:03,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {2380#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2380#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:01:03,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {2380#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2380#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:01:03,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {2380#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2390#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:01:03,757 INFO L290 TraceCheckUtils]: 39: Hoare triple {2390#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2390#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:01:03,757 INFO L290 TraceCheckUtils]: 40: Hoare triple {2390#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2390#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:01:03,758 INFO L290 TraceCheckUtils]: 41: Hoare triple {2390#(and (<= main_~x~0 11) (<= 11 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2400#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:01:03,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {2400#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2400#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:01:03,759 INFO L290 TraceCheckUtils]: 43: Hoare triple {2400#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2256#false} is VALID [2022-04-27 11:01:03,759 INFO L290 TraceCheckUtils]: 44: Hoare triple {2256#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2256#false} is VALID [2022-04-27 11:01:03,759 INFO L290 TraceCheckUtils]: 45: Hoare triple {2256#false} assume !!(~x~0 % 4294967296 < 1000000); {2256#false} is VALID [2022-04-27 11:01:03,759 INFO L290 TraceCheckUtils]: 46: Hoare triple {2256#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2256#false} is VALID [2022-04-27 11:01:03,759 INFO L290 TraceCheckUtils]: 47: Hoare triple {2256#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2256#false} is VALID [2022-04-27 11:01:03,759 INFO L290 TraceCheckUtils]: 48: Hoare triple {2256#false} assume !!(~x~0 % 4294967296 < 1000000); {2256#false} is VALID [2022-04-27 11:01:03,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {2256#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2256#false} is VALID [2022-04-27 11:01:03,759 INFO L290 TraceCheckUtils]: 50: Hoare triple {2256#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2256#false} is VALID [2022-04-27 11:01:03,759 INFO L290 TraceCheckUtils]: 51: Hoare triple {2256#false} assume !(~x~0 % 4294967296 < 1000000); {2256#false} is VALID [2022-04-27 11:01:03,759 INFO L272 TraceCheckUtils]: 52: Hoare triple {2256#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {2256#false} is VALID [2022-04-27 11:01:03,760 INFO L290 TraceCheckUtils]: 53: Hoare triple {2256#false} ~cond := #in~cond; {2256#false} is VALID [2022-04-27 11:01:03,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {2256#false} assume 0 == ~cond; {2256#false} is VALID [2022-04-27 11:01:03,760 INFO L290 TraceCheckUtils]: 55: Hoare triple {2256#false} assume !false; {2256#false} is VALID [2022-04-27 11:01:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 101 proven. 222 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:01:03,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:01:04,526 INFO L290 TraceCheckUtils]: 55: Hoare triple {2256#false} assume !false; {2256#false} is VALID [2022-04-27 11:01:04,526 INFO L290 TraceCheckUtils]: 54: Hoare triple {2256#false} assume 0 == ~cond; {2256#false} is VALID [2022-04-27 11:01:04,526 INFO L290 TraceCheckUtils]: 53: Hoare triple {2256#false} ~cond := #in~cond; {2256#false} is VALID [2022-04-27 11:01:04,527 INFO L272 TraceCheckUtils]: 52: Hoare triple {2256#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {2256#false} is VALID [2022-04-27 11:01:04,527 INFO L290 TraceCheckUtils]: 51: Hoare triple {2256#false} assume !(~x~0 % 4294967296 < 1000000); {2256#false} is VALID [2022-04-27 11:01:04,527 INFO L290 TraceCheckUtils]: 50: Hoare triple {2256#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2256#false} is VALID [2022-04-27 11:01:04,527 INFO L290 TraceCheckUtils]: 49: Hoare triple {2256#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2256#false} is VALID [2022-04-27 11:01:04,527 INFO L290 TraceCheckUtils]: 48: Hoare triple {2256#false} assume !!(~x~0 % 4294967296 < 1000000); {2256#false} is VALID [2022-04-27 11:01:04,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {2256#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2256#false} is VALID [2022-04-27 11:01:04,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {2256#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2256#false} is VALID [2022-04-27 11:01:04,527 INFO L290 TraceCheckUtils]: 45: Hoare triple {2256#false} assume !!(~x~0 % 4294967296 < 1000000); {2256#false} is VALID [2022-04-27 11:01:04,527 INFO L290 TraceCheckUtils]: 44: Hoare triple {2256#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2256#false} is VALID [2022-04-27 11:01:04,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {2479#(< (mod main_~x~0 4294967296) 500000)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2256#false} is VALID [2022-04-27 11:01:04,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {2483#(or (< (mod main_~x~0 4294967296) 500000) (not (< (mod main_~x~0 4294967296) 1000000)))} assume !!(~x~0 % 4294967296 < 1000000); {2479#(< (mod main_~x~0 4294967296) 500000)} is VALID [2022-04-27 11:01:04,529 INFO L290 TraceCheckUtils]: 41: Hoare triple {2487#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2483#(or (< (mod main_~x~0 4294967296) 500000) (not (< (mod main_~x~0 4294967296) 1000000)))} is VALID [2022-04-27 11:01:04,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {2487#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2487#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {2487#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} assume !!(~x~0 % 4294967296 < 1000000); {2487#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {2497#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2487#(or (not (< (mod (+ main_~x~0 1) 4294967296) 1000000)) (< (mod (+ main_~x~0 1) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {2497#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2497#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {2497#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} assume !!(~x~0 % 4294967296 < 1000000); {2497#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {2507#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2497#(or (not (< (mod (+ main_~x~0 2) 4294967296) 1000000)) (< (mod (+ main_~x~0 2) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {2507#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2507#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} is VALID [2022-04-27 11:01:04,535 INFO L290 TraceCheckUtils]: 33: Hoare triple {2507#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} assume !!(~x~0 % 4294967296 < 1000000); {2507#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} is VALID [2022-04-27 11:01:04,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {2517#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2507#(or (< (mod (+ main_~x~0 3) 4294967296) 500000) (not (< (mod (+ main_~x~0 3) 4294967296) 1000000)))} is VALID [2022-04-27 11:01:04,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {2517#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2517#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} is VALID [2022-04-27 11:01:04,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {2517#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} assume !!(~x~0 % 4294967296 < 1000000); {2517#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} is VALID [2022-04-27 11:01:04,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {2527#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2517#(or (< (mod (+ main_~x~0 4) 4294967296) 500000) (not (< (mod (+ main_~x~0 4) 4294967296) 1000000)))} is VALID [2022-04-27 11:01:04,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {2527#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2527#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {2527#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} assume !!(~x~0 % 4294967296 < 1000000); {2527#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {2537#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2527#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 1000000)) (< (mod (+ 5 main_~x~0) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {2537#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {2537#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {2537#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} assume !!(~x~0 % 4294967296 < 1000000); {2537#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {2547#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2537#(or (not (< (mod (+ main_~x~0 6) 4294967296) 1000000)) (< (mod (+ main_~x~0 6) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {2547#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2547#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} is VALID [2022-04-27 11:01:04,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {2547#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} assume !!(~x~0 % 4294967296 < 1000000); {2547#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} is VALID [2022-04-27 11:01:04,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {2557#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2547#(or (< (mod (+ 7 main_~x~0) 4294967296) 500000) (not (< (mod (+ 7 main_~x~0) 4294967296) 1000000)))} is VALID [2022-04-27 11:01:04,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {2557#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2557#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} is VALID [2022-04-27 11:01:04,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {2557#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} assume !!(~x~0 % 4294967296 < 1000000); {2557#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} is VALID [2022-04-27 11:01:04,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {2567#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2557#(or (< (mod (+ main_~x~0 8) 4294967296) 500000) (not (< (mod (+ main_~x~0 8) 4294967296) 1000000)))} is VALID [2022-04-27 11:01:04,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {2567#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2567#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {2567#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} assume !!(~x~0 % 4294967296 < 1000000); {2567#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {2577#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2567#(or (not (< (mod (+ main_~x~0 9) 4294967296) 1000000)) (< (mod (+ main_~x~0 9) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {2577#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2577#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {2577#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} assume !!(~x~0 % 4294967296 < 1000000); {2577#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {2587#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2577#(or (not (< (mod (+ main_~x~0 10) 4294967296) 1000000)) (< (mod (+ main_~x~0 10) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {2587#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2587#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {2587#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} assume !!(~x~0 % 4294967296 < 1000000); {2587#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {2597#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {2587#(or (not (< (mod (+ main_~x~0 11) 4294967296) 1000000)) (< (mod (+ main_~x~0 11) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {2597#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {2597#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {2597#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} assume !!(~x~0 % 4294967296 < 1000000); {2597#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {2255#true} ~x~0 := 0;~y~0 := 0; {2597#(or (not (< (mod (+ main_~x~0 12) 4294967296) 1000000)) (< (mod (+ main_~x~0 12) 4294967296) 500000))} is VALID [2022-04-27 11:01:04,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {2255#true} call #t~ret7 := main(); {2255#true} is VALID [2022-04-27 11:01:04,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2255#true} {2255#true} #41#return; {2255#true} is VALID [2022-04-27 11:01:04,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {2255#true} assume true; {2255#true} is VALID [2022-04-27 11:01:04,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {2255#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(10, 2);call #Ultimate.allocInit(12, 3); {2255#true} is VALID [2022-04-27 11:01:04,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {2255#true} call ULTIMATE.init(); {2255#true} is VALID [2022-04-27 11:01:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 101 proven. 222 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:01:04,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930420285] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:01:04,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:01:04,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 16] total 31 [2022-04-27 11:01:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088509193] [2022-04-27 11:01:04,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:01:04,553 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-27 11:01:04,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:01:04,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:04,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:01:04,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-27 11:01:04,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:01:04,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-27 11:01:04,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:01:04,628 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:16,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:16,825 INFO L93 Difference]: Finished difference Result 151 states and 189 transitions. [2022-04-27 11:01:16,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-27 11:01:16,825 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-27 11:01:16,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:01:16,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 122 transitions. [2022-04-27 11:01:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 122 transitions. [2022-04-27 11:01:16,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 122 transitions. [2022-04-27 11:01:16,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:01:16,969 INFO L225 Difference]: With dead ends: 151 [2022-04-27 11:01:16,969 INFO L226 Difference]: Without dead ends: 117 [2022-04-27 11:01:16,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=924, Invalid=2382, Unknown=0, NotChecked=0, Total=3306 [2022-04-27 11:01:16,970 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 205 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:01:16,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 84 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:01:16,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-27 11:01:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-04-27 11:01:17,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:01:17,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:17,083 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:17,083 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:17,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:17,085 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-04-27 11:01:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2022-04-27 11:01:17,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:17,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:17,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-27 11:01:17,086 INFO L87 Difference]: Start difference. First operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-27 11:01:17,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:17,088 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-04-27 11:01:17,088 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2022-04-27 11:01:17,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:17,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:17,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:01:17,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:01:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:17,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2022-04-27 11:01:17,090 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 56 [2022-04-27 11:01:17,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:01:17,090 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2022-04-27 11:01:17,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:17,091 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2022-04-27 11:01:17,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-27 11:01:17,100 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:01:17,100 INFO L195 NwaCegarLoop]: trace histogram [35, 35, 26, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:01:17,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 11:01:17,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:01:17,316 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:01:17,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:01:17,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1986231821, now seen corresponding path program 5 times [2022-04-27 11:01:17,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:01:17,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895310021] [2022-04-27 11:01:17,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:01:17,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:01:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:18,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:01:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:18,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {3308#(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(10, 2);call #Ultimate.allocInit(12, 3); {3276#true} is VALID [2022-04-27 11:01:18,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {3276#true} assume true; {3276#true} is VALID [2022-04-27 11:01:18,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3276#true} {3276#true} #41#return; {3276#true} is VALID [2022-04-27 11:01:18,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {3276#true} call ULTIMATE.init(); {3308#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:01:18,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {3308#(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(10, 2);call #Ultimate.allocInit(12, 3); {3276#true} is VALID [2022-04-27 11:01:18,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {3276#true} assume true; {3276#true} is VALID [2022-04-27 11:01:18,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3276#true} {3276#true} #41#return; {3276#true} is VALID [2022-04-27 11:01:18,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {3276#true} call #t~ret7 := main(); {3276#true} is VALID [2022-04-27 11:01:18,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {3276#true} ~x~0 := 0;~y~0 := 0; {3281#(= main_~x~0 0)} is VALID [2022-04-27 11:01:18,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {3281#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 1000000); {3281#(= main_~x~0 0)} is VALID [2022-04-27 11:01:18,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {3281#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3281#(= main_~x~0 0)} is VALID [2022-04-27 11:01:18,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {3281#(= main_~x~0 0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3282#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:01:18,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {3282#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 1000000); {3282#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:01:18,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {3282#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3282#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:01:18,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {3282#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:01:18,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {3283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {3283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:01:18,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {3283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:01:18,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {3283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3284#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:01:18,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {3284#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {3284#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:01:18,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {3284#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3284#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:01:18,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {3284#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:01:18,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {3285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {3285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:01:18,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {3285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:01:18,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {3285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3286#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:01:18,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {3286#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {3286#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:01:18,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {3286#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3286#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:01:18,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {3286#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3287#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:01:18,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {3287#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 1000000); {3287#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:01:18,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {3287#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3287#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:01:18,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {3287#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3288#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:01:18,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {3288#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {3288#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:01:18,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {3288#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3288#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:01:18,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {3288#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3289#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:01:18,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {3289#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:01:18,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3289#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:01:18,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {3289#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3290#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:01:18,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {3290#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {3290#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:01:18,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {3290#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3290#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:01:18,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {3290#(and (<= main_~x~0 9) (<= 9 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:01:18,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:01:18,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:01:18,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3292#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:01:18,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {3292#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {3292#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:01:18,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {3292#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3292#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:01:18,040 INFO L290 TraceCheckUtils]: 41: Hoare triple {3292#(and (<= main_~x~0 11) (<= 11 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3293#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:01:18,040 INFO L290 TraceCheckUtils]: 42: Hoare triple {3293#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {3293#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:01:18,041 INFO L290 TraceCheckUtils]: 43: Hoare triple {3293#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3293#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:01:18,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {3293#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3294#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:01:18,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {3294#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {3294#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:01:18,042 INFO L290 TraceCheckUtils]: 46: Hoare triple {3294#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3294#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:01:18,042 INFO L290 TraceCheckUtils]: 47: Hoare triple {3294#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3295#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:01:18,043 INFO L290 TraceCheckUtils]: 48: Hoare triple {3295#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 1000000); {3295#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:01:18,043 INFO L290 TraceCheckUtils]: 49: Hoare triple {3295#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3295#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:01:18,043 INFO L290 TraceCheckUtils]: 50: Hoare triple {3295#(and (<= 14 main_~x~0) (<= main_~x~0 14))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3296#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:01:18,044 INFO L290 TraceCheckUtils]: 51: Hoare triple {3296#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 1000000); {3296#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:01:18,044 INFO L290 TraceCheckUtils]: 52: Hoare triple {3296#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3296#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:01:18,045 INFO L290 TraceCheckUtils]: 53: Hoare triple {3296#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3297#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:01:18,045 INFO L290 TraceCheckUtils]: 54: Hoare triple {3297#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {3297#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:01:18,045 INFO L290 TraceCheckUtils]: 55: Hoare triple {3297#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3297#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:01:18,046 INFO L290 TraceCheckUtils]: 56: Hoare triple {3297#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3298#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:01:18,046 INFO L290 TraceCheckUtils]: 57: Hoare triple {3298#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 1000000); {3298#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:01:18,046 INFO L290 TraceCheckUtils]: 58: Hoare triple {3298#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3298#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:01:18,047 INFO L290 TraceCheckUtils]: 59: Hoare triple {3298#(and (<= 17 main_~x~0) (<= main_~x~0 17))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3299#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:01:18,047 INFO L290 TraceCheckUtils]: 60: Hoare triple {3299#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {3299#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:01:18,048 INFO L290 TraceCheckUtils]: 61: Hoare triple {3299#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3299#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:01:18,048 INFO L290 TraceCheckUtils]: 62: Hoare triple {3299#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3300#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:01:18,048 INFO L290 TraceCheckUtils]: 63: Hoare triple {3300#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 1000000); {3300#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:01:18,049 INFO L290 TraceCheckUtils]: 64: Hoare triple {3300#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3300#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:01:18,049 INFO L290 TraceCheckUtils]: 65: Hoare triple {3300#(and (<= 19 main_~x~0) (<= main_~x~0 19))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3301#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 11:01:18,050 INFO L290 TraceCheckUtils]: 66: Hoare triple {3301#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {3301#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 11:01:18,050 INFO L290 TraceCheckUtils]: 67: Hoare triple {3301#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3301#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 11:01:18,050 INFO L290 TraceCheckUtils]: 68: Hoare triple {3301#(and (<= main_~x~0 20) (<= 20 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3302#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 11:01:18,051 INFO L290 TraceCheckUtils]: 69: Hoare triple {3302#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 1000000); {3302#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 11:01:18,051 INFO L290 TraceCheckUtils]: 70: Hoare triple {3302#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3302#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 11:01:18,051 INFO L290 TraceCheckUtils]: 71: Hoare triple {3302#(and (<= 21 main_~x~0) (<= main_~x~0 21))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3303#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 11:01:18,052 INFO L290 TraceCheckUtils]: 72: Hoare triple {3303#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 1000000); {3303#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 11:01:18,052 INFO L290 TraceCheckUtils]: 73: Hoare triple {3303#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3303#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 11:01:18,053 INFO L290 TraceCheckUtils]: 74: Hoare triple {3303#(and (<= 22 main_~x~0) (<= main_~x~0 22))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3304#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 11:01:18,053 INFO L290 TraceCheckUtils]: 75: Hoare triple {3304#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 1000000); {3304#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 11:01:18,053 INFO L290 TraceCheckUtils]: 76: Hoare triple {3304#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3304#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 11:01:18,054 INFO L290 TraceCheckUtils]: 77: Hoare triple {3304#(and (<= 23 main_~x~0) (<= main_~x~0 23))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3305#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 11:01:18,054 INFO L290 TraceCheckUtils]: 78: Hoare triple {3305#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {3305#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 11:01:18,054 INFO L290 TraceCheckUtils]: 79: Hoare triple {3305#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3305#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 11:01:18,055 INFO L290 TraceCheckUtils]: 80: Hoare triple {3305#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3306#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 11:01:18,055 INFO L290 TraceCheckUtils]: 81: Hoare triple {3306#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {3306#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 11:01:18,056 INFO L290 TraceCheckUtils]: 82: Hoare triple {3306#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3306#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 11:01:18,056 INFO L290 TraceCheckUtils]: 83: Hoare triple {3306#(and (<= main_~x~0 25) (<= 25 main_~x~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3307#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-27 11:01:18,056 INFO L290 TraceCheckUtils]: 84: Hoare triple {3307#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 1000000); {3307#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-27 11:01:18,057 INFO L290 TraceCheckUtils]: 85: Hoare triple {3307#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3277#false} is VALID [2022-04-27 11:01:18,057 INFO L290 TraceCheckUtils]: 86: Hoare triple {3277#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3277#false} is VALID [2022-04-27 11:01:18,057 INFO L290 TraceCheckUtils]: 87: Hoare triple {3277#false} assume !!(~x~0 % 4294967296 < 1000000); {3277#false} is VALID [2022-04-27 11:01:18,057 INFO L290 TraceCheckUtils]: 88: Hoare triple {3277#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3277#false} is VALID [2022-04-27 11:01:18,057 INFO L290 TraceCheckUtils]: 89: Hoare triple {3277#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3277#false} is VALID [2022-04-27 11:01:18,057 INFO L290 TraceCheckUtils]: 90: Hoare triple {3277#false} assume !!(~x~0 % 4294967296 < 1000000); {3277#false} is VALID [2022-04-27 11:01:18,057 INFO L290 TraceCheckUtils]: 91: Hoare triple {3277#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3277#false} is VALID [2022-04-27 11:01:18,057 INFO L290 TraceCheckUtils]: 92: Hoare triple {3277#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3277#false} is VALID [2022-04-27 11:01:18,057 INFO L290 TraceCheckUtils]: 93: Hoare triple {3277#false} assume !!(~x~0 % 4294967296 < 1000000); {3277#false} is VALID [2022-04-27 11:01:18,057 INFO L290 TraceCheckUtils]: 94: Hoare triple {3277#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3277#false} is VALID [2022-04-27 11:01:18,058 INFO L290 TraceCheckUtils]: 95: Hoare triple {3277#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3277#false} is VALID [2022-04-27 11:01:18,058 INFO L290 TraceCheckUtils]: 96: Hoare triple {3277#false} assume !!(~x~0 % 4294967296 < 1000000); {3277#false} is VALID [2022-04-27 11:01:18,058 INFO L290 TraceCheckUtils]: 97: Hoare triple {3277#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3277#false} is VALID [2022-04-27 11:01:18,058 INFO L290 TraceCheckUtils]: 98: Hoare triple {3277#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3277#false} is VALID [2022-04-27 11:01:18,058 INFO L290 TraceCheckUtils]: 99: Hoare triple {3277#false} assume !!(~x~0 % 4294967296 < 1000000); {3277#false} is VALID [2022-04-27 11:01:18,058 INFO L290 TraceCheckUtils]: 100: Hoare triple {3277#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3277#false} is VALID [2022-04-27 11:01:18,058 INFO L290 TraceCheckUtils]: 101: Hoare triple {3277#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3277#false} is VALID [2022-04-27 11:01:18,058 INFO L290 TraceCheckUtils]: 102: Hoare triple {3277#false} assume !!(~x~0 % 4294967296 < 1000000); {3277#false} is VALID [2022-04-27 11:01:18,058 INFO L290 TraceCheckUtils]: 103: Hoare triple {3277#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3277#false} is VALID [2022-04-27 11:01:18,058 INFO L290 TraceCheckUtils]: 104: Hoare triple {3277#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3277#false} is VALID [2022-04-27 11:01:18,058 INFO L290 TraceCheckUtils]: 105: Hoare triple {3277#false} assume !!(~x~0 % 4294967296 < 1000000); {3277#false} is VALID [2022-04-27 11:01:18,058 INFO L290 TraceCheckUtils]: 106: Hoare triple {3277#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3277#false} is VALID [2022-04-27 11:01:18,058 INFO L290 TraceCheckUtils]: 107: Hoare triple {3277#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3277#false} is VALID [2022-04-27 11:01:18,058 INFO L290 TraceCheckUtils]: 108: Hoare triple {3277#false} assume !!(~x~0 % 4294967296 < 1000000); {3277#false} is VALID [2022-04-27 11:01:18,058 INFO L290 TraceCheckUtils]: 109: Hoare triple {3277#false} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3277#false} is VALID [2022-04-27 11:01:18,059 INFO L290 TraceCheckUtils]: 110: Hoare triple {3277#false} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3277#false} is VALID [2022-04-27 11:01:18,059 INFO L290 TraceCheckUtils]: 111: Hoare triple {3277#false} assume !(~x~0 % 4294967296 < 1000000); {3277#false} is VALID [2022-04-27 11:01:18,059 INFO L272 TraceCheckUtils]: 112: Hoare triple {3277#false} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {3277#false} is VALID [2022-04-27 11:01:18,059 INFO L290 TraceCheckUtils]: 113: Hoare triple {3277#false} ~cond := #in~cond; {3277#false} is VALID [2022-04-27 11:01:18,059 INFO L290 TraceCheckUtils]: 114: Hoare triple {3277#false} assume 0 == ~cond; {3277#false} is VALID [2022-04-27 11:01:18,059 INFO L290 TraceCheckUtils]: 115: Hoare triple {3277#false} assume !false; {3277#false} is VALID [2022-04-27 11:01:18,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 693 proven. 1027 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-27 11:01:18,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:01:18,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895310021] [2022-04-27 11:01:18,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895310021] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:01:18,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363712306] [2022-04-27 11:01:18,060 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:01:18,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:01:18,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:01:18,066 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-27 11:01:18,067 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-27 11:01:25,609 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2022-04-27 11:01:25,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:01:25,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-27 11:01:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:25,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:01:27,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {3276#true} call ULTIMATE.init(); {3276#true} is VALID [2022-04-27 11:01:27,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {3276#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(10, 2);call #Ultimate.allocInit(12, 3); {3276#true} is VALID [2022-04-27 11:01:27,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {3276#true} assume true; {3276#true} is VALID [2022-04-27 11:01:27,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3276#true} {3276#true} #41#return; {3276#true} is VALID [2022-04-27 11:01:27,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {3276#true} call #t~ret7 := main(); {3276#true} is VALID [2022-04-27 11:01:27,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {3276#true} ~x~0 := 0;~y~0 := 0; {3327#(= main_~y~0 0)} is VALID [2022-04-27 11:01:27,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {3327#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 < 1000000); {3327#(= main_~y~0 0)} is VALID [2022-04-27 11:01:27,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {3327#(= main_~y~0 0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3334#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:01:27,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {3334#(= (+ (- 1) main_~y~0) 0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3334#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:01:27,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {3334#(= (+ (- 1) main_~y~0) 0)} assume !!(~x~0 % 4294967296 < 1000000); {3334#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 11:01:27,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {3334#(= (+ (- 1) main_~y~0) 0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3344#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-27 11:01:27,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {3344#(= (+ (- 2) main_~y~0) 0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3344#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-27 11:01:27,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {3344#(= (+ (- 2) main_~y~0) 0)} assume !!(~x~0 % 4294967296 < 1000000); {3344#(= (+ (- 2) main_~y~0) 0)} is VALID [2022-04-27 11:01:27,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {3344#(= (+ (- 2) main_~y~0) 0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3354#(= main_~y~0 3)} is VALID [2022-04-27 11:01:27,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {3354#(= main_~y~0 3)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3354#(= main_~y~0 3)} is VALID [2022-04-27 11:01:27,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {3354#(= main_~y~0 3)} assume !!(~x~0 % 4294967296 < 1000000); {3354#(= main_~y~0 3)} is VALID [2022-04-27 11:01:27,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {3354#(= main_~y~0 3)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3364#(= 3 (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:01:27,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {3364#(= 3 (+ (- 1) main_~y~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3364#(= 3 (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:01:27,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {3364#(= 3 (+ (- 1) main_~y~0))} assume !!(~x~0 % 4294967296 < 1000000); {3364#(= 3 (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:01:27,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {3364#(= 3 (+ (- 1) main_~y~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3374#(= 5 main_~y~0)} is VALID [2022-04-27 11:01:27,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {3374#(= 5 main_~y~0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3374#(= 5 main_~y~0)} is VALID [2022-04-27 11:01:27,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {3374#(= 5 main_~y~0)} assume !!(~x~0 % 4294967296 < 1000000); {3374#(= 5 main_~y~0)} is VALID [2022-04-27 11:01:27,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {3374#(= 5 main_~y~0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3384#(= main_~y~0 6)} is VALID [2022-04-27 11:01:27,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {3384#(= main_~y~0 6)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3384#(= main_~y~0 6)} is VALID [2022-04-27 11:01:27,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {3384#(= main_~y~0 6)} assume !!(~x~0 % 4294967296 < 1000000); {3384#(= main_~y~0 6)} is VALID [2022-04-27 11:01:27,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {3384#(= main_~y~0 6)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3394#(= 7 main_~y~0)} is VALID [2022-04-27 11:01:27,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {3394#(= 7 main_~y~0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3394#(= 7 main_~y~0)} is VALID [2022-04-27 11:01:27,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {3394#(= 7 main_~y~0)} assume !!(~x~0 % 4294967296 < 1000000); {3394#(= 7 main_~y~0)} is VALID [2022-04-27 11:01:27,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {3394#(= 7 main_~y~0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3404#(and (< (mod main_~x~0 4294967296) 500000) (= main_~y~0 8))} is VALID [2022-04-27 11:01:27,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {3404#(and (< (mod main_~x~0 4294967296) 500000) (= main_~y~0 8))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3408#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 500000) (= main_~y~0 8))} is VALID [2022-04-27 11:01:27,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {3408#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 500000) (= main_~y~0 8))} assume !!(~x~0 % 4294967296 < 1000000); {3408#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 500000) (= main_~y~0 8))} is VALID [2022-04-27 11:01:27,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {3408#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 500000) (= main_~y~0 8))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3415#(= main_~y~0 9)} is VALID [2022-04-27 11:01:27,286 INFO L290 TraceCheckUtils]: 32: Hoare triple {3415#(= main_~y~0 9)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3415#(= main_~y~0 9)} is VALID [2022-04-27 11:01:27,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {3415#(= main_~y~0 9)} assume !!(~x~0 % 4294967296 < 1000000); {3415#(= main_~y~0 9)} is VALID [2022-04-27 11:01:27,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {3415#(= main_~y~0 9)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3425#(= 9 (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:01:27,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {3425#(= 9 (+ (- 1) main_~y~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3425#(= 9 (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:01:27,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {3425#(= 9 (+ (- 1) main_~y~0))} assume !!(~x~0 % 4294967296 < 1000000); {3425#(= 9 (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:01:27,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {3425#(= 9 (+ (- 1) main_~y~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3435#(= main_~y~0 11)} is VALID [2022-04-27 11:01:27,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {3435#(= main_~y~0 11)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3435#(= main_~y~0 11)} is VALID [2022-04-27 11:01:27,289 INFO L290 TraceCheckUtils]: 39: Hoare triple {3435#(= main_~y~0 11)} assume !!(~x~0 % 4294967296 < 1000000); {3435#(= main_~y~0 11)} is VALID [2022-04-27 11:01:27,289 INFO L290 TraceCheckUtils]: 40: Hoare triple {3435#(= main_~y~0 11)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3445#(= (+ (- 1) main_~y~0) 11)} is VALID [2022-04-27 11:01:27,289 INFO L290 TraceCheckUtils]: 41: Hoare triple {3445#(= (+ (- 1) main_~y~0) 11)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3445#(= (+ (- 1) main_~y~0) 11)} is VALID [2022-04-27 11:01:27,290 INFO L290 TraceCheckUtils]: 42: Hoare triple {3445#(= (+ (- 1) main_~y~0) 11)} assume !!(~x~0 % 4294967296 < 1000000); {3445#(= (+ (- 1) main_~y~0) 11)} is VALID [2022-04-27 11:01:27,290 INFO L290 TraceCheckUtils]: 43: Hoare triple {3445#(= (+ (- 1) main_~y~0) 11)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3455#(= main_~y~0 13)} is VALID [2022-04-27 11:01:27,290 INFO L290 TraceCheckUtils]: 44: Hoare triple {3455#(= main_~y~0 13)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3455#(= main_~y~0 13)} is VALID [2022-04-27 11:01:27,291 INFO L290 TraceCheckUtils]: 45: Hoare triple {3455#(= main_~y~0 13)} assume !!(~x~0 % 4294967296 < 1000000); {3455#(= main_~y~0 13)} is VALID [2022-04-27 11:01:27,291 INFO L290 TraceCheckUtils]: 46: Hoare triple {3455#(= main_~y~0 13)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3465#(= (+ (- 1) main_~y~0) 13)} is VALID [2022-04-27 11:01:27,291 INFO L290 TraceCheckUtils]: 47: Hoare triple {3465#(= (+ (- 1) main_~y~0) 13)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3465#(= (+ (- 1) main_~y~0) 13)} is VALID [2022-04-27 11:01:27,291 INFO L290 TraceCheckUtils]: 48: Hoare triple {3465#(= (+ (- 1) main_~y~0) 13)} assume !!(~x~0 % 4294967296 < 1000000); {3465#(= (+ (- 1) main_~y~0) 13)} is VALID [2022-04-27 11:01:27,292 INFO L290 TraceCheckUtils]: 49: Hoare triple {3465#(= (+ (- 1) main_~y~0) 13)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3475#(= main_~y~0 15)} is VALID [2022-04-27 11:01:27,292 INFO L290 TraceCheckUtils]: 50: Hoare triple {3475#(= main_~y~0 15)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3475#(= main_~y~0 15)} is VALID [2022-04-27 11:01:27,292 INFO L290 TraceCheckUtils]: 51: Hoare triple {3475#(= main_~y~0 15)} assume !!(~x~0 % 4294967296 < 1000000); {3475#(= main_~y~0 15)} is VALID [2022-04-27 11:01:27,293 INFO L290 TraceCheckUtils]: 52: Hoare triple {3475#(= main_~y~0 15)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3485#(= 15 (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:01:27,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {3485#(= 15 (+ (- 1) main_~y~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3485#(= 15 (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:01:27,293 INFO L290 TraceCheckUtils]: 54: Hoare triple {3485#(= 15 (+ (- 1) main_~y~0))} assume !!(~x~0 % 4294967296 < 1000000); {3485#(= 15 (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:01:27,294 INFO L290 TraceCheckUtils]: 55: Hoare triple {3485#(= 15 (+ (- 1) main_~y~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3495#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-27 11:01:27,294 INFO L290 TraceCheckUtils]: 56: Hoare triple {3495#(= (+ (- 2) main_~y~0) 15)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3495#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-27 11:01:27,294 INFO L290 TraceCheckUtils]: 57: Hoare triple {3495#(= (+ (- 2) main_~y~0) 15)} assume !!(~x~0 % 4294967296 < 1000000); {3495#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-27 11:01:27,295 INFO L290 TraceCheckUtils]: 58: Hoare triple {3495#(= (+ (- 2) main_~y~0) 15)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3505#(= main_~y~0 18)} is VALID [2022-04-27 11:01:27,295 INFO L290 TraceCheckUtils]: 59: Hoare triple {3505#(= main_~y~0 18)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3505#(= main_~y~0 18)} is VALID [2022-04-27 11:01:27,295 INFO L290 TraceCheckUtils]: 60: Hoare triple {3505#(= main_~y~0 18)} assume !!(~x~0 % 4294967296 < 1000000); {3505#(= main_~y~0 18)} is VALID [2022-04-27 11:01:27,296 INFO L290 TraceCheckUtils]: 61: Hoare triple {3505#(= main_~y~0 18)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3515#(= 19 main_~y~0)} is VALID [2022-04-27 11:01:27,296 INFO L290 TraceCheckUtils]: 62: Hoare triple {3515#(= 19 main_~y~0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3515#(= 19 main_~y~0)} is VALID [2022-04-27 11:01:27,296 INFO L290 TraceCheckUtils]: 63: Hoare triple {3515#(= 19 main_~y~0)} assume !!(~x~0 % 4294967296 < 1000000); {3515#(= 19 main_~y~0)} is VALID [2022-04-27 11:01:27,297 INFO L290 TraceCheckUtils]: 64: Hoare triple {3515#(= 19 main_~y~0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3525#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:01:27,297 INFO L290 TraceCheckUtils]: 65: Hoare triple {3525#(= 19 (+ (- 1) main_~y~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3525#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:01:27,297 INFO L290 TraceCheckUtils]: 66: Hoare triple {3525#(= 19 (+ (- 1) main_~y~0))} assume !!(~x~0 % 4294967296 < 1000000); {3525#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:01:27,298 INFO L290 TraceCheckUtils]: 67: Hoare triple {3525#(= 19 (+ (- 1) main_~y~0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3535#(= main_~y~0 21)} is VALID [2022-04-27 11:01:27,298 INFO L290 TraceCheckUtils]: 68: Hoare triple {3535#(= main_~y~0 21)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3535#(= main_~y~0 21)} is VALID [2022-04-27 11:01:27,298 INFO L290 TraceCheckUtils]: 69: Hoare triple {3535#(= main_~y~0 21)} assume !!(~x~0 % 4294967296 < 1000000); {3535#(= main_~y~0 21)} is VALID [2022-04-27 11:01:27,299 INFO L290 TraceCheckUtils]: 70: Hoare triple {3535#(= main_~y~0 21)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3545#(= main_~y~0 22)} is VALID [2022-04-27 11:01:27,299 INFO L290 TraceCheckUtils]: 71: Hoare triple {3545#(= main_~y~0 22)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3545#(= main_~y~0 22)} is VALID [2022-04-27 11:01:27,299 INFO L290 TraceCheckUtils]: 72: Hoare triple {3545#(= main_~y~0 22)} assume !!(~x~0 % 4294967296 < 1000000); {3545#(= main_~y~0 22)} is VALID [2022-04-27 11:01:27,300 INFO L290 TraceCheckUtils]: 73: Hoare triple {3545#(= main_~y~0 22)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3555#(= 23 main_~y~0)} is VALID [2022-04-27 11:01:27,300 INFO L290 TraceCheckUtils]: 74: Hoare triple {3555#(= 23 main_~y~0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3555#(= 23 main_~y~0)} is VALID [2022-04-27 11:01:27,300 INFO L290 TraceCheckUtils]: 75: Hoare triple {3555#(= 23 main_~y~0)} assume !!(~x~0 % 4294967296 < 1000000); {3555#(= 23 main_~y~0)} is VALID [2022-04-27 11:01:27,300 INFO L290 TraceCheckUtils]: 76: Hoare triple {3555#(= 23 main_~y~0)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3565#(= main_~y~0 24)} is VALID [2022-04-27 11:01:27,301 INFO L290 TraceCheckUtils]: 77: Hoare triple {3565#(= main_~y~0 24)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3565#(= main_~y~0 24)} is VALID [2022-04-27 11:01:27,301 INFO L290 TraceCheckUtils]: 78: Hoare triple {3565#(= main_~y~0 24)} assume !!(~x~0 % 4294967296 < 1000000); {3565#(= main_~y~0 24)} is VALID [2022-04-27 11:01:27,301 INFO L290 TraceCheckUtils]: 79: Hoare triple {3565#(= main_~y~0 24)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3575#(= main_~y~0 25)} is VALID [2022-04-27 11:01:27,302 INFO L290 TraceCheckUtils]: 80: Hoare triple {3575#(= main_~y~0 25)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3575#(= main_~y~0 25)} is VALID [2022-04-27 11:01:27,302 INFO L290 TraceCheckUtils]: 81: Hoare triple {3575#(= main_~y~0 25)} assume !!(~x~0 % 4294967296 < 1000000); {3575#(= main_~y~0 25)} is VALID [2022-04-27 11:01:27,302 INFO L290 TraceCheckUtils]: 82: Hoare triple {3575#(= main_~y~0 25)} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3585#(= main_~y~0 26)} is VALID [2022-04-27 11:01:27,303 INFO L290 TraceCheckUtils]: 83: Hoare triple {3585#(= main_~y~0 26)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3585#(= main_~y~0 26)} is VALID [2022-04-27 11:01:27,303 INFO L290 TraceCheckUtils]: 84: Hoare triple {3585#(= main_~y~0 26)} assume !!(~x~0 % 4294967296 < 1000000); {3585#(= main_~y~0 26)} is VALID [2022-04-27 11:01:27,303 INFO L290 TraceCheckUtils]: 85: Hoare triple {3585#(= main_~y~0 26)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3575#(= main_~y~0 25)} is VALID [2022-04-27 11:01:27,304 INFO L290 TraceCheckUtils]: 86: Hoare triple {3575#(= main_~y~0 25)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3575#(= main_~y~0 25)} is VALID [2022-04-27 11:01:27,304 INFO L290 TraceCheckUtils]: 87: Hoare triple {3575#(= main_~y~0 25)} assume !!(~x~0 % 4294967296 < 1000000); {3575#(= main_~y~0 25)} is VALID [2022-04-27 11:01:27,304 INFO L290 TraceCheckUtils]: 88: Hoare triple {3575#(= main_~y~0 25)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3565#(= main_~y~0 24)} is VALID [2022-04-27 11:01:27,305 INFO L290 TraceCheckUtils]: 89: Hoare triple {3565#(= main_~y~0 24)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3565#(= main_~y~0 24)} is VALID [2022-04-27 11:01:27,305 INFO L290 TraceCheckUtils]: 90: Hoare triple {3565#(= main_~y~0 24)} assume !!(~x~0 % 4294967296 < 1000000); {3565#(= main_~y~0 24)} is VALID [2022-04-27 11:01:27,305 INFO L290 TraceCheckUtils]: 91: Hoare triple {3565#(= main_~y~0 24)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3555#(= 23 main_~y~0)} is VALID [2022-04-27 11:01:27,305 INFO L290 TraceCheckUtils]: 92: Hoare triple {3555#(= 23 main_~y~0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3555#(= 23 main_~y~0)} is VALID [2022-04-27 11:01:27,306 INFO L290 TraceCheckUtils]: 93: Hoare triple {3555#(= 23 main_~y~0)} assume !!(~x~0 % 4294967296 < 1000000); {3555#(= 23 main_~y~0)} is VALID [2022-04-27 11:01:27,306 INFO L290 TraceCheckUtils]: 94: Hoare triple {3555#(= 23 main_~y~0)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3545#(= main_~y~0 22)} is VALID [2022-04-27 11:01:27,306 INFO L290 TraceCheckUtils]: 95: Hoare triple {3545#(= main_~y~0 22)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3545#(= main_~y~0 22)} is VALID [2022-04-27 11:01:27,307 INFO L290 TraceCheckUtils]: 96: Hoare triple {3545#(= main_~y~0 22)} assume !!(~x~0 % 4294967296 < 1000000); {3545#(= main_~y~0 22)} is VALID [2022-04-27 11:01:27,307 INFO L290 TraceCheckUtils]: 97: Hoare triple {3545#(= main_~y~0 22)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3535#(= main_~y~0 21)} is VALID [2022-04-27 11:01:27,307 INFO L290 TraceCheckUtils]: 98: Hoare triple {3535#(= main_~y~0 21)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3535#(= main_~y~0 21)} is VALID [2022-04-27 11:01:27,308 INFO L290 TraceCheckUtils]: 99: Hoare triple {3535#(= main_~y~0 21)} assume !!(~x~0 % 4294967296 < 1000000); {3535#(= main_~y~0 21)} is VALID [2022-04-27 11:01:27,308 INFO L290 TraceCheckUtils]: 100: Hoare triple {3535#(= main_~y~0 21)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3525#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:01:27,308 INFO L290 TraceCheckUtils]: 101: Hoare triple {3525#(= 19 (+ (- 1) main_~y~0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3525#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:01:27,309 INFO L290 TraceCheckUtils]: 102: Hoare triple {3525#(= 19 (+ (- 1) main_~y~0))} assume !!(~x~0 % 4294967296 < 1000000); {3525#(= 19 (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:01:27,309 INFO L290 TraceCheckUtils]: 103: Hoare triple {3525#(= 19 (+ (- 1) main_~y~0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3515#(= 19 main_~y~0)} is VALID [2022-04-27 11:01:27,309 INFO L290 TraceCheckUtils]: 104: Hoare triple {3515#(= 19 main_~y~0)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3515#(= 19 main_~y~0)} is VALID [2022-04-27 11:01:27,310 INFO L290 TraceCheckUtils]: 105: Hoare triple {3515#(= 19 main_~y~0)} assume !!(~x~0 % 4294967296 < 1000000); {3515#(= 19 main_~y~0)} is VALID [2022-04-27 11:01:27,310 INFO L290 TraceCheckUtils]: 106: Hoare triple {3515#(= 19 main_~y~0)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3505#(= main_~y~0 18)} is VALID [2022-04-27 11:01:27,310 INFO L290 TraceCheckUtils]: 107: Hoare triple {3505#(= main_~y~0 18)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3505#(= main_~y~0 18)} is VALID [2022-04-27 11:01:27,310 INFO L290 TraceCheckUtils]: 108: Hoare triple {3505#(= main_~y~0 18)} assume !!(~x~0 % 4294967296 < 1000000); {3505#(= main_~y~0 18)} is VALID [2022-04-27 11:01:27,311 INFO L290 TraceCheckUtils]: 109: Hoare triple {3505#(= main_~y~0 18)} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3495#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-27 11:01:27,311 INFO L290 TraceCheckUtils]: 110: Hoare triple {3495#(= (+ (- 2) main_~y~0) 15)} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3495#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-27 11:01:27,311 INFO L290 TraceCheckUtils]: 111: Hoare triple {3495#(= (+ (- 2) main_~y~0) 15)} assume !(~x~0 % 4294967296 < 1000000); {3495#(= (+ (- 2) main_~y~0) 15)} is VALID [2022-04-27 11:01:27,312 INFO L272 TraceCheckUtils]: 112: Hoare triple {3495#(= (+ (- 2) main_~y~0) 15)} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {3676#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:01:27,312 INFO L290 TraceCheckUtils]: 113: Hoare triple {3676#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3680#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:01:27,313 INFO L290 TraceCheckUtils]: 114: Hoare triple {3680#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3277#false} is VALID [2022-04-27 11:01:27,313 INFO L290 TraceCheckUtils]: 115: Hoare triple {3277#false} assume !false; {3277#false} is VALID [2022-04-27 11:01:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1794 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 11:01:27,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:01:29,441 INFO L290 TraceCheckUtils]: 115: Hoare triple {3277#false} assume !false; {3277#false} is VALID [2022-04-27 11:01:29,441 INFO L290 TraceCheckUtils]: 114: Hoare triple {3680#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3277#false} is VALID [2022-04-27 11:01:29,442 INFO L290 TraceCheckUtils]: 113: Hoare triple {3676#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3680#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:01:29,444 INFO L272 TraceCheckUtils]: 112: Hoare triple {3696#(not (= (mod main_~y~0 4294967296) 0))} call __VERIFIER_assert((if 0 != ~y~0 % 4294967296 then 1 else 0)); {3676#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:01:29,444 INFO L290 TraceCheckUtils]: 111: Hoare triple {3696#(not (= (mod main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 < 1000000); {3696#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:01:29,444 INFO L290 TraceCheckUtils]: 110: Hoare triple {3696#(not (= (mod main_~y~0 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3696#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:01:29,445 INFO L290 TraceCheckUtils]: 109: Hoare triple {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3696#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:01:29,445 INFO L290 TraceCheckUtils]: 108: Hoare triple {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:01:29,445 INFO L290 TraceCheckUtils]: 107: Hoare triple {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:01:29,446 INFO L290 TraceCheckUtils]: 106: Hoare triple {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:01:29,446 INFO L290 TraceCheckUtils]: 105: Hoare triple {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:01:29,446 INFO L290 TraceCheckUtils]: 104: Hoare triple {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:01:29,447 INFO L290 TraceCheckUtils]: 103: Hoare triple {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:01:29,447 INFO L290 TraceCheckUtils]: 102: Hoare triple {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-27 11:01:29,447 INFO L290 TraceCheckUtils]: 101: Hoare triple {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-27 11:01:29,448 INFO L290 TraceCheckUtils]: 100: Hoare triple {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-27 11:01:29,448 INFO L290 TraceCheckUtils]: 99: Hoare triple {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,448 INFO L290 TraceCheckUtils]: 98: Hoare triple {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,454 INFO L290 TraceCheckUtils]: 97: Hoare triple {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,455 INFO L290 TraceCheckUtils]: 96: Hoare triple {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,455 INFO L290 TraceCheckUtils]: 95: Hoare triple {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,455 INFO L290 TraceCheckUtils]: 94: Hoare triple {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,456 INFO L290 TraceCheckUtils]: 93: Hoare triple {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,456 INFO L290 TraceCheckUtils]: 92: Hoare triple {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,456 INFO L290 TraceCheckUtils]: 91: Hoare triple {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,457 INFO L290 TraceCheckUtils]: 90: Hoare triple {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-27 11:01:29,457 INFO L290 TraceCheckUtils]: 89: Hoare triple {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-27 11:01:29,457 INFO L290 TraceCheckUtils]: 88: Hoare triple {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-27 11:01:29,457 INFO L290 TraceCheckUtils]: 87: Hoare triple {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,458 INFO L290 TraceCheckUtils]: 86: Hoare triple {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,458 INFO L290 TraceCheckUtils]: 85: Hoare triple {3786#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} assume !(~x~0 % 4294967296 < 500000);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5; {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,458 INFO L290 TraceCheckUtils]: 84: Hoare triple {3786#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3786#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} is VALID [2022-04-27 11:01:29,459 INFO L290 TraceCheckUtils]: 83: Hoare triple {3786#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3786#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} is VALID [2022-04-27 11:01:29,472 INFO L290 TraceCheckUtils]: 82: Hoare triple {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3786#(not (= (mod (+ main_~y~0 4294967287) 4294967296) 0))} is VALID [2022-04-27 11:01:29,472 INFO L290 TraceCheckUtils]: 81: Hoare triple {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,472 INFO L290 TraceCheckUtils]: 80: Hoare triple {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,472 INFO L290 TraceCheckUtils]: 79: Hoare triple {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3776#(not (= (mod (+ 4294967288 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,473 INFO L290 TraceCheckUtils]: 78: Hoare triple {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-27 11:01:29,473 INFO L290 TraceCheckUtils]: 77: Hoare triple {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-27 11:01:29,473 INFO L290 TraceCheckUtils]: 76: Hoare triple {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3766#(not (= (mod (+ main_~y~0 4294967289) 4294967296) 0))} is VALID [2022-04-27 11:01:29,474 INFO L290 TraceCheckUtils]: 75: Hoare triple {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,474 INFO L290 TraceCheckUtils]: 74: Hoare triple {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,474 INFO L290 TraceCheckUtils]: 73: Hoare triple {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3756#(not (= (mod (+ 4294967290 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,474 INFO L290 TraceCheckUtils]: 72: Hoare triple {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,475 INFO L290 TraceCheckUtils]: 71: Hoare triple {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,475 INFO L290 TraceCheckUtils]: 70: Hoare triple {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3746#(not (= (mod (+ 4294967291 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,475 INFO L290 TraceCheckUtils]: 69: Hoare triple {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,476 INFO L290 TraceCheckUtils]: 68: Hoare triple {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,476 INFO L290 TraceCheckUtils]: 67: Hoare triple {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3736#(not (= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,476 INFO L290 TraceCheckUtils]: 66: Hoare triple {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-27 11:01:29,476 INFO L290 TraceCheckUtils]: 65: Hoare triple {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-27 11:01:29,477 INFO L290 TraceCheckUtils]: 64: Hoare triple {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3726#(not (= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-27 11:01:29,477 INFO L290 TraceCheckUtils]: 63: Hoare triple {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:01:29,477 INFO L290 TraceCheckUtils]: 62: Hoare triple {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:01:29,478 INFO L290 TraceCheckUtils]: 61: Hoare triple {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3716#(not (= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:01:29,478 INFO L290 TraceCheckUtils]: 60: Hoare triple {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:01:29,478 INFO L290 TraceCheckUtils]: 59: Hoare triple {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:01:29,479 INFO L290 TraceCheckUtils]: 58: Hoare triple {3696#(not (= (mod main_~y~0 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3706#(not (= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:01:29,479 INFO L290 TraceCheckUtils]: 57: Hoare triple {3696#(not (= (mod main_~y~0 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3696#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:01:29,479 INFO L290 TraceCheckUtils]: 56: Hoare triple {3696#(not (= (mod main_~y~0 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3696#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:01:29,480 INFO L290 TraceCheckUtils]: 55: Hoare triple {3877#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3696#(not (= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:01:29,480 INFO L290 TraceCheckUtils]: 54: Hoare triple {3877#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3877#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-27 11:01:29,480 INFO L290 TraceCheckUtils]: 53: Hoare triple {3877#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3877#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-27 11:01:29,481 INFO L290 TraceCheckUtils]: 52: Hoare triple {3887#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3877#(not (= (mod (+ main_~y~0 1) 4294967296) 0))} is VALID [2022-04-27 11:01:29,481 INFO L290 TraceCheckUtils]: 51: Hoare triple {3887#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3887#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} is VALID [2022-04-27 11:01:29,481 INFO L290 TraceCheckUtils]: 50: Hoare triple {3887#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3887#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} is VALID [2022-04-27 11:01:29,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {3897#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3887#(not (= (mod (+ main_~y~0 2) 4294967296) 0))} is VALID [2022-04-27 11:01:29,482 INFO L290 TraceCheckUtils]: 48: Hoare triple {3897#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3897#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} is VALID [2022-04-27 11:01:29,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {3897#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3897#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} is VALID [2022-04-27 11:01:29,483 INFO L290 TraceCheckUtils]: 46: Hoare triple {3907#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3897#(not (= (mod (+ main_~y~0 3) 4294967296) 0))} is VALID [2022-04-27 11:01:29,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {3907#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3907#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} is VALID [2022-04-27 11:01:29,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {3907#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3907#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} is VALID [2022-04-27 11:01:29,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {3917#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3907#(not (= (mod (+ main_~y~0 4) 4294967296) 0))} is VALID [2022-04-27 11:01:29,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {3917#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3917#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,484 INFO L290 TraceCheckUtils]: 41: Hoare triple {3917#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3917#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {3927#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3917#(not (= (mod (+ 5 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {3927#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3927#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} is VALID [2022-04-27 11:01:29,485 INFO L290 TraceCheckUtils]: 38: Hoare triple {3927#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3927#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} is VALID [2022-04-27 11:01:29,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {3937#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3927#(not (= (mod (+ main_~y~0 6) 4294967296) 0))} is VALID [2022-04-27 11:01:29,486 INFO L290 TraceCheckUtils]: 36: Hoare triple {3937#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3937#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {3937#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3937#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {3947#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3937#(not (= (mod (+ 7 main_~y~0) 4294967296) 0))} is VALID [2022-04-27 11:01:29,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {3947#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3947#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} is VALID [2022-04-27 11:01:29,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {3947#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3947#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} is VALID [2022-04-27 11:01:29,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {3957#(or (not (< (mod main_~x~0 4294967296) 500000)) (not (= (mod (+ main_~y~0 9) 4294967296) 0)))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3947#(not (= (mod (+ main_~y~0 8) 4294967296) 0))} is VALID [2022-04-27 11:01:29,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {3957#(or (not (< (mod main_~x~0 4294967296) 500000)) (not (= (mod (+ main_~y~0 9) 4294967296) 0)))} assume !!(~x~0 % 4294967296 < 1000000); {3957#(or (not (< (mod main_~x~0 4294967296) 500000)) (not (= (mod (+ main_~y~0 9) 4294967296) 0)))} is VALID [2022-04-27 11:01:29,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {3964#(or (not (= (mod (+ main_~y~0 9) 4294967296) 0)) (not (< (mod (+ main_~x~0 1) 4294967296) 500000)))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3957#(or (not (< (mod main_~x~0 4294967296) 500000)) (not (= (mod (+ main_~y~0 9) 4294967296) 0)))} is VALID [2022-04-27 11:01:29,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {3968#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3964#(or (not (= (mod (+ main_~y~0 9) 4294967296) 0)) (not (< (mod (+ main_~x~0 1) 4294967296) 500000)))} is VALID [2022-04-27 11:01:29,489 INFO L290 TraceCheckUtils]: 27: Hoare triple {3968#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3968#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} is VALID [2022-04-27 11:01:29,489 INFO L290 TraceCheckUtils]: 26: Hoare triple {3968#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3968#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} is VALID [2022-04-27 11:01:29,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {3978#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3968#(not (= (mod (+ main_~y~0 10) 4294967296) 0))} is VALID [2022-04-27 11:01:29,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {3978#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3978#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} is VALID [2022-04-27 11:01:29,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {3978#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3978#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} is VALID [2022-04-27 11:01:29,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {3988#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3978#(not (= (mod (+ main_~y~0 11) 4294967296) 0))} is VALID [2022-04-27 11:01:29,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {3988#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3988#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} is VALID [2022-04-27 11:01:29,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {3988#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3988#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} is VALID [2022-04-27 11:01:29,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {3998#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3988#(not (= (mod (+ main_~y~0 12) 4294967296) 0))} is VALID [2022-04-27 11:01:29,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {3998#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {3998#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} is VALID [2022-04-27 11:01:29,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {3998#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {3998#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} is VALID [2022-04-27 11:01:29,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {4008#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {3998#(not (= (mod (+ main_~y~0 13) 4294967296) 0))} is VALID [2022-04-27 11:01:29,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {4008#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {4008#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} is VALID [2022-04-27 11:01:29,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {4008#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {4008#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} is VALID [2022-04-27 11:01:29,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {4018#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4008#(not (= (mod (+ main_~y~0 14) 4294967296) 0))} is VALID [2022-04-27 11:01:29,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {4018#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {4018#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} is VALID [2022-04-27 11:01:29,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {4018#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {4018#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} is VALID [2022-04-27 11:01:29,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {4028#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4018#(not (= (mod (+ main_~y~0 15) 4294967296) 0))} is VALID [2022-04-27 11:01:29,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {4028#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} assume !!(~x~0 % 4294967296 < 1000000); {4028#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} is VALID [2022-04-27 11:01:29,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {4028#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} #t~post6 := ~x~0;~x~0 := 1 + #t~post6;havoc #t~post6; {4028#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} is VALID [2022-04-27 11:01:29,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {4038#(not (= (mod (+ main_~y~0 17) 4294967296) 0))} assume ~x~0 % 4294967296 < 500000;#t~post4 := ~y~0;~y~0 := 1 + #t~post4;havoc #t~post4; {4028#(not (= 0 (mod (+ main_~y~0 16) 4294967296)))} is VALID [2022-04-27 11:01:29,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {4038#(not (= (mod (+ main_~y~0 17) 4294967296) 0))} assume !!(~x~0 % 4294967296 < 1000000); {4038#(not (= (mod (+ main_~y~0 17) 4294967296) 0))} is VALID [2022-04-27 11:01:29,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {3276#true} ~x~0 := 0;~y~0 := 0; {4038#(not (= (mod (+ main_~y~0 17) 4294967296) 0))} is VALID [2022-04-27 11:01:29,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {3276#true} call #t~ret7 := main(); {3276#true} is VALID [2022-04-27 11:01:29,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3276#true} {3276#true} #41#return; {3276#true} is VALID [2022-04-27 11:01:29,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {3276#true} assume true; {3276#true} is VALID [2022-04-27 11:01:29,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {3276#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(10, 2);call #Ultimate.allocInit(12, 3); {3276#true} is VALID [2022-04-27 11:01:29,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {3276#true} call ULTIMATE.init(); {3276#true} is VALID [2022-04-27 11:01:29,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1794 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 11:01:29,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363712306] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:01:29,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:01:29,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 32] total 88 [2022-04-27 11:01:29,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462380502] [2022-04-27 11:01:29,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:01:29,499 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 3.102272727272727) internal successors, (273), 86 states have internal predecessors, (273), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-27 11:01:29,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:01:29,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 88 states, 88 states have (on average 3.102272727272727) internal successors, (273), 86 states have internal predecessors, (273), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:29,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:01:29,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-04-27 11:01:29,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:01:29,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-04-27 11:01:29,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=972, Invalid=6684, Unknown=0, NotChecked=0, Total=7656 [2022-04-27 11:01:29,631 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 88 states, 88 states have (on average 3.102272727272727) internal successors, (273), 86 states have internal predecessors, (273), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:10,002 WARN L232 SmtUtils]: Spent 2.07m on a formula simplification. DAG size of input: 160 DAG size of output: 150 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:05:14,402 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 16 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or .cse0 (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 15 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (or (not (< (mod (+ c_main_~x~0 1) 4294967296) 500000)) .cse0) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= 0 (mod (+ 17 c_main_~y~0) 4294967296))) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-04-27 11:07:21,398 WARN L232 SmtUtils]: Spent 55.15s on a formula simplification that was a NOOP. DAG size: 143 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:07:25,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:07:27,671 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 16 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or .cse0 (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 15 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (or (not (< (mod (+ c_main_~x~0 1) 4294967296) 500000)) .cse0) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-04-27 11:07:29,678 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:07:34,280 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 16 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)) (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 15 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0))) is different from false [2022-04-27 11:09:39,079 WARN L232 SmtUtils]: Spent 48.26s on a formula simplification that was a NOOP. DAG size: 134 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:09:56,252 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:11:56,245 WARN L232 SmtUtils]: Spent 52.97s on a formula simplification that was a NOOP. DAG size: 139 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:12:05,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:14:12,341 WARN L232 SmtUtils]: Spent 1.00m on a formula simplification that was a NOOP. DAG size: 144 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:14:16,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:14:19,202 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []