./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c5f43b3e9ff1d4598a5a525fe9e716f863331c4c517b4b8adb0491943243286 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:07:23,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:07:23,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:07:23,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:07:23,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:07:23,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:07:23,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:07:23,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:07:23,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:07:23,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:07:23,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:07:23,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:07:23,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:07:23,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:07:23,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:07:23,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:07:23,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:07:23,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:07:23,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:07:23,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:07:23,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:07:23,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:07:23,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:07:23,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:07:23,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:07:23,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:07:23,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:07:23,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:07:23,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:07:23,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:07:23,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:07:23,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:07:23,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:07:23,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:07:23,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:07:23,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:07:23,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:07:23,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:07:23,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:07:23,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:07:23,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:07:23,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:07:23,400 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:07:23,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:07:23,401 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:07:23,401 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:07:23,402 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:07:23,402 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:07:23,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:07:23,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:07:23,403 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:07:23,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:07:23,404 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:07:23,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:07:23,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:07:23,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:07:23,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:07:23,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:07:23,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:07:23,405 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:07:23,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:07:23,405 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:07:23,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:07:23,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:07:23,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:07:23,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:07:23,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:07:23,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:07:23,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:07:23,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:07:23,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:07:23,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:07:23,408 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:07:23,408 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:07:23,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:07:23,408 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c5f43b3e9ff1d4598a5a525fe9e716f863331c4c517b4b8adb0491943243286 [2022-02-20 17:07:23,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:07:23,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:07:23,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:07:23,610 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:07:23,611 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:07:23,612 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c [2022-02-20 17:07:23,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e7d9195a/ec77000b4181400f9dc6a08f474ddfe3/FLAG1a8821a6b [2022-02-20 17:07:23,994 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:07:23,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c [2022-02-20 17:07:23,999 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e7d9195a/ec77000b4181400f9dc6a08f474ddfe3/FLAG1a8821a6b [2022-02-20 17:07:24,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e7d9195a/ec77000b4181400f9dc6a08f474ddfe3 [2022-02-20 17:07:24,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:07:24,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:07:24,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:07:24,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:07:24,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:07:24,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:07:24" (1/1) ... [2022-02-20 17:07:24,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c35b81d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:24, skipping insertion in model container [2022-02-20 17:07:24,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:07:24" (1/1) ... [2022-02-20 17:07:24,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:07:24,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:07:24,127 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c[319,332] [2022-02-20 17:07:24,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:07:24,144 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:07:24,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c[319,332] [2022-02-20 17:07:24,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:07:24,161 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:07:24,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:24 WrapperNode [2022-02-20 17:07:24,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:07:24,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:07:24,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:07:24,163 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:07:24,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:24" (1/1) ... [2022-02-20 17:07:24,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:24" (1/1) ... [2022-02-20 17:07:24,187 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-02-20 17:07:24,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:07:24,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:07:24,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:07:24,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:07:24,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:24" (1/1) ... [2022-02-20 17:07:24,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:24" (1/1) ... [2022-02-20 17:07:24,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:24" (1/1) ... [2022-02-20 17:07:24,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:24" (1/1) ... [2022-02-20 17:07:24,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:24" (1/1) ... [2022-02-20 17:07:24,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:24" (1/1) ... [2022-02-20 17:07:24,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:24" (1/1) ... [2022-02-20 17:07:24,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:07:24,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:07:24,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:07:24,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:07:24,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:24" (1/1) ... [2022-02-20 17:07:24,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:07:24,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:07:24,229 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-02-20 17:07:24,230 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-02-20 17:07:24,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:07:24,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:07:24,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:07:24,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:07:24,293 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:07:24,294 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:07:24,360 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:07:24,364 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:07:24,364 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:07:24,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:07:24 BoogieIcfgContainer [2022-02-20 17:07:24,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:07:24,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:07:24,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:07:24,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:07:24,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:07:24" (1/3) ... [2022-02-20 17:07:24,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c8f5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:07:24, skipping insertion in model container [2022-02-20 17:07:24,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:07:24" (2/3) ... [2022-02-20 17:07:24,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c8f5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:07:24, skipping insertion in model container [2022-02-20 17:07:24,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:07:24" (3/3) ... [2022-02-20 17:07:24,372 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_10.c [2022-02-20 17:07:24,375 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:07:24,375 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:07:24,410 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:07:24,424 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:07:24,425 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:07:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 17:07:24,454 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:07:24,454 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 17:07:24,455 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:07:24,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:07:24,464 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2022-02-20 17:07:24,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:07:24,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268193636] [2022-02-20 17:07:24,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:24,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:07:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:24,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {16#true} assume { :begin_inline_ULTIMATE.init } 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(18, 2);call #Ultimate.allocInit(12, 3); {16#true} is VALID [2022-02-20 17:07:24,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {16#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~post5#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := 0;main_~y~0#1 := 10000000;main_~z~0#1 := 5000000; {16#true} is VALID [2022-02-20 17:07:24,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {16#true} assume !true; {17#false} is VALID [2022-02-20 17:07:24,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {17#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~z~0#1 % 4294967296 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {17#false} is VALID [2022-02-20 17:07:24,603 INFO L290 TraceCheckUtils]: 4: Hoare triple {17#false} assume 0 == __VERIFIER_assert_~cond#1; {17#false} is VALID [2022-02-20 17:07:24,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {17#false} assume !false; {17#false} is VALID [2022-02-20 17:07:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:24,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:07:24,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268193636] [2022-02-20 17:07:24,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268193636] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:07:24,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:07:24,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:07:24,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296995505] [2022-02-20 17:07:24,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:07:24,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 17:07:24,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:07:24,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:24,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:07:24,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:07:24,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:07:24,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:07:24,635 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:24,658 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-02-20 17:07:24,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:07:24,659 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 17:07:24,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:07:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 24 transitions. [2022-02-20 17:07:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 24 transitions. [2022-02-20 17:07:24,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 24 transitions. [2022-02-20 17:07:24,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:24,730 INFO L225 Difference]: With dead ends: 21 [2022-02-20 17:07:24,730 INFO L226 Difference]: Without dead ends: 9 [2022-02-20 17:07:24,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:07:24,734 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:07:24,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:07:24,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-02-20 17:07:24,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-20 17:07:24,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:07:24,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,758 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,759 INFO L87 Difference]: Start difference. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:24,760 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-20 17:07:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-20 17:07:24,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:24,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:24,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states. [2022-02-20 17:07:24,761 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states. [2022-02-20 17:07:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:24,762 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-20 17:07:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-20 17:07:24,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:24,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:24,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:07:24,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:07:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-02-20 17:07:24,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2022-02-20 17:07:24,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:07:24,766 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-02-20 17:07:24,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-20 17:07:24,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 17:07:24,766 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:07:24,767 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 17:07:24,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:07:24,767 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:07:24,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:07:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2022-02-20 17:07:24,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:07:24,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098848029] [2022-02-20 17:07:24,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:24,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:07:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:24,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {72#true} assume { :begin_inline_ULTIMATE.init } 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(18, 2);call #Ultimate.allocInit(12, 3); {72#true} is VALID [2022-02-20 17:07:24,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {72#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~post5#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := 0;main_~y~0#1 := 10000000;main_~z~0#1 := 5000000; {74#(and (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:07:24,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {74#(and (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {73#false} is VALID [2022-02-20 17:07:24,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {73#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~z~0#1 % 4294967296 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {73#false} is VALID [2022-02-20 17:07:24,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {73#false} assume 0 == __VERIFIER_assert_~cond#1; {73#false} is VALID [2022-02-20 17:07:24,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {73#false} assume !false; {73#false} is VALID [2022-02-20 17:07:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:24,866 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:07:24,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098848029] [2022-02-20 17:07:24,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098848029] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:07:24,867 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:07:24,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:07:24,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310363999] [2022-02-20 17:07:24,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:07:24,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 17:07:24,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:07:24,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:24,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:07:24,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:07:24,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:07:24,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:07:24,889 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:24,933 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-20 17:07:24,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:07:24,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 17:07:24,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:07:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-20 17:07:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-20 17:07:24,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-02-20 17:07:24,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:24,966 INFO L225 Difference]: With dead ends: 19 [2022-02-20 17:07:24,971 INFO L226 Difference]: Without dead ends: 12 [2022-02-20 17:07:24,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:07:24,972 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:07:24,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:07:24,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-20 17:07:24,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-02-20 17:07:24,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:07:24,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,985 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,985 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:24,986 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-02-20 17:07:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-20 17:07:24,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:24,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:24,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 17:07:24,988 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 17:07:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:24,990 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-02-20 17:07:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-20 17:07:24,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:24,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:24,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:07:24,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:07:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-02-20 17:07:24,993 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2022-02-20 17:07:24,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:07:24,994 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-02-20 17:07:24,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-20 17:07:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:07:24,995 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:07:24,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:07:24,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:07:24,996 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:07:24,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:07:24,997 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2022-02-20 17:07:24,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:07:24,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097721513] [2022-02-20 17:07:24,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:24,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:07:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:25,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#true} assume { :begin_inline_ULTIMATE.init } 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(18, 2);call #Ultimate.allocInit(12, 3); {136#true} is VALID [2022-02-20 17:07:25,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~post5#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := 0;main_~y~0#1 := 10000000;main_~z~0#1 := 5000000; {138#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:07:25,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {138#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {139#(and (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:07:25,146 INFO L290 TraceCheckUtils]: 3: Hoare triple {139#(and (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {139#(and (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:07:25,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {139#(and (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {140#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) (div |ULTIMATE.start_main_~x~0#1| 4294967296)) (<= (+ 9999999 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:07:25,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {140#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) (div |ULTIMATE.start_main_~x~0#1| 4294967296)) (<= (+ 9999999 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|))} assume !(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {137#false} is VALID [2022-02-20 17:07:25,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {137#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~z~0#1 % 4294967296 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {137#false} is VALID [2022-02-20 17:07:25,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {137#false} assume 0 == __VERIFIER_assert_~cond#1; {137#false} is VALID [2022-02-20 17:07:25,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {137#false} assume !false; {137#false} is VALID [2022-02-20 17:07:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:25,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:07:25,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097721513] [2022-02-20 17:07:25,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097721513] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:07:25,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263876527] [2022-02-20 17:07:25,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:25,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:07:25,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:07:25,151 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-02-20 17:07:25,152 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-02-20 17:07:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:25,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 17:07:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:25,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:07:25,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#true} assume { :begin_inline_ULTIMATE.init } 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(18, 2);call #Ultimate.allocInit(12, 3); {136#true} is VALID [2022-02-20 17:07:25,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~post5#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := 0;main_~y~0#1 := 10000000;main_~z~0#1 := 5000000; {138#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:07:25,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {138#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {138#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:07:25,503 INFO L290 TraceCheckUtils]: 3: Hoare triple {138#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {138#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:07:25,504 INFO L290 TraceCheckUtils]: 4: Hoare triple {138#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {156#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:07:25,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} assume !(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {137#false} is VALID [2022-02-20 17:07:25,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {137#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~z~0#1 % 4294967296 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {137#false} is VALID [2022-02-20 17:07:25,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {137#false} assume 0 == __VERIFIER_assert_~cond#1; {137#false} is VALID [2022-02-20 17:07:25,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {137#false} assume !false; {137#false} is VALID [2022-02-20 17:07:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:25,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:07:25,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {137#false} assume !false; {137#false} is VALID [2022-02-20 17:07:25,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {137#false} assume 0 == __VERIFIER_assert_~cond#1; {137#false} is VALID [2022-02-20 17:07:25,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {137#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~z~0#1 % 4294967296 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {137#false} is VALID [2022-02-20 17:07:25,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {178#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} assume !(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {137#false} is VALID [2022-02-20 17:07:25,583 INFO L290 TraceCheckUtils]: 4: Hoare triple {182#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {178#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} is VALID [2022-02-20 17:07:25,584 INFO L290 TraceCheckUtils]: 3: Hoare triple {182#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {182#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} is VALID [2022-02-20 17:07:25,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#(or (not (< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {182#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} is VALID [2022-02-20 17:07:25,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~post5#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := 0;main_~y~0#1 := 10000000;main_~z~0#1 := 5000000; {189#(or (not (< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)))} is VALID [2022-02-20 17:07:25,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#true} assume { :begin_inline_ULTIMATE.init } 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(18, 2);call #Ultimate.allocInit(12, 3); {136#true} is VALID [2022-02-20 17:07:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:25,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263876527] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:07:25,585 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:07:25,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2022-02-20 17:07:25,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784987667] [2022-02-20 17:07:25,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:07:25,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:07:25,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:07:25,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:25,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:25,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:07:25,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:07:25,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:07:25,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:07:25,601 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:25,722 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-02-20 17:07:25,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:07:25,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:07:25,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:07:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-02-20 17:07:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-02-20 17:07:25,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2022-02-20 17:07:25,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:25,752 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:07:25,753 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 17:07:25,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:07:25,754 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:07:25,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 15 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:07:25,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 17:07:25,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 17:07:25,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:07:25,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:25,761 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:25,761 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:25,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:25,762 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-02-20 17:07:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-02-20 17:07:25,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:25,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:25,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 17:07:25,763 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 17:07:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:25,764 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-02-20 17:07:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-02-20 17:07:25,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:25,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:25,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:07:25,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:07:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-02-20 17:07:25,765 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2022-02-20 17:07:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:07:25,765 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-02-20 17:07:25,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-02-20 17:07:25,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:07:25,766 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:07:25,766 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-02-20 17:07:25,785 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-02-20 17:07:25,979 WARN L452 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-02-20 17:07:25,980 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:07:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:07:25,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2022-02-20 17:07:25,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:07:25,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985612849] [2022-02-20 17:07:25,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:25,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:07:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:26,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {291#true} assume { :begin_inline_ULTIMATE.init } 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(18, 2);call #Ultimate.allocInit(12, 3); {291#true} is VALID [2022-02-20 17:07:26,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~post5#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := 0;main_~y~0#1 := 10000000;main_~z~0#1 := 5000000; {293#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:07:26,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {294#(and (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:07:26,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {294#(and (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {294#(and (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:07:26,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {294#(and (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {295#(and (<= 1 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999999 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:26,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#(and (<= 1 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999999 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {295#(and (<= 1 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999999 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:26,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {295#(and (<= 1 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999999 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {295#(and (<= 1 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999999 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:26,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {295#(and (<= 1 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999999 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {296#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999998) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:26,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {296#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999998) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {296#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999998) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:26,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999998) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {296#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999998) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:26,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999998) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {297#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999997) |ULTIMATE.start_main_~y~0#1|) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:26,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {297#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999997) |ULTIMATE.start_main_~y~0#1|) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {297#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999997) |ULTIMATE.start_main_~y~0#1|) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:26,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {297#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999997) |ULTIMATE.start_main_~y~0#1|) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {297#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999997) |ULTIMATE.start_main_~y~0#1|) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:26,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {297#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999997) |ULTIMATE.start_main_~y~0#1|) (<= 3 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {298#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) (div |ULTIMATE.start_main_~x~0#1| 4294967296)) (<= (+ 9999996 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:07:26,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {298#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) (div |ULTIMATE.start_main_~x~0#1| 4294967296)) (<= (+ 9999996 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|))} assume !(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {292#false} is VALID [2022-02-20 17:07:26,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~z~0#1 % 4294967296 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {292#false} is VALID [2022-02-20 17:07:26,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {292#false} assume 0 == __VERIFIER_assert_~cond#1; {292#false} is VALID [2022-02-20 17:07:26,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {292#false} assume !false; {292#false} is VALID [2022-02-20 17:07:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:26,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:07:26,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985612849] [2022-02-20 17:07:26,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985612849] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:07:26,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759623305] [2022-02-20 17:07:26,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:07:26,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:07:26,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:07:26,189 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-02-20 17:07:26,191 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-02-20 17:07:26,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:07:26,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:07:26,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 17:07:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:26,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:07:26,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {291#true} assume { :begin_inline_ULTIMATE.init } 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(18, 2);call #Ultimate.allocInit(12, 3); {291#true} is VALID [2022-02-20 17:07:26,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~post5#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := 0;main_~y~0#1 := 10000000;main_~z~0#1 := 5000000; {293#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:07:26,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {293#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:07:26,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {293#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {293#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:07:26,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {293#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {314#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0))} is VALID [2022-02-20 17:07:26,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {314#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0))} is VALID [2022-02-20 17:07:26,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {314#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {314#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0))} is VALID [2022-02-20 17:07:26,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {324#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~x~0#1|) 0))} is VALID [2022-02-20 17:07:26,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {324#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~x~0#1|) 0))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {324#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~x~0#1|) 0))} is VALID [2022-02-20 17:07:26,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {324#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~x~0#1|) 0))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {324#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~x~0#1|) 0))} is VALID [2022-02-20 17:07:26,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {324#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~x~0#1|) 0))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {334#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:26,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {334#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {334#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:26,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {334#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {334#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:26,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {334#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {344#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= 3 (+ (- 1) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:07:26,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {344#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= 3 (+ (- 1) |ULTIMATE.start_main_~x~0#1|)))} assume !(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {292#false} is VALID [2022-02-20 17:07:26,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~z~0#1 % 4294967296 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {292#false} is VALID [2022-02-20 17:07:26,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {292#false} assume 0 == __VERIFIER_assert_~cond#1; {292#false} is VALID [2022-02-20 17:07:26,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {292#false} assume !false; {292#false} is VALID [2022-02-20 17:07:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:26,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:07:26,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {292#false} assume !false; {292#false} is VALID [2022-02-20 17:07:26,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {292#false} assume 0 == __VERIFIER_assert_~cond#1; {292#false} is VALID [2022-02-20 17:07:26,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~z~0#1 % 4294967296 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {292#false} is VALID [2022-02-20 17:07:26,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {366#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} assume !(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {292#false} is VALID [2022-02-20 17:07:26,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {370#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {366#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} is VALID [2022-02-20 17:07:26,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {370#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {370#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} is VALID [2022-02-20 17:07:26,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {370#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {370#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} is VALID [2022-02-20 17:07:26,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {380#(< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {370#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} is VALID [2022-02-20 17:07:26,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {380#(< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {380#(< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} is VALID [2022-02-20 17:07:26,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {387#(or (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)) (not (< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {380#(< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} is VALID [2022-02-20 17:07:26,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {391#(or (< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)) (not (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {387#(or (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)) (not (< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))))} is VALID [2022-02-20 17:07:26,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {391#(or (< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)) (not (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {391#(or (< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)) (not (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))))} is VALID [2022-02-20 17:07:26,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {391#(or (< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)) (not (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {391#(or (< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)) (not (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))))} is VALID [2022-02-20 17:07:26,830 INFO L290 TraceCheckUtils]: 4: Hoare triple {401#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)) (not (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {391#(or (< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)) (not (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))))} is VALID [2022-02-20 17:07:26,831 INFO L290 TraceCheckUtils]: 3: Hoare triple {401#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)) (not (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {401#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)) (not (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))))} is VALID [2022-02-20 17:07:26,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {401#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)) (not (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {401#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)) (not (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))))} is VALID [2022-02-20 17:07:26,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~post5#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := 0;main_~y~0#1 := 10000000;main_~z~0#1 := 5000000; {401#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)) (not (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))))} is VALID [2022-02-20 17:07:26,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {291#true} assume { :begin_inline_ULTIMATE.init } 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(18, 2);call #Ultimate.allocInit(12, 3); {291#true} is VALID [2022-02-20 17:07:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:26,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759623305] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:07:26,832 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:07:26,832 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 18 [2022-02-20 17:07:26,832 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420962389] [2022-02-20 17:07:26,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:07:26,833 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 17:07:26,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:07:26,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:26,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:26,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 17:07:26,869 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:07:26,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 17:07:26,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:07:26,870 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:27,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:27,740 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-02-20 17:07:27,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:07:27,740 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 17:07:27,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:07:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2022-02-20 17:07:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2022-02-20 17:07:27,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 59 transitions. [2022-02-20 17:07:27,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:27,802 INFO L225 Difference]: With dead ends: 46 [2022-02-20 17:07:27,802 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 17:07:27,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2022-02-20 17:07:27,803 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 49 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:07:27,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 23 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:07:27,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 17:07:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-20 17:07:27,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:07:27,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:27,829 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:27,829 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:27,833 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-02-20 17:07:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-02-20 17:07:27,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:27,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:27,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 17:07:27,834 INFO L87 Difference]: Start difference. First operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 17:07:27,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:27,835 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-02-20 17:07:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-02-20 17:07:27,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:27,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:27,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:07:27,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:07:27,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-02-20 17:07:27,837 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 18 [2022-02-20 17:07:27,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:07:27,838 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-02-20 17:07:27,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-02-20 17:07:27,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:07:27,838 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:07:27,839 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-02-20 17:07:27,863 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-02-20 17:07:28,055 WARN L452 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-02-20 17:07:28,055 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:07:28,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:07:28,056 INFO L85 PathProgramCache]: Analyzing trace with hash -51731342, now seen corresponding path program 3 times [2022-02-20 17:07:28,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:07:28,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643220915] [2022-02-20 17:07:28,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:28,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:07:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:28,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {602#true} assume { :begin_inline_ULTIMATE.init } 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(18, 2);call #Ultimate.allocInit(12, 3); {602#true} is VALID [2022-02-20 17:07:28,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {602#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~post5#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := 0;main_~y~0#1 := 10000000;main_~z~0#1 := 5000000; {604#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:07:28,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {604#(and (<= |ULTIMATE.start_main_~y~0#1| 10000000) (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {605#(and (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:07:28,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {605#(and (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {605#(and (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:07:28,356 INFO L290 TraceCheckUtils]: 4: Hoare triple {605#(and (<= 10000000 |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {606#(and (<= 1 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999999 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:28,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {606#(and (<= 1 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999999 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {606#(and (<= 1 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999999 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:28,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {606#(and (<= 1 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999999 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {606#(and (<= 1 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999999 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:28,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {606#(and (<= 1 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999999 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {607#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999998) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:28,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {607#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999998) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {607#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999998) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:28,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {607#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999998) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {607#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999998) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:28,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {607#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999998) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {608#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999997) |ULTIMATE.start_main_~y~0#1|) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:28,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999997) |ULTIMATE.start_main_~y~0#1|) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {608#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999997) |ULTIMATE.start_main_~y~0#1|) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:28,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {608#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999997) |ULTIMATE.start_main_~y~0#1|) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {608#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999997) |ULTIMATE.start_main_~y~0#1|) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:28,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {608#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999997) |ULTIMATE.start_main_~y~0#1|) (<= 3 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {609#(and (<= (+ 9999996 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:28,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {609#(and (<= (+ 9999996 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {609#(and (<= (+ 9999996 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:28,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {609#(and (<= (+ 9999996 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {609#(and (<= (+ 9999996 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:28,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {609#(and (<= (+ 9999996 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= 4 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {610#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999995) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:07:28,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {610#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999995) |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {610#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999995) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:07:28,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {610#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999995) |ULTIMATE.start_main_~y~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {610#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999995) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:07:28,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {610#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= (+ |ULTIMATE.start_main_~x~0#1| 9999995) |ULTIMATE.start_main_~y~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {611#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999994 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:28,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {611#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999994 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {611#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999994 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:28,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {611#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999994 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {611#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999994 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:28,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {611#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= (+ 9999994 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {612#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 9999993) |ULTIMATE.start_main_~y~0#1|) (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:28,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {612#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 9999993) |ULTIMATE.start_main_~y~0#1|) (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {612#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 9999993) |ULTIMATE.start_main_~y~0#1|) (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:28,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {612#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 9999993) |ULTIMATE.start_main_~y~0#1|) (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {612#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 9999993) |ULTIMATE.start_main_~y~0#1|) (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:28,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {612#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 9999993) |ULTIMATE.start_main_~y~0#1|) (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {613#(and (<= (+ 9999992 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:28,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {613#(and (<= (+ 9999992 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {613#(and (<= (+ 9999992 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:28,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {613#(and (<= (+ 9999992 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {613#(and (<= (+ 9999992 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} is VALID [2022-02-20 17:07:28,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {613#(and (<= (+ 9999992 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {614#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 9999991) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= 9 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:28,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {614#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 9999991) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= 9 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {614#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 9999991) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= 9 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:28,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {614#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 9999991) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= 9 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {614#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 9999991) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= 9 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:28,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {614#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 9999991) |ULTIMATE.start_main_~y~0#1|) (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) 0) (<= 9 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {615#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) (div |ULTIMATE.start_main_~x~0#1| 4294967296)) (<= (+ 9999990 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:07:28,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {615#(and (<= (div |ULTIMATE.start_main_~y~0#1| 4294967296) (div |ULTIMATE.start_main_~x~0#1| 4294967296)) (<= (+ 9999990 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|))} assume !(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {603#false} is VALID [2022-02-20 17:07:28,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {603#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~z~0#1 % 4294967296 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {603#false} is VALID [2022-02-20 17:07:28,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {603#false} assume 0 == __VERIFIER_assert_~cond#1; {603#false} is VALID [2022-02-20 17:07:28,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {603#false} assume !false; {603#false} is VALID [2022-02-20 17:07:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:28,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:07:28,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643220915] [2022-02-20 17:07:28,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643220915] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:07:28,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100575481] [2022-02-20 17:07:28,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:07:28,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:07:28,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:07:28,388 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-02-20 17:07:28,390 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-02-20 17:07:28,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 17:07:28,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:07:28,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:07:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:28,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:07:28,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {602#true} assume { :begin_inline_ULTIMATE.init } 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(18, 2);call #Ultimate.allocInit(12, 3); {602#true} is VALID [2022-02-20 17:07:28,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {602#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~post5#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := 0;main_~y~0#1 := 10000000;main_~z~0#1 := 5000000; {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,854 INFO L290 TraceCheckUtils]: 3: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !(main_~x~0#1 % 4294967296 >= 5000000); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,854 INFO L290 TraceCheckUtils]: 4: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !(main_~x~0#1 % 4294967296 >= 5000000); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !(main_~x~0#1 % 4294967296 >= 5000000); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !(main_~x~0#1 % 4294967296 >= 5000000); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !(main_~x~0#1 % 4294967296 >= 5000000); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !(main_~x~0#1 % 4294967296 >= 5000000); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !(main_~x~0#1 % 4294967296 >= 5000000); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !(main_~x~0#1 % 4294967296 >= 5000000); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !(main_~x~0#1 % 4294967296 >= 5000000); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} is VALID [2022-02-20 17:07:28,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {622#(= |ULTIMATE.start_main_~y~0#1| 10000000)} assume !(main_~x~0#1 % 4294967296 >= 5000000); {710#(and (= |ULTIMATE.start_main_~y~0#1| 10000000) (not (<= 5000000 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))))} is VALID [2022-02-20 17:07:28,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {710#(and (= |ULTIMATE.start_main_~y~0#1| 10000000) (not (<= 5000000 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {714#(and (= |ULTIMATE.start_main_~y~0#1| 10000000) (not (<= 5000000 (mod (+ 4294967295 |ULTIMATE.start_main_~x~0#1|) 4294967296))))} is VALID [2022-02-20 17:07:28,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {714#(and (= |ULTIMATE.start_main_~y~0#1| 10000000) (not (<= 5000000 (mod (+ 4294967295 |ULTIMATE.start_main_~x~0#1|) 4294967296))))} assume !(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {603#false} is VALID [2022-02-20 17:07:28,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {603#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~z~0#1 % 4294967296 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {603#false} is VALID [2022-02-20 17:07:28,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {603#false} assume 0 == __VERIFIER_assert_~cond#1; {603#false} is VALID [2022-02-20 17:07:28,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {603#false} assume !false; {603#false} is VALID [2022-02-20 17:07:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-02-20 17:07:28,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:07:28,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100575481] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:07:28,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:07:28,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2022-02-20 17:07:28,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420956478] [2022-02-20 17:07:28,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:07:28,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-02-20 17:07:28,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:07:28,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:28,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:28,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:07:28,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:07:28,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:07:28,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:07:28,875 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:28,956 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-02-20 17:07:28,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:07:28,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-02-20 17:07:28,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:07:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-02-20 17:07:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-02-20 17:07:28,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2022-02-20 17:07:28,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:28,979 INFO L225 Difference]: With dead ends: 63 [2022-02-20 17:07:28,979 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 17:07:28,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-02-20 17:07:28,980 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:07:28,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 10 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:07:28,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 17:07:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2022-02-20 17:07:29,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:07:29,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:29,021 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:29,021 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:29,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:29,023 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-02-20 17:07:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-02-20 17:07:29,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:29,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:29,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 59 states. [2022-02-20 17:07:29,023 INFO L87 Difference]: Start difference. First operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 59 states. [2022-02-20 17:07:29,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:29,025 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-02-20 17:07:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-02-20 17:07:29,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:29,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:29,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:07:29,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:07:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-02-20 17:07:29,027 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 36 [2022-02-20 17:07:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:07:29,027 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-02-20 17:07:29,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-02-20 17:07:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:07:29,028 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:07:29,028 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:07:29,044 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-02-20 17:07:29,241 WARN L452 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-02-20 17:07:29,242 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:07:29,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:07:29,242 INFO L85 PathProgramCache]: Analyzing trace with hash -108989644, now seen corresponding path program 1 times [2022-02-20 17:07:29,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:07:29,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452271677] [2022-02-20 17:07:29,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:29,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:07:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:29,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {973#true} assume { :begin_inline_ULTIMATE.init } 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(18, 2);call #Ultimate.allocInit(12, 3); {973#true} is VALID [2022-02-20 17:07:29,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {973#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~post5#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := 0;main_~y~0#1 := 10000000;main_~z~0#1 := 5000000; {975#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:29,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {975#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {975#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:29,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {975#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !(main_~x~0#1 % 4294967296 >= 5000000); {975#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:29,407 INFO L290 TraceCheckUtils]: 4: Hoare triple {975#(= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {976#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {976#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {976#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {976#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {976#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {976#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {977#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:29,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {977#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {977#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:29,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {977#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {977#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:29,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {977#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {978#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {978#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {978#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {978#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {978#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {978#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {979#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {979#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {979#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {979#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {979#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {979#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {980#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} is VALID [2022-02-20 17:07:29,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {980#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {980#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} is VALID [2022-02-20 17:07:29,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {980#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {980#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} is VALID [2022-02-20 17:07:29,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {980#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {981#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:07:29,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {981#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {981#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:07:29,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {981#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {981#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:07:29,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {981#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {982#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} is VALID [2022-02-20 17:07:29,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {982#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {982#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} is VALID [2022-02-20 17:07:29,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {982#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {982#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} is VALID [2022-02-20 17:07:29,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {982#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {983#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:07:29,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {983#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {983#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:07:29,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {983#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {983#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:07:29,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {983#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {984#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 9))} is VALID [2022-02-20 17:07:29,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {984#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 9))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {984#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 9))} is VALID [2022-02-20 17:07:29,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {984#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 9))} assume main_~x~0#1 % 4294967296 >= 5000000;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {974#false} is VALID [2022-02-20 17:07:29,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {974#false} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {974#false} is VALID [2022-02-20 17:07:29,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {974#false} assume !(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {974#false} is VALID [2022-02-20 17:07:29,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {974#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~z~0#1 % 4294967296 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {974#false} is VALID [2022-02-20 17:07:29,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {974#false} assume 0 == __VERIFIER_assert_~cond#1; {974#false} is VALID [2022-02-20 17:07:29,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {974#false} assume !false; {974#false} is VALID [2022-02-20 17:07:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:29,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:07:29,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452271677] [2022-02-20 17:07:29,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452271677] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:07:29,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139139573] [2022-02-20 17:07:29,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:29,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:07:29,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:07:29,424 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-02-20 17:07:29,425 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-02-20 17:07:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:29,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 17:07:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:29,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:07:29,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {973#true} assume { :begin_inline_ULTIMATE.init } 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(18, 2);call #Ultimate.allocInit(12, 3); {973#true} is VALID [2022-02-20 17:07:29,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {973#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~post5#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := 0;main_~y~0#1 := 10000000;main_~z~0#1 := 5000000; {975#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:29,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {975#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {975#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:29,893 INFO L290 TraceCheckUtils]: 3: Hoare triple {975#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !(main_~x~0#1 % 4294967296 >= 5000000); {975#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:29,896 INFO L290 TraceCheckUtils]: 4: Hoare triple {975#(= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {976#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {976#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {976#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {976#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {976#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {976#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {977#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:29,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {977#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {977#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:29,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {977#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {977#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:29,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {977#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {978#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {978#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {978#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {978#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {978#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {978#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {979#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {979#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {979#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {979#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {979#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:29,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {979#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {980#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} is VALID [2022-02-20 17:07:29,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {980#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {980#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} is VALID [2022-02-20 17:07:29,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {980#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {980#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} is VALID [2022-02-20 17:07:29,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {980#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {981#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:07:29,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {981#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {981#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:07:29,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {981#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {981#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:07:29,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {981#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {982#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} is VALID [2022-02-20 17:07:29,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {982#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {982#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} is VALID [2022-02-20 17:07:29,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {982#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {982#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} is VALID [2022-02-20 17:07:29,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {982#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {983#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:07:29,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {983#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {983#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:07:29,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {983#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {983#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:07:29,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {983#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1072#(and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9))} is VALID [2022-02-20 17:07:29,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {1072#(and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1072#(and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9))} is VALID [2022-02-20 17:07:29,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {1072#(and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9))} assume main_~x~0#1 % 4294967296 >= 5000000;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {974#false} is VALID [2022-02-20 17:07:29,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {974#false} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {974#false} is VALID [2022-02-20 17:07:29,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {974#false} assume !(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {974#false} is VALID [2022-02-20 17:07:29,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {974#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~z~0#1 % 4294967296 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {974#false} is VALID [2022-02-20 17:07:29,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {974#false} assume 0 == __VERIFIER_assert_~cond#1; {974#false} is VALID [2022-02-20 17:07:29,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {974#false} assume !false; {974#false} is VALID [2022-02-20 17:07:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:29,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:07:30,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {974#false} assume !false; {974#false} is VALID [2022-02-20 17:07:30,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {974#false} assume 0 == __VERIFIER_assert_~cond#1; {974#false} is VALID [2022-02-20 17:07:30,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {974#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~z~0#1 % 4294967296 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {974#false} is VALID [2022-02-20 17:07:30,442 INFO L290 TraceCheckUtils]: 32: Hoare triple {974#false} assume !(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {974#false} is VALID [2022-02-20 17:07:30,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {974#false} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {974#false} is VALID [2022-02-20 17:07:30,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {1109#(not (<= 5000000 (mod |ULTIMATE.start_main_~x~0#1| 4294967296)))} assume main_~x~0#1 % 4294967296 >= 5000000;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {974#false} is VALID [2022-02-20 17:07:30,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {1113#(or (not (<= 5000000 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))) (<= 4294967295 (mod |ULTIMATE.start_main_~x~0#1| 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1109#(not (<= 5000000 (mod |ULTIMATE.start_main_~x~0#1| 4294967296)))} is VALID [2022-02-20 17:07:30,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {1117#(or (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1113#(or (not (<= 5000000 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))) (<= 4294967295 (mod |ULTIMATE.start_main_~x~0#1| 4294967296)))} is VALID [2022-02-20 17:07:30,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {1117#(or (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1117#(or (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296)))} is VALID [2022-02-20 17:07:30,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {1117#(or (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1117#(or (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296)))} is VALID [2022-02-20 17:07:30,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {1127#(or (<= 4294967295 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (not (<= 5000000 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1117#(or (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296)))} is VALID [2022-02-20 17:07:30,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {1127#(or (<= 4294967295 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (not (<= 5000000 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1127#(or (<= 4294967295 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (not (<= 5000000 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))))} is VALID [2022-02-20 17:07:30,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {1127#(or (<= 4294967295 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (not (<= 5000000 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1127#(or (<= 4294967295 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (not (<= 5000000 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))))} is VALID [2022-02-20 17:07:30,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {1137#(or (<= 4294967295 (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (not (<= 5000000 (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296))))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1127#(or (<= 4294967295 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (not (<= 5000000 (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))))} is VALID [2022-02-20 17:07:30,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {1137#(or (<= 4294967295 (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (not (<= 5000000 (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296))))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1137#(or (<= 4294967295 (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (not (<= 5000000 (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296))))} is VALID [2022-02-20 17:07:30,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {1137#(or (<= 4294967295 (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (not (<= 5000000 (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296))))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1137#(or (<= 4294967295 (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (not (<= 5000000 (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296))))} is VALID [2022-02-20 17:07:30,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {1147#(or (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1137#(or (<= 4294967295 (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (not (<= 5000000 (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296))))} is VALID [2022-02-20 17:07:30,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {1147#(or (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1147#(or (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)))} is VALID [2022-02-20 17:07:30,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {1147#(or (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1147#(or (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)))} is VALID [2022-02-20 17:07:30,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {1157#(or (not (<= 5000000 (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1147#(or (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)))} is VALID [2022-02-20 17:07:30,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {1157#(or (not (<= 5000000 (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1157#(or (not (<= 5000000 (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} is VALID [2022-02-20 17:07:30,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {1157#(or (not (<= 5000000 (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1157#(or (not (<= 5000000 (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} is VALID [2022-02-20 17:07:30,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {1167#(or (not (<= 5000000 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1157#(or (not (<= 5000000 (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} is VALID [2022-02-20 17:07:30,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {1167#(or (not (<= 5000000 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1167#(or (not (<= 5000000 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} is VALID [2022-02-20 17:07:30,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {1167#(or (not (<= 5000000 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1167#(or (not (<= 5000000 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} is VALID [2022-02-20 17:07:30,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {1177#(or (not (<= 5000000 (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1167#(or (not (<= 5000000 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} is VALID [2022-02-20 17:07:30,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {1177#(or (not (<= 5000000 (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1177#(or (not (<= 5000000 (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} is VALID [2022-02-20 17:07:30,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {1177#(or (not (<= 5000000 (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1177#(or (not (<= 5000000 (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} is VALID [2022-02-20 17:07:30,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {1187#(or (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296))))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1177#(or (not (<= 5000000 (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} is VALID [2022-02-20 17:07:30,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {1187#(or (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296))))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1187#(or (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296))))} is VALID [2022-02-20 17:07:30,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {1187#(or (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296))))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1187#(or (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296))))} is VALID [2022-02-20 17:07:30,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {1197#(or (not (<= 5000000 (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1187#(or (<= 4294967295 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (not (<= 5000000 (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296))))} is VALID [2022-02-20 17:07:30,465 INFO L290 TraceCheckUtils]: 3: Hoare triple {1197#(or (not (<= 5000000 (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1197#(or (not (<= 5000000 (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} is VALID [2022-02-20 17:07:30,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {1197#(or (not (<= 5000000 (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1197#(or (not (<= 5000000 (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} is VALID [2022-02-20 17:07:30,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {973#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~post5#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := 0;main_~y~0#1 := 10000000;main_~z~0#1 := 5000000; {1197#(or (not (<= 5000000 (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296))) (<= 4294967295 (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296)))} is VALID [2022-02-20 17:07:30,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {973#true} assume { :begin_inline_ULTIMATE.init } 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(18, 2);call #Ultimate.allocInit(12, 3); {973#true} is VALID [2022-02-20 17:07:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:30,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139139573] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:07:30,467 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:07:30,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 24 [2022-02-20 17:07:30,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984197258] [2022-02-20 17:07:30,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:07:30,467 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-02-20 17:07:30,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:07:30,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:30,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:30,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 17:07:30,520 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:07:30,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 17:07:30,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2022-02-20 17:07:30,521 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:34,613 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2022-02-20 17:07:34,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 17:07:34,613 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-02-20 17:07:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:07:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 93 transitions. [2022-02-20 17:07:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 93 transitions. [2022-02-20 17:07:34,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 93 transitions. [2022-02-20 17:07:34,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:34,724 INFO L225 Difference]: With dead ends: 88 [2022-02-20 17:07:34,724 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 17:07:34,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=393, Invalid=663, Unknown=0, NotChecked=0, Total=1056 [2022-02-20 17:07:34,725 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 51 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:07:34,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 37 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:07:34,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 17:07:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-02-20 17:07:34,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:07:34,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:34,787 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:34,788 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:34,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:34,789 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-02-20 17:07:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-02-20 17:07:34,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:34,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:34,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 70 states. [2022-02-20 17:07:34,790 INFO L87 Difference]: Start difference. First operand has 70 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 70 states. [2022-02-20 17:07:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:07:34,791 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-02-20 17:07:34,791 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-02-20 17:07:34,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:07:34,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:07:34,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:07:34,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:07:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2022-02-20 17:07:34,792 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 36 [2022-02-20 17:07:34,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:07:34,793 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2022-02-20 17:07:34,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-02-20 17:07:34,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 17:07:34,794 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:07:34,794 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:07:34,826 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-02-20 17:07:35,003 WARN L452 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-02-20 17:07:35,004 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:07:35,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:07:35,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1647036101, now seen corresponding path program 2 times [2022-02-20 17:07:35,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:07:35,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192214769] [2022-02-20 17:07:35,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:07:35,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:07:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:35,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {1574#true} assume { :begin_inline_ULTIMATE.init } 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(18, 2);call #Ultimate.allocInit(12, 3); {1574#true} is VALID [2022-02-20 17:07:35,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~post5#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := 0;main_~y~0#1 := 10000000;main_~z~0#1 := 5000000; {1576#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:35,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1576#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:35,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {1576#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1576#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:35,439 INFO L290 TraceCheckUtils]: 4: Hoare triple {1576#(= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1577#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {1577#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1577#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {1577#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1577#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {1577#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1578#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:35,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {1578#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1578#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:35,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {1578#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1578#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:35,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {1578#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1579#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {1579#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1579#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {1579#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1579#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {1579#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1580#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {1580#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1580#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {1580#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1580#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {1580#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1581#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} is VALID [2022-02-20 17:07:35,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {1581#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1581#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} is VALID [2022-02-20 17:07:35,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {1581#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1581#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} is VALID [2022-02-20 17:07:35,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {1581#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1582#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:07:35,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {1582#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1582#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:07:35,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {1582#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1582#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:07:35,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {1582#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1583#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} is VALID [2022-02-20 17:07:35,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {1583#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1583#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} is VALID [2022-02-20 17:07:35,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {1583#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1583#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} is VALID [2022-02-20 17:07:35,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {1583#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1584#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:07:35,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {1584#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1584#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:07:35,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {1584#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1584#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:07:35,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {1584#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1585#(and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9))} is VALID [2022-02-20 17:07:35,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {1585#(and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1585#(and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9))} is VALID [2022-02-20 17:07:35,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {1585#(and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1585#(and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9))} is VALID [2022-02-20 17:07:35,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {1585#(and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1586#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {1586#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1586#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {1586#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1586#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {1586#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1587#(and (<= |ULTIMATE.start_main_~x~0#1| 11) (<= 11 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {1587#(and (<= |ULTIMATE.start_main_~x~0#1| 11) (<= 11 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1587#(and (<= |ULTIMATE.start_main_~x~0#1| 11) (<= 11 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,452 INFO L290 TraceCheckUtils]: 36: Hoare triple {1587#(and (<= |ULTIMATE.start_main_~x~0#1| 11) (<= 11 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1587#(and (<= |ULTIMATE.start_main_~x~0#1| 11) (<= 11 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {1587#(and (<= |ULTIMATE.start_main_~x~0#1| 11) (<= 11 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1588#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,453 INFO L290 TraceCheckUtils]: 38: Hoare triple {1588#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1588#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,453 INFO L290 TraceCheckUtils]: 39: Hoare triple {1588#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1588#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,453 INFO L290 TraceCheckUtils]: 40: Hoare triple {1588#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1589#(and (<= |ULTIMATE.start_main_~x~0#1| 13) (<= 13 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,454 INFO L290 TraceCheckUtils]: 41: Hoare triple {1589#(and (<= |ULTIMATE.start_main_~x~0#1| 13) (<= 13 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1589#(and (<= |ULTIMATE.start_main_~x~0#1| 13) (<= 13 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,454 INFO L290 TraceCheckUtils]: 42: Hoare triple {1589#(and (<= |ULTIMATE.start_main_~x~0#1| 13) (<= 13 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1589#(and (<= |ULTIMATE.start_main_~x~0#1| 13) (<= 13 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,454 INFO L290 TraceCheckUtils]: 43: Hoare triple {1589#(and (<= |ULTIMATE.start_main_~x~0#1| 13) (<= 13 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1590#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,455 INFO L290 TraceCheckUtils]: 44: Hoare triple {1590#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1590#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,455 INFO L290 TraceCheckUtils]: 45: Hoare triple {1590#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1590#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,455 INFO L290 TraceCheckUtils]: 46: Hoare triple {1590#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1591#(and (<= |ULTIMATE.start_main_~x~0#1| 15) (<= 15 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,456 INFO L290 TraceCheckUtils]: 47: Hoare triple {1591#(and (<= |ULTIMATE.start_main_~x~0#1| 15) (<= 15 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1591#(and (<= |ULTIMATE.start_main_~x~0#1| 15) (<= 15 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,456 INFO L290 TraceCheckUtils]: 48: Hoare triple {1591#(and (<= |ULTIMATE.start_main_~x~0#1| 15) (<= 15 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1591#(and (<= |ULTIMATE.start_main_~x~0#1| 15) (<= 15 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,457 INFO L290 TraceCheckUtils]: 49: Hoare triple {1591#(and (<= |ULTIMATE.start_main_~x~0#1| 15) (<= 15 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1592#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,457 INFO L290 TraceCheckUtils]: 50: Hoare triple {1592#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1592#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,457 INFO L290 TraceCheckUtils]: 51: Hoare triple {1592#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1592#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,458 INFO L290 TraceCheckUtils]: 52: Hoare triple {1592#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1593#(and (<= 17 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 17))} is VALID [2022-02-20 17:07:35,458 INFO L290 TraceCheckUtils]: 53: Hoare triple {1593#(and (<= 17 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 17))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1593#(and (<= 17 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 17))} is VALID [2022-02-20 17:07:35,458 INFO L290 TraceCheckUtils]: 54: Hoare triple {1593#(and (<= 17 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 17))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1593#(and (<= 17 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 17))} is VALID [2022-02-20 17:07:35,459 INFO L290 TraceCheckUtils]: 55: Hoare triple {1593#(and (<= 17 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 17))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1594#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,459 INFO L290 TraceCheckUtils]: 56: Hoare triple {1594#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1594#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,459 INFO L290 TraceCheckUtils]: 57: Hoare triple {1594#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1594#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:35,461 INFO L290 TraceCheckUtils]: 58: Hoare triple {1594#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1595#(and (<= 19 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 19))} is VALID [2022-02-20 17:07:35,462 INFO L290 TraceCheckUtils]: 59: Hoare triple {1595#(and (<= 19 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 19))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1595#(and (<= 19 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 19))} is VALID [2022-02-20 17:07:35,462 INFO L290 TraceCheckUtils]: 60: Hoare triple {1595#(and (<= 19 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 19))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1595#(and (<= 19 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 19))} is VALID [2022-02-20 17:07:35,462 INFO L290 TraceCheckUtils]: 61: Hoare triple {1595#(and (<= 19 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 19))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1596#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 20))} is VALID [2022-02-20 17:07:35,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {1596#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 20))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1596#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 20))} is VALID [2022-02-20 17:07:35,463 INFO L290 TraceCheckUtils]: 63: Hoare triple {1596#(and (not (<= (+ (div |ULTIMATE.start_main_~x~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~x~0#1| 20))} assume main_~x~0#1 % 4294967296 >= 5000000;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1575#false} is VALID [2022-02-20 17:07:35,463 INFO L290 TraceCheckUtils]: 64: Hoare triple {1575#false} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1575#false} is VALID [2022-02-20 17:07:35,463 INFO L290 TraceCheckUtils]: 65: Hoare triple {1575#false} assume !(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1575#false} is VALID [2022-02-20 17:07:35,463 INFO L290 TraceCheckUtils]: 66: Hoare triple {1575#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~z~0#1 % 4294967296 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1575#false} is VALID [2022-02-20 17:07:35,463 INFO L290 TraceCheckUtils]: 67: Hoare triple {1575#false} assume 0 == __VERIFIER_assert_~cond#1; {1575#false} is VALID [2022-02-20 17:07:35,463 INFO L290 TraceCheckUtils]: 68: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-02-20 17:07:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:35,464 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:07:35,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192214769] [2022-02-20 17:07:35,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192214769] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:07:35,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513368781] [2022-02-20 17:07:35,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:07:35,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:07:35,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:07:35,466 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-02-20 17:07:35,468 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-02-20 17:07:35,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:07:35,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:07:35,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 47 conjunts are in the unsatisfiable core [2022-02-20 17:07:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:07:35,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:07:36,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {1574#true} assume { :begin_inline_ULTIMATE.init } 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(18, 2);call #Ultimate.allocInit(12, 3); {1574#true} is VALID [2022-02-20 17:07:36,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~post5#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := 0;main_~y~0#1 := 10000000;main_~z~0#1 := 5000000; {1576#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:36,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1576#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:36,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {1576#(= |ULTIMATE.start_main_~x~0#1| 0)} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1576#(= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:07:36,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {1576#(= |ULTIMATE.start_main_~x~0#1| 0)} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1577#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {1577#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1577#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {1577#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1577#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {1577#(and (<= |ULTIMATE.start_main_~x~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1578#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:36,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {1578#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1578#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:36,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {1578#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1578#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} is VALID [2022-02-20 17:07:36,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {1578#(and (<= 2 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1579#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {1579#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1579#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {1579#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1579#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {1579#(and (<= |ULTIMATE.start_main_~x~0#1| 3) (<= 3 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1580#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {1580#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1580#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {1580#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1580#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {1580#(and (<= |ULTIMATE.start_main_~x~0#1| 4) (<= 4 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1581#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} is VALID [2022-02-20 17:07:36,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {1581#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1581#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} is VALID [2022-02-20 17:07:36,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {1581#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1581#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} is VALID [2022-02-20 17:07:36,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {1581#(and (<= 5 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 5))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1582#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:07:36,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {1582#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1582#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:07:36,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {1582#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1582#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} is VALID [2022-02-20 17:07:36,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {1582#(and (<= 6 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 6))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1583#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} is VALID [2022-02-20 17:07:36,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {1583#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1583#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} is VALID [2022-02-20 17:07:36,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {1583#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1583#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} is VALID [2022-02-20 17:07:36,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {1583#(and (<= 7 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 7))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1584#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:07:36,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {1584#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1584#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:07:36,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {1584#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1584#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} is VALID [2022-02-20 17:07:36,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {1584#(and (<= 8 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 8))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1585#(and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9))} is VALID [2022-02-20 17:07:36,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {1585#(and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1585#(and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9))} is VALID [2022-02-20 17:07:36,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {1585#(and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1585#(and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9))} is VALID [2022-02-20 17:07:36,079 INFO L290 TraceCheckUtils]: 31: Hoare triple {1585#(and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1586#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {1586#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1586#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {1586#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1586#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {1586#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (<= 10 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1587#(and (<= |ULTIMATE.start_main_~x~0#1| 11) (<= 11 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {1587#(and (<= |ULTIMATE.start_main_~x~0#1| 11) (<= 11 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1587#(and (<= |ULTIMATE.start_main_~x~0#1| 11) (<= 11 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {1587#(and (<= |ULTIMATE.start_main_~x~0#1| 11) (<= 11 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1587#(and (<= |ULTIMATE.start_main_~x~0#1| 11) (<= 11 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {1587#(and (<= |ULTIMATE.start_main_~x~0#1| 11) (<= 11 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1588#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,085 INFO L290 TraceCheckUtils]: 38: Hoare triple {1588#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1588#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {1588#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1588#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {1588#(and (<= |ULTIMATE.start_main_~x~0#1| 12) (<= 12 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1589#(and (<= |ULTIMATE.start_main_~x~0#1| 13) (<= 13 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,086 INFO L290 TraceCheckUtils]: 41: Hoare triple {1589#(and (<= |ULTIMATE.start_main_~x~0#1| 13) (<= 13 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1589#(and (<= |ULTIMATE.start_main_~x~0#1| 13) (<= 13 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {1589#(and (<= |ULTIMATE.start_main_~x~0#1| 13) (<= 13 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1589#(and (<= |ULTIMATE.start_main_~x~0#1| 13) (<= 13 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {1589#(and (<= |ULTIMATE.start_main_~x~0#1| 13) (<= 13 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1590#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {1590#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1590#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {1590#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1590#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {1590#(and (<= |ULTIMATE.start_main_~x~0#1| 14) (<= 14 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1591#(and (<= |ULTIMATE.start_main_~x~0#1| 15) (<= 15 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {1591#(and (<= |ULTIMATE.start_main_~x~0#1| 15) (<= 15 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1591#(and (<= |ULTIMATE.start_main_~x~0#1| 15) (<= 15 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {1591#(and (<= |ULTIMATE.start_main_~x~0#1| 15) (<= 15 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1591#(and (<= |ULTIMATE.start_main_~x~0#1| 15) (<= 15 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,089 INFO L290 TraceCheckUtils]: 49: Hoare triple {1591#(and (<= |ULTIMATE.start_main_~x~0#1| 15) (<= 15 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1592#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,090 INFO L290 TraceCheckUtils]: 50: Hoare triple {1592#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1592#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,090 INFO L290 TraceCheckUtils]: 51: Hoare triple {1592#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1592#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {1592#(and (<= |ULTIMATE.start_main_~x~0#1| 16) (<= 16 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1593#(and (<= 17 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 17))} is VALID [2022-02-20 17:07:36,091 INFO L290 TraceCheckUtils]: 53: Hoare triple {1593#(and (<= 17 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 17))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1593#(and (<= 17 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 17))} is VALID [2022-02-20 17:07:36,091 INFO L290 TraceCheckUtils]: 54: Hoare triple {1593#(and (<= 17 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 17))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1593#(and (<= 17 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 17))} is VALID [2022-02-20 17:07:36,092 INFO L290 TraceCheckUtils]: 55: Hoare triple {1593#(and (<= 17 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 17))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1594#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,092 INFO L290 TraceCheckUtils]: 56: Hoare triple {1594#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1594#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,092 INFO L290 TraceCheckUtils]: 57: Hoare triple {1594#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1594#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:07:36,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {1594#(and (<= |ULTIMATE.start_main_~x~0#1| 18) (<= 18 |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1595#(and (<= 19 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 19))} is VALID [2022-02-20 17:07:36,093 INFO L290 TraceCheckUtils]: 59: Hoare triple {1595#(and (<= 19 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 19))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1595#(and (<= 19 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 19))} is VALID [2022-02-20 17:07:36,093 INFO L290 TraceCheckUtils]: 60: Hoare triple {1595#(and (<= 19 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 19))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1595#(and (<= 19 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 19))} is VALID [2022-02-20 17:07:36,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {1595#(and (<= 19 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 19))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1783#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 20))} is VALID [2022-02-20 17:07:36,094 INFO L290 TraceCheckUtils]: 62: Hoare triple {1783#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 20))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1787#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)) (<= |ULTIMATE.start_main_~x~0#1| 20))} is VALID [2022-02-20 17:07:36,095 INFO L290 TraceCheckUtils]: 63: Hoare triple {1787#(and (<= 20 |ULTIMATE.start_main_~x~0#1|) (< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)) (<= |ULTIMATE.start_main_~x~0#1| 20))} assume main_~x~0#1 % 4294967296 >= 5000000;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1575#false} is VALID [2022-02-20 17:07:36,095 INFO L290 TraceCheckUtils]: 64: Hoare triple {1575#false} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1575#false} is VALID [2022-02-20 17:07:36,095 INFO L290 TraceCheckUtils]: 65: Hoare triple {1575#false} assume !(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1575#false} is VALID [2022-02-20 17:07:36,095 INFO L290 TraceCheckUtils]: 66: Hoare triple {1575#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~z~0#1 % 4294967296 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1575#false} is VALID [2022-02-20 17:07:36,095 INFO L290 TraceCheckUtils]: 67: Hoare triple {1575#false} assume 0 == __VERIFIER_assert_~cond#1; {1575#false} is VALID [2022-02-20 17:07:36,095 INFO L290 TraceCheckUtils]: 68: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-02-20 17:07:36,096 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:36,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:07:38,148 INFO L290 TraceCheckUtils]: 68: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-02-20 17:07:38,148 INFO L290 TraceCheckUtils]: 67: Hoare triple {1575#false} assume 0 == __VERIFIER_assert_~cond#1; {1575#false} is VALID [2022-02-20 17:07:38,148 INFO L290 TraceCheckUtils]: 66: Hoare triple {1575#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~z~0#1 % 4294967296 == main_~x~0#1 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1575#false} is VALID [2022-02-20 17:07:38,149 INFO L290 TraceCheckUtils]: 65: Hoare triple {1815#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} assume !(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1575#false} is VALID [2022-02-20 17:07:38,150 INFO L290 TraceCheckUtils]: 64: Hoare triple {1819#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1815#(< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} is VALID [2022-02-20 17:07:38,150 INFO L290 TraceCheckUtils]: 63: Hoare triple {1823#(or (not (<= 5000000 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)))} assume main_~x~0#1 % 4294967296 >= 5000000;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1819#(< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296))} is VALID [2022-02-20 17:07:38,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {1827#(or (<= 0 (div (+ (mod |ULTIMATE.start_main_~x~0#1| 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296))) 4294967296)) (< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 5000000))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1823#(or (not (<= 5000000 (mod |ULTIMATE.start_main_~x~0#1| 4294967296))) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~y~0#1| 4294967296)))} is VALID [2022-02-20 17:07:38,152 INFO L290 TraceCheckUtils]: 61: Hoare triple {1831#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1827#(or (<= 0 (div (+ (mod |ULTIMATE.start_main_~x~0#1| 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296))) 4294967296)) (< (mod |ULTIMATE.start_main_~x~0#1| 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,152 INFO L290 TraceCheckUtils]: 60: Hoare triple {1831#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1831#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,152 INFO L290 TraceCheckUtils]: 59: Hoare triple {1831#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1831#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,153 INFO L290 TraceCheckUtils]: 58: Hoare triple {1841#(or (<= 0 (div (+ (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1831#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 1) 4294967296) (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,154 INFO L290 TraceCheckUtils]: 57: Hoare triple {1841#(or (<= 0 (div (+ (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1841#(or (<= 0 (div (+ (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,154 INFO L290 TraceCheckUtils]: 56: Hoare triple {1841#(or (<= 0 (div (+ (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1841#(or (<= 0 (div (+ (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,155 INFO L290 TraceCheckUtils]: 55: Hoare triple {1851#(or (< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)) (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1841#(or (<= 0 (div (+ (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ 2 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,156 INFO L290 TraceCheckUtils]: 54: Hoare triple {1851#(or (< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)) (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1851#(or (< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)) (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)))} is VALID [2022-02-20 17:07:38,156 INFO L290 TraceCheckUtils]: 53: Hoare triple {1851#(or (< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)) (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1851#(or (< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)) (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)))} is VALID [2022-02-20 17:07:38,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {1861#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1851#(or (< (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)) (mod (+ 3 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)))} is VALID [2022-02-20 17:07:38,157 INFO L290 TraceCheckUtils]: 51: Hoare triple {1861#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1861#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)) 4294967296)))} is VALID [2022-02-20 17:07:38,158 INFO L290 TraceCheckUtils]: 50: Hoare triple {1861#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1861#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)) 4294967296)))} is VALID [2022-02-20 17:07:38,158 INFO L290 TraceCheckUtils]: 49: Hoare triple {1871#(or (< (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1861#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 4) 4294967296)) 4294967296)))} is VALID [2022-02-20 17:07:38,159 INFO L290 TraceCheckUtils]: 48: Hoare triple {1871#(or (< (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1871#(or (< (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,159 INFO L290 TraceCheckUtils]: 47: Hoare triple {1871#(or (< (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1871#(or (< (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,160 INFO L290 TraceCheckUtils]: 46: Hoare triple {1881#(or (< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1871#(or (< (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 5 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,160 INFO L290 TraceCheckUtils]: 45: Hoare triple {1881#(or (< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1881#(or (< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)))} is VALID [2022-02-20 17:07:38,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {1881#(or (< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1881#(or (< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)))} is VALID [2022-02-20 17:07:38,162 INFO L290 TraceCheckUtils]: 43: Hoare triple {1891#(or (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)) (< (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1881#(or (< (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ 6 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)))} is VALID [2022-02-20 17:07:38,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {1891#(or (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)) (< (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1891#(or (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)) (< (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,163 INFO L290 TraceCheckUtils]: 41: Hoare triple {1891#(or (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)) (< (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1891#(or (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)) (< (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,163 INFO L290 TraceCheckUtils]: 40: Hoare triple {1901#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) (* (- 1) (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) 5000000))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1891#(or (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296)) (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)) (< (mod (+ 7 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,164 INFO L290 TraceCheckUtils]: 39: Hoare triple {1901#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) (* (- 1) (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) 5000000))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1901#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) (* (- 1) (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {1901#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) (* (- 1) (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) 5000000))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1901#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) (* (- 1) (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {1911#(or (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296)) (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)) (< (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1901#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) (* (- 1) (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 8) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,165 INFO L290 TraceCheckUtils]: 36: Hoare triple {1911#(or (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296)) (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)) (< (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1911#(or (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296)) (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)) (< (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {1911#(or (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296)) (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)) (< (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1911#(or (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296)) (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)) (< (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,167 INFO L290 TraceCheckUtils]: 34: Hoare triple {1921#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) 5000000))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1911#(or (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296)) (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296)) 4294967296)) (< (mod (+ 9 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {1921#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) 5000000))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1921#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {1921#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) 5000000))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1921#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {1931#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296) 5000000))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1921#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 10) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {1931#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296) 5000000))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1931#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {1931#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296) 5000000))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1931#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {1941#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296)) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1931#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 11) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {1941#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296)) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1941#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296)) 4294967296)))} is VALID [2022-02-20 17:07:38,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {1941#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296)) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1941#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296)) 4294967296)))} is VALID [2022-02-20 17:07:38,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {1951#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296) (* (- 1) (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1941#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 12) 4294967296)) 4294967296)))} is VALID [2022-02-20 17:07:38,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {1951#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296) (* (- 1) (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1951#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296) (* (- 1) (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {1951#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296) (* (- 1) (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1951#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296) (* (- 1) (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {1961#(or (< (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296))) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1951#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 13) 4294967296) (* (- 1) (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {1961#(or (< (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296))) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1961#(or (< (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {1961#(or (< (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296))) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1961#(or (< (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {1971#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296) (* (- 1) (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296) 5000000))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1961#(or (< (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 14 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {1971#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296) (* (- 1) (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296) 5000000))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1971#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296) (* (- 1) (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {1971#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296) (* (- 1) (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296) 5000000))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1971#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296) (* (- 1) (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {1981#(or (<= 0 (div (+ (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296))) 4294967296)) (< (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1971#(or (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296) (* (- 1) (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)) (< (mod (+ |ULTIMATE.start_main_~x~0#1| 15) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {1981#(or (<= 0 (div (+ (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296))) 4294967296)) (< (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1981#(or (<= 0 (div (+ (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296))) 4294967296)) (< (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {1981#(or (<= 0 (div (+ (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296))) 4294967296)) (< (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1981#(or (<= 0 (div (+ (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296))) 4294967296)) (< (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {1991#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296))) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1981#(or (<= 0 (div (+ (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296))) 4294967296)) (< (mod (+ 16 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000))} is VALID [2022-02-20 17:07:38,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {1991#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296))) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {1991#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {1991#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296))) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {1991#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {2001#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296) (* (- 1) (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1991#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 17) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {2001#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296) (* (- 1) (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {2001#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296) (* (- 1) (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {2001#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296) (* (- 1) (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {2001#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296) (* (- 1) (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {2011#(or (< (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296))) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2001#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296) 5000000) (<= 0 (div (+ (mod (+ |ULTIMATE.start_main_~x~0#1| 18) 4294967296) (* (- 1) (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {2011#(or (< (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296))) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {2011#(or (< (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {2011#(or (< (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296))) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {2011#(or (< (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {2021#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 21 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296)) 4294967296)))} main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2011#(or (< (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296) 5000000) (<= 0 (div (+ (mod (+ 19 |ULTIMATE.start_main_~x~0#1|) 4294967296) (* (- 1) (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296))) 4294967296)))} is VALID [2022-02-20 17:07:38,183 INFO L290 TraceCheckUtils]: 3: Hoare triple {2021#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 21 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296)) 4294967296)))} assume !(main_~x~0#1 % 4294967296 >= 5000000); {2021#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 21 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296)) 4294967296)))} is VALID [2022-02-20 17:07:38,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {2021#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 21 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296)) 4294967296)))} assume !!(main_~x~0#1 % 4294967296 < main_~y~0#1 % 4294967296); {2021#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 21 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296)) 4294967296)))} is VALID [2022-02-20 17:07:38,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~post5#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := 0;main_~y~0#1 := 10000000;main_~z~0#1 := 5000000; {2021#(or (< (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296) 5000000) (<= 0 (div (+ (* (- 1) (mod (+ 21 |ULTIMATE.start_main_~x~0#1|) 4294967296)) (mod (+ |ULTIMATE.start_main_~x~0#1| 20) 4294967296)) 4294967296)))} is VALID [2022-02-20 17:07:38,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {1574#true} assume { :begin_inline_ULTIMATE.init } 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(18, 2);call #Ultimate.allocInit(12, 3); {1574#true} is VALID [2022-02-20 17:07:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:07:38,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513368781] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:07:38,184 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:07:38,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 26] total 49 [2022-02-20 17:07:38,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483156845] [2022-02-20 17:07:38,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:07:38,185 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-02-20 17:07:38,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:07:38,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:07:38,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:07:38,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-20 17:07:38,307 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:07:38,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-20 17:07:38,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=1726, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 17:07:38,309 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 49 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:08:19,502 WARN L228 SmtUtils]: Spent 30.98s on a formula simplification. DAG size of input: 202 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)